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

Theorem prlem2 850
Description: A specialized lemma for set theory (to derive the Axiom of Pairing). (The proof was shortened by Andrew Salmon, 13-May-2011.)
Assertion
Ref Expression
prlem2 |- (((ph /\ ps) \/ (ch /\ th)) <-> ((ph \/ ch) /\ ((ph /\ ps) \/ (ch /\ th))))

Proof of Theorem prlem2
StepHypRef Expression
1 orc 291 . . . . 5 |- (ph -> (ph \/ ch))
21adantr 425 . . . 4 |- ((ph /\ ps) -> (ph \/ ch))
3 olc 290 . . . . 5 |- (ch -> (ph \/ ch))
43adantr 425 . . . 4 |- ((ch /\ th) -> (ph \/ ch))
52, 4jaoi 368 . . 3 |- (((ph /\ ps) \/ (ch /\ th)) -> (ph \/ ch))
6 id 73 . . 3 |- (((ph /\ ps) \/ (ch /\ th)) -> ((ph /\ ps) \/ (ch /\ th)))
75, 6jca 310 . 2 |- (((ph /\ ps) \/ (ch /\ th)) -> ((ph \/ ch) /\ ((ph /\ ps) \/ (ch /\ th))))
8 simpr 350 . 2 |- (((ph \/ ch) /\ ((ph /\ ps) \/ (ch /\ th))) -> ((ph /\ ps) \/ (ch /\ th)))
97, 8impbii 174 1 |- (((ph /\ ps) \/ (ch /\ th)) <-> ((ph \/ ch) /\ ((ph /\ ps) \/ (ch /\ th))))
Colors of variables: wff set class
Syntax hints:   <-> wb 163   \/ wo 239   /\ wa 240
This theorem is referenced by:  zfpair 3522
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7
This theorem depends on definitions:  df-bi 164  df-or 241  df-an 242
Copyright terms: Public domain