| Quantum Logic Explorer |
< Previous
Next >
Related theorems GIF version |
| Description: Lemma for orthoarguesian law (Godowski/Greechie 3-variable to 4-variable proof). |
| Ref | Expression |
|---|---|
| oa3to4lem.1 | a⊥ ≤ b |
| oa3to4lem.2 | c⊥ ≤ d |
| oa3to4lem.3 | g = ((a ∩ b) ∪ (c ∩ d)) |
| Ref | Expression |
|---|---|
| oa3to4lem3 | (a ∩ (b ∪ (d ∩ ((a ∩ c) ∪ (b ∩ d))))) ≤ (a ∩ ((a →1 g) ∪ ((c →1 g) ∩ ((a ∩ c) ∪ ((a →1 g) ∩ (c →1 g)))))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | oa3to4lem.1 | . . . 4 a⊥ ≤ b | |
| 2 | oa3to4lem.2 | . . . 4 c⊥ ≤ d | |
| 3 | oa3to4lem.3 | . . . 4 g = ((a ∩ b) ∪ (c ∩ d)) | |
| 4 | 1, 2, 3 | oa3to4lem1 925 | . . 3 b ≤ (a →1 g) |
| 5 | 1, 2, 3 | oa3to4lem2 926 | . . . 4 d ≤ (c →1 g) |
| 6 | 4, 5 | le2an 161 | . . . . 5 (b ∩ d) ≤ ((a →1 g) ∩ (c →1 g)) |
| 7 | 6 | lelor 158 | . . . 4 ((a ∩ c) ∪ (b ∩ d)) ≤ ((a ∩ c) ∪ ((a →1 g) ∩ (c →1 g))) |
| 8 | 5, 7 | le2an 161 | . . 3 (d ∩ ((a ∩ c) ∪ (b ∩ d))) ≤ ((c →1 g) ∩ ((a ∩ c) ∪ ((a →1 g) ∩ (c →1 g)))) |
| 9 | 4, 8 | le2or 160 | . 2 (b ∪ (d ∩ ((a ∩ c) ∪ (b ∩ d)))) ≤ ((a →1 g) ∪ ((c →1 g) ∩ ((a ∩ c) ∪ ((a →1 g) ∩ (c →1 g))))) |
| 10 | 9 | lelan 159 | 1 (a ∩ (b ∪ (d ∩ ((a ∩ c) ∪ (b ∩ d))))) ≤ (a ∩ ((a →1 g) ∪ ((c →1 g) ∩ ((a ∩ c) ∪ ((a →1 g) ∩ (c →1 g)))))) |
| Colors of variables: term |
| Syntax hints: = wb 1 ≤ wle 2 ⊥ wn 4 ∪ wo 6 ∩ wa 7 →1 wi1 13 |
| This theorem is referenced by: oa3to4lem4 928 |
| 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 |