![]() |
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 31617 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 39199 | . 2 ⊢ ((𝐾 ∈ OML ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ≤ 𝑌 → 𝑌 = (𝑋 ∨ (𝑌 ∧ ( ⊥ ‘𝑋))))) |
7 | eqcom 2747 | . . 3 ⊢ ((𝑋 ∨ (( ⊥ ‘𝑋) ∧ 𝑌)) = 𝑌 ↔ 𝑌 = (𝑋 ∨ (( ⊥ ‘𝑋) ∧ 𝑌))) | |
8 | omllat 39198 | . . . . . . 7 ⊢ (𝐾 ∈ OML → 𝐾 ∈ Lat) | |
9 | 8 | 3ad2ant1 1133 | . . . . . 6 ⊢ ((𝐾 ∈ OML ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝐾 ∈ Lat) |
10 | omlop 39197 | . . . . . . . 8 ⊢ (𝐾 ∈ OML → 𝐾 ∈ OP) | |
11 | 1, 5 | opoccl 39150 | . . . . . . . 8 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵) → ( ⊥ ‘𝑋) ∈ 𝐵) |
12 | 10, 11 | sylan 579 | . . . . . . 7 ⊢ ((𝐾 ∈ OML ∧ 𝑋 ∈ 𝐵) → ( ⊥ ‘𝑋) ∈ 𝐵) |
13 | 12 | 3adant3 1132 | . . . . . 6 ⊢ ((𝐾 ∈ OML ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ( ⊥ ‘𝑋) ∈ 𝐵) |
14 | simp3 1138 | . . . . . 6 ⊢ ((𝐾 ∈ OML ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑌 ∈ 𝐵) | |
15 | 1, 4 | latmcom 18533 | . . . . . 6 ⊢ ((𝐾 ∈ Lat ∧ ( ⊥ ‘𝑋) ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (( ⊥ ‘𝑋) ∧ 𝑌) = (𝑌 ∧ ( ⊥ ‘𝑋))) |
16 | 9, 13, 14, 15 | syl3anc 1371 | . . . . 5 ⊢ ((𝐾 ∈ OML ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (( ⊥ ‘𝑋) ∧ 𝑌) = (𝑌 ∧ ( ⊥ ‘𝑋))) |
17 | 16 | oveq2d 7464 | . . . 4 ⊢ ((𝐾 ∈ OML ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ∨ (( ⊥ ‘𝑋) ∧ 𝑌)) = (𝑋 ∨ (𝑌 ∧ ( ⊥ ‘𝑋)))) |
18 | 17 | eqeq2d 2751 | . . 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 1537 ∈ wcel 2108 class class class wbr 5166 ‘cfv 6573 (class class class)co 7448 Basecbs 17258 lecple 17318 occoc 17319 joincjn 18381 meetcmee 18382 Latclat 18501 OPcops 39128 OMLcoml 39131 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2158 ax-12 2178 ax-ext 2711 ax-rep 5303 ax-sep 5317 ax-nul 5324 ax-pow 5383 ax-pr 5447 ax-un 7770 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2065 df-mo 2543 df-eu 2572 df-clab 2718 df-cleq 2732 df-clel 2819 df-nfc 2895 df-ne 2947 df-ral 3068 df-rex 3077 df-rmo 3388 df-reu 3389 df-rab 3444 df-v 3490 df-sbc 3805 df-csb 3922 df-dif 3979 df-un 3981 df-in 3983 df-ss 3993 df-nul 4353 df-if 4549 df-pw 4624 df-sn 4649 df-pr 4651 df-op 4655 df-uni 4932 df-iun 5017 df-br 5167 df-opab 5229 df-mpt 5250 df-id 5593 df-xp 5706 df-rel 5707 df-cnv 5708 df-co 5709 df-dm 5710 df-rn 5711 df-res 5712 df-ima 5713 df-iota 6525 df-fun 6575 df-fn 6576 df-f 6577 df-f1 6578 df-fo 6579 df-f1o 6580 df-fv 6581 df-riota 7404 df-ov 7451 df-oprab 7452 df-glb 18417 df-meet 18419 df-lat 18502 df-oposet 39132 df-ol 39134 df-oml 39135 |
This theorem is referenced by: omllaw5N 39203 cmtcomlemN 39204 cmtbr3N 39210 |
Copyright terms: Public domain | W3C validator |