NFE Home New Foundations Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  NFE Home  >  Th. List  >  equid1ALT GIF version

Theorem equid1ALT 2176
Description: Identity law for equality (reflexivity). Lemma 6 of [Tarski] p. 68. Alternate proof of equid1 2158 from older axioms ax-6o 2137 and ax-9o 2138. (Contributed by NM, 5-Aug-1993.) (Proof modification is discouraged.) (New usage is discouraged.)
Assertion
Ref Expression
equid1ALT ⊢ x = x

Proof of Theorem equid1ALT
StepHypRef Expression
1 ax-12o 2142 . . . . 5 ⊢ (¬ ∀x x = x → (¬ ∀x x = x → (x = x → ∀x x = x)))
21pm2.43i 43 . . . 4 ⊢ (¬ ∀x x = x → (x = x → ∀x x = x))
32alimi 1559 . . 3 ⊢ (∀x ¬ ∀x x = x → ∀x(x = x → ∀x x = x))
4 ax-9o 2138 . . 3 ⊢ (∀x(x = x → ∀x x = x) → x = x)
53, 4syl 15 . 2 ⊢ (∀x ¬ ∀x x = x → x = x)
6 ax-6o 2137 . 2 ⊢ (¬ ∀x ¬ ∀x x = x → x = x)
75, 6pm2.61i 156 1 ⊢ x = x
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4  ∀wal 1540
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1546  ax-5 1557  ax-6o 2137  ax-9o 2138  ax-12o 2142
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator