Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  ax12olem3OLD Unicode version

Theorem ax12olem3OLD 1979
 Description: Obsolete proof of ax12oOLD 1984 as of 30-Jan-2018. Lemma for ax12oOLD 1984. Show the equivalence of an intermediate equivalent to ax12o 1976 with the conjunction of ax-12 1946 and a variant with negated equalities. (Contributed by NM, 24-Dec-2015.) (New usage is discouraged.) (Proof modification is discouraged.)
Assertion
Ref Expression
ax12olem3OLD

Proof of Theorem ax12olem3OLD
StepHypRef Expression
1 sp 1759 . . . . . 6
21con2i 114 . . . . 5
32imim1i 56 . . . 4
43imim2i 14 . . 3
5 sp 1759 . . . . . 6
65imim2i 14 . . . . 5
76con1d 118 . . . 4
87imim2i 14 . . 3
94, 8jca 519 . 2
10 con1 122 . . . . . 6
1110imim1d 71 . . . . 5
1211com12 29 . . . 4
1312imim3i 57 . . 3
1413imp 419 . 2
159, 14impbii 181 1
 Colors of variables: wff set class Syntax hints:   wn 3   wi 4   wb 177   wa 359  wal 1546 This theorem is referenced by:  ax12olem4OLD  1980  ax12olem4wAUX7  29164  ax12olem4OLD7  29391 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1552  ax-5 1563  ax-17 1623  ax-9 1662  ax-8 1683  ax-11 1757 This theorem depends on definitions:  df-bi 178  df-an 361  df-ex 1548
 Copyright terms: Public domain W3C validator