HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem equviniOLD 1532
Description: A variable introduction law for equality. Lemma 15 of [Monk2] p. 109, however we do not require z to be distinct from x and y (making the proof longer).
Assertion
Ref Expression
equviniOLD |- (x = y -> E.z(x = z /\ z = y))

Proof of Theorem equviniOLD
StepHypRef Expression
1 a9e 1483 . . . . . 6 |- E.z z = y
2 equid 1484 . . . . . . . 8 |- z = z
32jctl 314 . . . . . . 7 |- (z = y -> (z = z /\ z = y))
43eximi 1387 . . . . . 6 |- (E.z z = y -> E.z(z = z /\ z = y))
51, 4ax-mp 7 . . . . 5 |- E.z(z = z /\ z = y)
6 hbae 1505 . . . . . 6 |- (A.z z = x -> A.zA.z z = x)
7 ax-8 1306 . . . . . . . 8 |- (z = x -> (z = z -> x = z))
87a4s 1330 . . . . . . 7 |- (A.z z = x -> (z = z -> x = z))
98anim1d 619 . . . . . 6 |- (A.z z = x -> ((z = z /\ z = y) -> (x = z /\ z = y)))
106, 9eximd 1410 . . . . 5 |- (A.z z = x -> (E.z(z = z /\ z = y) -> E.z(x = z /\ z = y)))
115, 10mpi 55 . . . 4 |- (A.z z = x -> E.z(x = z /\ z = y))
12 a9e 1483 . . . . . 6 |- E.z z = x
13 equcomi 1487 . . . . . . . 8 |- (z = x -> x = z)
1413, 2jctir 317 . . . . . . 7 |- (z = x -> (x = z /\ z = z))
1514eximi 1387 . . . . . 6 |- (E.z z = x -> E.z(x = z /\ z = z))
1612, 15ax-mp 7 . . . . 5 |- E.z(x = z /\ z = z)
17 hbae 1505 . . . . . 6 |- (A.z z = y -> A.zA.z z = y)
18 equtrr 1491 . . . . . . . 8 |- (z = y -> (z = z -> z = y))
1918a4s 1330 . . . . . . 7 |- (A.z z = y -> (z = z -> z = y))
2019anim2d 620 . . . . . 6 |- (A.z z = y -> ((x = z /\ z = z) -> (x = z /\ z = y)))
2117, 20eximd 1410 . . . . 5 |- (A.z z = y -> (E.z(x = z /\ z = z) -> E.z(x = z /\ z = y)))
2216, 21mpi 55 . . . 4 |- (A.z z = y -> E.z(x = z /\ z = y))
2311, 22jaoi 368 . . 3 |- ((A.z z = x \/ A.z z = y) -> E.z(x = z /\ z = y))
2423a1d 15 . 2 |- ((A.z z = x \/ A.z z = y) -> (x = y -> E.z(x = z /\ z = y)))
25 ioran 331 . . 3 |- (-. (A.z z = x \/ A.z z = y) <-> (-. A.z z = x /\ -. A.z z = y))
26 hbnae 1507 . . . . 5 |- (-. A.z z = x -> A.z -. A.z z = x)
27 hbnae 1507 . . . . 5 |- (-. A.z z = y -> A.z -. A.z z = y)
2826, 27hban 1356 . . . 4 |- ((-. A.z z = x /\ -. A.z z = y) -> A.z(-. A.z z = x /\ -. A.z z = y))
29 ax-12 1310 . . . . 5 |- (-. A.z z = x -> (-. A.z z = y -> (x = y -> A.z x = y)))
3029imp 377 . . . 4 |- ((-. A.z z = x /\ -. A.z z = y) -> (x = y -> A.z x = y))
31 ax-8 1306 . . . . . 6 |- (x = z -> (x = y -> z = y))
3231anc2li 326 . . . . 5 |- (x = z -> (x = y -> (x = z /\ z = y)))
3332equcoms 1489 . . . 4 |- (z = x -> (x = y -> (x = z /\ z = y)))
3428, 30, 33a4imed 1522 . . 3 |- ((-. A.z z = x /\ -. A.z z = y) -> (x = y -> E.z(x = z /\ z = y)))
3525, 34sylbi 216 . 2 |- (-. (A.z z = x \/ A.z z = y) -> (x = y -> E.z(x = z /\ z = y)))
3624, 35pm2.61i 140 1 |- (x = y -> E.z(x = z /\ z = y))
Colors of variables: wff set class
Syntax hints:  -. wn 2   -> wi 3   \/ wo 239   /\ wa 240  A.wal 1296   = wceq 1298  E.wex 1326
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 1304  ax-gen 1305  ax-8 1306  ax-9 1307  ax-10 1308  ax-12 1310  ax-4 1319  ax-5o 1321  ax-6o 1324  ax-9o 1481  ax-10o 1500
This theorem depends on definitions:  df-bi 164  df-or 241  df-an 242  df-ex 1327
Copyright terms: Public domain