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

Theorem ud1lem3 544
Description: Lemma for unified disjunction.
Assertion
Ref Expression
ud1lem3 ((a1 b) →1 (ab)) = (ab)

Proof of Theorem ud1lem3
StepHypRef Expression
1 df-i1 43 . 2 ((a1 b) →1 (ab)) = ((a1 b) ∪ ((a1 b) ∩ (ab)))
2 ud1lem0c 269 . . . 4 (a1 b) = (a ∩ (ab ))
32con3 65 . . . . 5 (a1 b) = (a ∩ (ab ))
43ran 71 . . . 4 ((a1 b) ∩ (ab)) = ((a ∩ (ab )) ∩ (ab))
52, 42or 67 . . 3 ((a1 b) ∪ ((a1 b) ∩ (ab))) = ((a ∩ (ab )) ∪ ((a ∩ (ab )) ∩ (ab)))
6 comid 179 . . . . . 6 (a ∩ (ab )) C (a ∩ (ab ))
76comcom2 175 . . . . 5 (a ∩ (ab )) C (a ∩ (ab ))
8 comor1 443 . . . . . . 7 (ab) C a
98comcom2 175 . . . . . . . 8 (ab) C a
10 comor2 444 . . . . . . . . 9 (ab) C b
1110comcom2 175 . . . . . . . 8 (ab) C b
129, 11com2or 465 . . . . . . 7 (ab) C (ab )
138, 12com2an 466 . . . . . 6 (ab) C (a ∩ (ab ))
1413comcom 435 . . . . 5 (a ∩ (ab )) C (ab)
157, 14fh3 453 . . . 4 ((a ∩ (ab )) ∪ ((a ∩ (ab )) ∩ (ab))) = (((a ∩ (ab )) ∪ (a ∩ (ab )) ) ∩ ((a ∩ (ab )) ∪ (ab)))
16 ancom 68 . . . . 5 (((a ∩ (ab )) ∪ (a ∩ (ab )) ) ∩ ((a ∩ (ab )) ∪ (ab))) = (((a ∩ (ab )) ∪ (ab)) ∩ ((a ∩ (ab )) ∪ (a ∩ (ab )) ))
17 df-t 40 . . . . . . . 8 1 = ((a ∩ (ab )) ∪ (a ∩ (ab )) )
1817ax-r1 34 . . . . . . 7 ((a ∩ (ab )) ∪ (a ∩ (ab )) ) = 1
1918lan 70 . . . . . 6 (((a ∩ (ab )) ∪ (ab)) ∩ ((a ∩ (ab )) ∪ (a ∩ (ab )) )) = (((a ∩ (ab )) ∪ (ab)) ∩ 1)
20 an1 98 . . . . . . 7 (((a ∩ (ab )) ∪ (ab)) ∩ 1) = ((a ∩ (ab )) ∪ (ab))
21 comorr 176 . . . . . . . . 9 a C (ab)
22 comorr 176 . . . . . . . . . . 11 a C (ab )
2322comcom2 175 . . . . . . . . . 10 a C (ab )
2423comcom5 440 . . . . . . . . 9 a C (ab )
2521, 24fh4r 458 . . . . . . . 8 ((a ∩ (ab )) ∪ (ab)) = ((a ∪ (ab)) ∩ ((ab ) ∪ (ab)))
26 ax-a2 30 . . . . . . . . . . 11 ((ab ) ∪ (ab)) = ((ab) ∪ (ab ))
27 or4 77 . . . . . . . . . . . 12 ((ab) ∪ (ab )) = ((aa ) ∪ (bb ))
28 df-t 40 . . . . . . . . . . . . . . 15 1 = (bb )
2928ax-r1 34 . . . . . . . . . . . . . 14 (bb ) = 1
3029lor 66 . . . . . . . . . . . . 13 ((aa ) ∪ (bb )) = ((aa ) ∪ 1)
31 or1 96 . . . . . . . . . . . . 13 ((aa ) ∪ 1) = 1
3230, 31ax-r2 35 . . . . . . . . . . . 12 ((aa ) ∪ (bb )) = 1
3327, 32ax-r2 35 . . . . . . . . . . 11 ((ab) ∪ (ab )) = 1
3426, 33ax-r2 35 . . . . . . . . . 10 ((ab ) ∪ (ab)) = 1
3534lan 70 . . . . . . . . 9 ((a ∪ (ab)) ∩ ((ab ) ∪ (ab))) = ((a ∪ (ab)) ∩ 1)
36 an1 98 . . . . . . . . . 10 ((a ∪ (ab)) ∩ 1) = (a ∪ (ab))
37 ax-a3 31 . . . . . . . . . . . 12 ((aa) ∪ b) = (a ∪ (ab))
3837ax-r1 34 . . . . . . . . . . 11 (a ∪ (ab)) = ((aa) ∪ b)
39 oridm 102 . . . . . . . . . . . 12 (aa) = a
4039ax-r5 37 . . . . . . . . . . 11 ((aa) ∪ b) = (ab)
4138, 40ax-r2 35 . . . . . . . . . 10 (a ∪ (ab)) = (ab)
4236, 41ax-r2 35 . . . . . . . . 9 ((a ∪ (ab)) ∩ 1) = (ab)
4335, 42ax-r2 35 . . . . . . . 8 ((a ∪ (ab)) ∩ ((ab ) ∪ (ab))) = (ab)
4425, 43ax-r2 35 . . . . . . 7 ((a ∩ (ab )) ∪ (ab)) = (ab)
4520, 44ax-r2 35 . . . . . 6 (((a ∩ (ab )) ∪ (ab)) ∩ 1) = (ab)
4619, 45ax-r2 35 . . . . 5 (((a ∩ (ab )) ∪ (ab)) ∩ ((a ∩ (ab )) ∪ (a ∩ (ab )) )) = (ab)
4716, 46ax-r2 35 . . . 4 (((a ∩ (ab )) ∪ (a ∩ (ab )) ) ∩ ((a ∩ (ab )) ∪ (ab))) = (ab)
4815, 47ax-r2 35 . . 3 ((a ∩ (ab )) ∪ ((a ∩ (ab )) ∩ (ab))) = (ab)
495, 48ax-r2 35 . 2 ((a1 b) ∪ ((a1 b) ∩ (ab))) = (ab)
501, 49ax-r2 35 1 ((a1 b) →1 (ab)) = (ab)
Colors of variables: term
Syntax hints:   = wb 1   wn 4   ∪ wo 6   ∩ wa 7  1wt 9   →1 wi1 13
This theorem is referenced by:  ud1 577
This theorem was proved from axioms:  ax-a1 29  ax-a2 30  ax-a3 31  ax-a4 32  ax-a5 33  ax-r1 34  ax-r2 35  ax-r4 36  ax-r5 37  ax-r3 421
This theorem depends on definitions:  df-b 38  df-a 39  df-t 40  df-f 41  df-i1 43  df-le1 122  df-le2 123  df-c1 124  df-c2 125
metamath.org