QLE Home Quantum Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  QLE Home  >  Th. List  >  ud2lem2 GIF version

Theorem ud2lem2 564
Description: Lemma for unified disjunction. (Contributed by NM, 23-Nov-1997.)
Assertion
Ref Expression
ud2lem2 ((a ∪ (a⊥ ∩ b⊥ )) →2 a) = (a ∪ b)

Proof of Theorem ud2lem2
StepHypRef Expression
1 df-i2 45 . 2 ((a ∪ (a⊥ ∩ b⊥ )) →2 a) = (a ∪ ((a ∪ (a⊥ ∩ b⊥ ))⊥ ∩ a⊥ ))
2 oran 87 . . . . . . 7 ((a ∪ (a⊥ ∩ b⊥ )) ∪ a) = ((a ∪ (a⊥ ∩ b⊥ ))⊥ ∩ a⊥ )⊥
32con2 67 . . . . . 6 ((a ∪ (a⊥ ∩ b⊥ )) ∪ a)⊥ = ((a ∪ (a⊥ ∩ b⊥ ))⊥ ∩ a⊥ )
43ax-r1 35 . . . . 5 ((a ∪ (a⊥ ∩ b⊥ ))⊥ ∩ a⊥ ) = ((a ∪ (a⊥ ∩ b⊥ )) ∪ a)⊥
5 oran 87 . . . . . . . . . . . . 13 (a ∪ b) = (a⊥ ∩ b⊥ )⊥
65con2 67 . . . . . . . . . . . 12 (a ∪ b)⊥ = (a⊥ ∩ b⊥ )
76ax-r1 35 . . . . . . . . . . 11 (a⊥ ∩ b⊥ ) = (a ∪ b)⊥
87lor 70 . . . . . . . . . 10 (a ∪ (a⊥ ∩ b⊥ )) = (a ∪ (a ∪ b)⊥ )
9 anor2 89 . . . . . . . . . . . 12 (a⊥ ∩ (a ∪ b)) = (a ∪ (a ∪ b)⊥ )⊥
109ax-r1 35 . . . . . . . . . . 11 (a ∪ (a ∪ b)⊥ )⊥ = (a⊥ ∩ (a ∪ b))
1110con3 68 . . . . . . . . . 10 (a ∪ (a ∪ b)⊥ ) = (a⊥ ∩ (a ∪ b))⊥
128, 11ax-r2 36 . . . . . . . . 9 (a ∪ (a⊥ ∩ b⊥ )) = (a⊥ ∩ (a ∪ b))⊥
1312con2 67 . . . . . . . 8 (a ∪ (a⊥ ∩ b⊥ ))⊥ = (a⊥ ∩ (a ∪ b))
1413ran 78 . . . . . . 7 ((a ∪ (a⊥ ∩ b⊥ ))⊥ ∩ a⊥ ) = ((a⊥ ∩ (a ∪ b)) ∩ a⊥ )
15 an32 83 . . . . . . . 8 ((a⊥ ∩ (a ∪ b)) ∩ a⊥ ) = ((a⊥ ∩ a⊥ ) ∩ (a ∪ b))
16 anidm 111 . . . . . . . . 9 (a⊥ ∩ a⊥ ) = a⊥
1716ran 78 . . . . . . . 8 ((a⊥ ∩ a⊥ ) ∩ (a ∪ b)) = (a⊥ ∩ (a ∪ b))
1815, 17ax-r2 36 . . . . . . 7 ((a⊥ ∩ (a ∪ b)) ∩ a⊥ ) = (a⊥ ∩ (a ∪ b))
1914, 18ax-r2 36 . . . . . 6 ((a ∪ (a⊥ ∩ b⊥ ))⊥ ∩ a⊥ ) = (a⊥ ∩ (a ∪ b))
203, 19ax-r2 36 . . . . 5 ((a ∪ (a⊥ ∩ b⊥ )) ∪ a)⊥ = (a⊥ ∩ (a ∪ b))
214, 20ax-r2 36 . . . 4 ((a ∪ (a⊥ ∩ b⊥ ))⊥ ∩ a⊥ ) = (a⊥ ∩ (a ∪ b))
2221lor 70 . . 3 (a ∪ ((a ∪ (a⊥ ∩ b⊥ ))⊥ ∩ a⊥ )) = (a ∪ (a⊥ ∩ (a ∪ b)))
23 oml 445 . . 3 (a ∪ (a⊥ ∩ (a ∪ b))) = (a ∪ b)
2422, 23ax-r2 36 . 2 (a ∪ ((a ∪ (a⊥ ∩ b⊥ ))⊥ ∩ a⊥ )) = (a ∪ b)
251, 24ax-r2 36 1 ((a ∪ (a⊥ ∩ b⊥ )) →2 a) = (a ∪ b)
Colors of variables:    term
This proof depends on syntax axioms:   = wb 1  ⊥ wn 4   ∪ wo 6   ∩ wa 7   →2 wi2 13
This proof depends on axioms:  ax-a1 30  ax-a2 31  ax-a3 32  ax-a5 34  ax-r1 35  ax-r2 36  ax-r4 37  ax-r5 38  ax-r3 439
This proof depends on definitions:  df-b 39  df-a 40  df-t 41  df-f 42  df-i2 45
This theorem is used by:  ud2  596
  Copyright terms: Public domain W3C validator