[Lattice L46-7]Home PageHome Quantum Logic Explorer < Previous   Next >
Related theorems
GIF version

Theorem ud1lem0c 269
Description: Lemma for unified disjunction.
Assertion
Ref Expression
ud1lem0c (a1 b) = (a ∩ (ab ))

Proof of Theorem ud1lem0c
StepHypRef Expression
1 df-i1 43 . . 3 (a1 b) = (a ∪ (ab))
2 df-a 39 . . . . . 6 (a ∩ (ab )) = (a ∪ (ab ) )
3 df-a 39 . . . . . . . . 9 (ab) = (ab )
43ax-r1 34 . . . . . . . 8 (ab ) = (ab)
54lor 66 . . . . . . 7 (a ∪ (ab ) ) = (a ∪ (ab))
65ax-r4 36 . . . . . 6 (a ∪ (ab ) ) = (a ∪ (ab))
72, 6ax-r2 35 . . . . 5 (a ∩ (ab )) = (a ∪ (ab))
87ax-r1 34 . . . 4 (a ∪ (ab)) = (a ∩ (ab ))
98con3 65 . . 3 (a ∪ (ab)) = (a ∩ (ab ))
101, 9ax-r2 35 . 2 (a1 b) = (a ∩ (ab ))
1110con2 64 1 (a1 b) = (a ∩ (ab ))
Colors of variables: term
Syntax hints:   = wb 1   wn 4   ∪ wo 6   ∩ wa 7   →1 wi1 13
This theorem is referenced by:  ud1lem1 542  ud1lem3 544  u1lemc6 688  u1lem11 762  i1abs 783  sa5 818  elimcons2 851  kb10iii 875
This theorem was proved from axioms:  ax-a1 29  ax-a2 30  ax-r1 34  ax-r2 35  ax-r4 36  ax-r5 37
This theorem depends on definitions:  df-a 39  df-i1 43
metamath.org