| 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 31656 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 39689 | . 2 ⊢ ((𝐾 ∈ OML ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ≤ 𝑌 → 𝑌 = (𝑋 ∨ (𝑌 ∧ ( ⊥ ‘𝑋))))) |
| 7 | eqcom 2743 | . . 3 ⊢ ((𝑋 ∨ (( ⊥ ‘𝑋) ∧ 𝑌)) = 𝑌 ↔ 𝑌 = (𝑋 ∨ (( ⊥ ‘𝑋) ∧ 𝑌))) | |
| 8 | omllat 39688 | . . . . . . 7 ⊢ (𝐾 ∈ OML → 𝐾 ∈ Lat) | |
| 9 | 8 | 3ad2ant1 1134 | . . . . . 6 ⊢ ((𝐾 ∈ OML ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝐾 ∈ Lat) |
| 10 | omlop 39687 | . . . . . . . 8 ⊢ (𝐾 ∈ OML → 𝐾 ∈ OP) | |
| 11 | 1, 5 | opoccl 39640 | . . . . . . . 8 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵) → ( ⊥ ‘𝑋) ∈ 𝐵) |
| 12 | 10, 11 | sylan 581 | . . . . . . 7 ⊢ ((𝐾 ∈ OML ∧ 𝑋 ∈ 𝐵) → ( ⊥ ‘𝑋) ∈ 𝐵) |
| 13 | 12 | 3adant3 1133 | . . . . . 6 ⊢ ((𝐾 ∈ OML ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ( ⊥ ‘𝑋) ∈ 𝐵) |
| 14 | simp3 1139 | . . . . . 6 ⊢ ((𝐾 ∈ OML ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑌 ∈ 𝐵) | |
| 15 | 1, 4 | latmcom 18429 | . . . . . 6 ⊢ ((𝐾 ∈ Lat ∧ ( ⊥ ‘𝑋) ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (( ⊥ ‘𝑋) ∧ 𝑌) = (𝑌 ∧ ( ⊥ ‘𝑋))) |
| 16 | 9, 13, 14, 15 | syl3anc 1374 | . . . . 5 ⊢ ((𝐾 ∈ OML ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (( ⊥ ‘𝑋) ∧ 𝑌) = (𝑌 ∧ ( ⊥ ‘𝑋))) |
| 17 | 16 | oveq2d 7383 | . . . 4 ⊢ ((𝐾 ∈ OML ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ∨ (( ⊥ ‘𝑋) ∧ 𝑌)) = (𝑋 ∨ (𝑌 ∧ ( ⊥ ‘𝑋)))) |
| 18 | 17 | eqeq2d 2747 | . . 3 ⊢ ((𝐾 ∈ OML ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑌 = (𝑋 ∨ (( ⊥ ‘𝑋) ∧ 𝑌)) ↔ 𝑌 = (𝑋 ∨ (𝑌 ∧ ( ⊥ ‘𝑋))))) |
| 19 | 7, 18 | bitrid 283 | . 2 ⊢ ((𝐾 ∈ OML ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((𝑋 ∨ (( ⊥ ‘𝑋) ∧ 𝑌)) = 𝑌 ↔ 𝑌 = (𝑋 ∨ (𝑌 ∧ ( ⊥ ‘𝑋))))) |
| 20 | 6, 19 | sylibrd 259 | 1 ⊢ ((𝐾 ∈ OML ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ≤ 𝑌 → (𝑋 ∨ (( ⊥ ‘𝑋) ∧ 𝑌)) = 𝑌)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 class class class wbr 5085 ‘cfv 6498 (class class class)co 7367 Basecbs 17179 lecple 17227 occoc 17228 joincjn 18277 meetcmee 18278 Latclat 18397 OPcops 39618 OMLcoml 39621 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2708 ax-rep 5212 ax-sep 5231 ax-nul 5241 ax-pow 5307 ax-pr 5375 ax-un 7689 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-ral 3052 df-rex 3062 df-rmo 3342 df-reu 3343 df-rab 3390 df-v 3431 df-sbc 3729 df-csb 3838 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-nul 4274 df-if 4467 df-pw 4543 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4851 df-iun 4935 df-br 5086 df-opab 5148 df-mpt 5167 df-id 5526 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-iota 6454 df-fun 6500 df-fn 6501 df-f 6502 df-f1 6503 df-fo 6504 df-f1o 6505 df-fv 6506 df-riota 7324 df-ov 7370 df-oprab 7371 df-glb 18311 df-meet 18313 df-lat 18398 df-oposet 39622 df-ol 39624 df-oml 39625 |
| This theorem is referenced by: omllaw5N 39693 cmtcomlemN 39694 cmtbr3N 39700 |
| Copyright terms: Public domain | W3C validator |