| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > omllaw2N | Structured version Visualization version GIF version | ||
| Description: Variation of orthomodular law. Definition of OML law in [Kalmbach] p. 22. (pjoml2i 31674 analog.) (Contributed by NM, 6-Nov-2011.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| omllaw.b | ⊢ 𝐵 = (Base‘𝐾) |
| omllaw.l | ⊢ ≤ = (le‘𝐾) |
| omllaw.j | ⊢ ∨ = (join‘𝐾) |
| omllaw.m | ⊢ ∧ = (meet‘𝐾) |
| omllaw.o | ⊢ ⊥ = (oc‘𝐾) |
| Ref | Expression |
|---|---|
| omllaw2N | ⊢ ((𝐾 ∈ OML ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ≤ 𝑌 → (𝑋 ∨ (( ⊥ ‘𝑋) ∧ 𝑌)) = 𝑌)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | omllaw.b | . . 3 ⊢ 𝐵 = (Base‘𝐾) | |
| 2 | omllaw.l | . . 3 ⊢ ≤ = (le‘𝐾) | |
| 3 | omllaw.j | . . 3 ⊢ ∨ = (join‘𝐾) | |
| 4 | omllaw.m | . . 3 ⊢ ∧ = (meet‘𝐾) | |
| 5 | omllaw.o | . . 3 ⊢ ⊥ = (oc‘𝐾) | |
| 6 | 1, 2, 3, 4, 5 | omllaw 39735 | . 2 ⊢ ((𝐾 ∈ OML ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ≤ 𝑌 → 𝑌 = (𝑋 ∨ (𝑌 ∧ ( ⊥ ‘𝑋))))) |
| 7 | eqcom 2746 | . . 3 ⊢ ((𝑋 ∨ (( ⊥ ‘𝑋) ∧ 𝑌)) = 𝑌 ↔ 𝑌 = (𝑋 ∨ (( ⊥ ‘𝑋) ∧ 𝑌))) | |
| 8 | omllat 39734 | . . . . . . 7 ⊢ (𝐾 ∈ OML → 𝐾 ∈ Lat) | |
| 9 | 8 | 3ad2ant1 1139 | . . . . . 6 ⊢ ((𝐾 ∈ OML ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝐾 ∈ Lat) |
| 10 | omlop 39733 | . . . . . . . 8 ⊢ (𝐾 ∈ OML → 𝐾 ∈ OP) | |
| 11 | 1, 5 | opoccl 39686 | . . . . . . . 8 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵) → ( ⊥ ‘𝑋) ∈ 𝐵) |
| 12 | 10, 11 | sylan 586 | . . . . . . 7 ⊢ ((𝐾 ∈ OML ∧ 𝑋 ∈ 𝐵) → ( ⊥ ‘𝑋) ∈ 𝐵) |
| 13 | 12 | 3adant3 1138 | . . . . . 6 ⊢ ((𝐾 ∈ OML ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ( ⊥ ‘𝑋) ∈ 𝐵) |
| 14 | simp3 1144 | . . . . . 6 ⊢ ((𝐾 ∈ OML ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑌 ∈ 𝐵) | |
| 15 | 1, 4 | latmcom 18420 | . . . . . 6 ⊢ ((𝐾 ∈ Lat ∧ ( ⊥ ‘𝑋) ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (( ⊥ ‘𝑋) ∧ 𝑌) = (𝑌 ∧ ( ⊥ ‘𝑋))) |
| 16 | 9, 13, 14, 15 | syl3anc 1379 | . . . . 5 ⊢ ((𝐾 ∈ OML ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (( ⊥ ‘𝑋) ∧ 𝑌) = (𝑌 ∧ ( ⊥ ‘𝑋))) |
| 17 | 16 | oveq2d 7372 | . . . 4 ⊢ ((𝐾 ∈ OML ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ∨ (( ⊥ ‘𝑋) ∧ 𝑌)) = (𝑋 ∨ (𝑌 ∧ ( ⊥ ‘𝑋)))) |
| 18 | 17 | eqeq2d 2750 | . . 3 ⊢ ((𝐾 ∈ OML ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑌 = (𝑋 ∨ (( ⊥ ‘𝑋) ∧ 𝑌)) ↔ 𝑌 = (𝑋 ∨ (𝑌 ∧ ( ⊥ ‘𝑋))))) |
| 19 | 7, 18 | bitrid 284 | . 2 ⊢ ((𝐾 ∈ OML ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((𝑋 ∨ (( ⊥ ‘𝑋) ∧ 𝑌)) = 𝑌 ↔ 𝑌 = (𝑋 ∨ (𝑌 ∧ ( ⊥ ‘𝑋))))) |
| 20 | 6, 19 | sylibrd 260 | 1 ⊢ ((𝐾 ∈ OML ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ≤ 𝑌 → (𝑋 ∨ (( ⊥ ‘𝑋) ∧ 𝑌)) = 𝑌)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ w3a 1092 = wceq 1547 ∈ wcel 2119 class class class wbr 5072 ‘cfv 6485 (class class class)co 7356 Basecbs 17170 lecple 17218 occoc 17219 joincjn 18268 meetcmee 18269 Latclat 18388 OPcops 39664 OMLcoml 39667 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2711 ax-rep 5199 ax-sep 5218 ax-nul 5228 ax-pow 5294 ax-pr 5362 ax-un 7678 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2718 df-cleq 2731 df-clel 2814 df-nfc 2888 df-ne 2935 df-ral 3054 df-rex 3064 df-rmo 3344 df-reu 3345 df-rab 3392 df-v 3433 df-sbc 3724 df-csb 3832 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4262 df-if 4455 df-pw 4531 df-sn 4556 df-pr 4558 df-op 4562 df-uni 4839 df-iun 4923 df-br 5073 df-opab 5135 df-mpt 5154 df-id 5513 df-xp 5624 df-rel 5625 df-cnv 5626 df-co 5627 df-dm 5628 df-rn 5629 df-res 5630 df-ima 5631 df-iota 6441 df-fun 6487 df-fn 6488 df-f 6489 df-f1 6490 df-fo 6491 df-f1o 6492 df-fv 6493 df-riota 7313 df-ov 7359 df-oprab 7360 df-glb 18302 df-meet 18304 df-lat 18389 df-oposet 39668 df-ol 39670 df-oml 39671 |
| This theorem is referenced by: omllaw5N 39739 cmtcomlemN 39740 cmtbr3N 39746 |
| Copyright terms: Public domain | W3C validator |