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

Theorem prlem2 577
Description: A specialized lemma for set theory (axiom of pairing).
Assertion
Ref Expression
prlem2 |- (((ph /\ ps) \/ (ch /\ th)) <-> ((ph \/ ch) /\ ((ph /\ ps) \/ (ch /\ th))))

Proof of Theorem prlem2
StepHypRef Expression
1 oel 441 . . . . 5 |- (ph <-> ((ph \/ ch) /\ ph))
21anbi1i 368 . . . 4 |- ((ph /\ ps) <-> (((ph \/ ch) /\ ph) /\ ps))
3 anass 336 . . . 4 |- ((((ph \/ ch) /\ ph) /\ ps) <-> ((ph \/ ch) /\ (ph /\ ps)))
42, 3bitr 151 . . 3 |- ((ph /\ ps) <-> ((ph \/ ch) /\ (ph /\ ps)))
5 oel 441 . . . . . 6 |- (ch <-> ((ch \/ ph) /\ ch))
6 orcom 209 . . . . . . 7 |- ((ch \/ ph) <-> (ph \/ ch))
76anbi1i 368 . . . . . 6 |- (((ch \/ ph) /\ ch) <-> ((ph \/ ch) /\ ch))
85, 7bitr 151 . . . . 5 |- (ch <-> ((ph \/ ch) /\ ch))
98anbi1i 368 . . . 4 |- ((ch /\ th) <-> (((ph \/ ch) /\ ch) /\ th))
10 anass 336 . . . 4 |- ((((ph \/ ch) /\ ch) /\ th) <-> ((ph \/ ch) /\ (ch /\ th)))
119, 10bitr 151 . . 3 |- ((ch /\ th) <-> ((ph \/ ch) /\ (ch /\ th)))
124, 11orbi12i 216 . 2 |- (((ph /\ ps) \/ (ch /\ th)) <-> (((ph \/ ch) /\ (ph /\ ps)) \/ ((ph \/ ch) /\ (ch /\ th))))
13 andi 456 . 2 |- (((ph \/ ch) /\ ((ph /\ ps) \/ (ch /\ th))) <-> (((ph \/ ch) /\ (ph /\ ps)) \/ ((ph \/ ch) /\ (ch /\ th))))
1412, 13bitr4 154 1 |- (((ph /\ ps) \/ (ch /\ th)) <-> ((ph \/ ch) /\ ((ph /\ ps) \/ (ch /\ th))))
Colors of variables: wff set class
Syntax hints:   <-> wb 127   \/ wo 195   /\ wa 196
This theorem is referenced by:  zfpair 1891
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6
This theorem depends on definitions:  df-bi 128  df-or 197  df-an 198
metamath.org