| Quantum Logic Explorer |
< Previous
Next >
Related theorems GIF version |
| Description: An attempt at the OA3 conjecture, which is true if (a ≡ b) = 1. (Contributed by Josiah Burroughs 27-May-04.) |
| Ref | Expression |
|---|---|
| oi3oa3lem1.1 | 1 = (b ≡ a) |
| Ref | Expression |
|---|---|
| oi3oa3lem1 | (((a →1 c) ∩ (b →1 c)) ∪ (a ∩ b)) = 1 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | oi3oa3lem1.1 | . . . . . 6 1 = (b ≡ a) | |
| 2 | 1 | r3a 422 | . . . . 5 b = a |
| 3 | 2 | ud1lem0b 248 | . . . 4 (b →1 c) = (a →1 c) |
| 4 | 3 | lan 70 | . . 3 ((a →1 c) ∩ (b →1 c)) = ((a →1 c) ∩ (a →1 c)) |
| 5 | 2 | lan 70 | . . 3 (a ∩ b) = (a ∩ a) |
| 6 | 4, 5 | 2or 67 | . 2 (((a →1 c) ∩ (b →1 c)) ∪ (a ∩ b)) = (((a →1 c) ∩ (a →1 c)) ∪ (a ∩ a)) |
| 7 | anidm 103 | . . 3 ((a →1 c) ∩ (a →1 c)) = (a →1 c) | |
| 8 | anidm 103 | . . 3 (a ∩ a) = a | |
| 9 | 7, 8 | 2or 67 | . 2 (((a →1 c) ∩ (a →1 c)) ∪ (a ∩ a)) = ((a →1 c) ∪ a) |
| 10 | u1lemoa 602 | . 2 ((a →1 c) ∪ a) = 1 | |
| 11 | 6, 9, 10 | 3tr 62 | 1 (((a →1 c) ∩ (b →1 c)) ∪ (a ∩ b)) = 1 |
| Colors of variables: term |
| Syntax hints: = wb 1 ≡ tb 5 ∪ wo 6 ∩ wa 7 1wt 9 →1 wi1 13 |
| This theorem is referenced by: oi3oa3 715 |
| 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 |