We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
2 parents 7b80c3a + 810cca8 commit 9e2effbCopy full SHA for 9e2effb
Analysis/Section_2_epilogue.lean
@@ -128,7 +128,7 @@ abbrev Equiv.fromNat (P : PeanoAxioms) : Equiv Mathlib.Nat P where
128
129
abbrev Equiv.mk' (P Q : PeanoAxioms) : Equiv P Q := by sorry
130
131
-theorem PeanoAxioms.Equiv.uniq {P Q : PeanoAxioms} (equiv1 equiv2 : PeanoAxioms.Equiv P Q) : equiv1 = equiv2 := by
+theorem Equiv.uniq {P Q : PeanoAxioms} (equiv1 equiv2 : PeanoAxioms.Equiv P Q) : equiv1 = equiv2 := by
132
sorry
133
134
/-- A sample result: recursion is well-defined on any structure obeying the Peano axioms-/
0 commit comments