Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > atmod3i2 | Structured version Visualization version GIF version |
Description: Version of modular law that holds in a Hilbert lattice, when one element is an atom. (Contributed by NM, 10-Jun-2012.) (Revised by Mario Carneiro, 10-May-2013.) |
Ref | Expression |
---|---|
atmod.b | ⊢ 𝐵 = (Base‘𝐾) |
atmod.l | ⊢ ≤ = (le‘𝐾) |
atmod.j | ⊢ ∨ = (join‘𝐾) |
atmod.m | ⊢ ∧ = (meet‘𝐾) |
atmod.a | ⊢ 𝐴 = (Atoms‘𝐾) |
Ref | Expression |
---|---|
atmod3i2 | ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ 𝑋 ≤ 𝑌) → (𝑋 ∨ (𝑌 ∧ 𝑃)) = (𝑌 ∧ (𝑋 ∨ 𝑃))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | hllat 36379 | . . . 4 ⊢ (𝐾 ∈ HL → 𝐾 ∈ Lat) | |
2 | 1 | 3ad2ant1 1125 | . . 3 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ 𝑋 ≤ 𝑌) → 𝐾 ∈ Lat) |
3 | simp23 1200 | . . 3 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ 𝑋 ≤ 𝑌) → 𝑌 ∈ 𝐵) | |
4 | simp22 1199 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ 𝑋 ≤ 𝑌) → 𝑋 ∈ 𝐵) | |
5 | simp21 1198 | . . . . 5 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ 𝑋 ≤ 𝑌) → 𝑃 ∈ 𝐴) | |
6 | atmod.b | . . . . . 6 ⊢ 𝐵 = (Base‘𝐾) | |
7 | atmod.a | . . . . . 6 ⊢ 𝐴 = (Atoms‘𝐾) | |
8 | 6, 7 | atbase 36305 | . . . . 5 ⊢ (𝑃 ∈ 𝐴 → 𝑃 ∈ 𝐵) |
9 | 5, 8 | syl 17 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ 𝑋 ≤ 𝑌) → 𝑃 ∈ 𝐵) |
10 | atmod.j | . . . . 5 ⊢ ∨ = (join‘𝐾) | |
11 | 6, 10 | latjcl 17649 | . . . 4 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐵) → (𝑋 ∨ 𝑃) ∈ 𝐵) |
12 | 2, 4, 9, 11 | syl3anc 1363 | . . 3 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ 𝑋 ≤ 𝑌) → (𝑋 ∨ 𝑃) ∈ 𝐵) |
13 | atmod.m | . . . 4 ⊢ ∧ = (meet‘𝐾) | |
14 | 6, 13 | latmcom 17673 | . . 3 ⊢ ((𝐾 ∈ Lat ∧ 𝑌 ∈ 𝐵 ∧ (𝑋 ∨ 𝑃) ∈ 𝐵) → (𝑌 ∧ (𝑋 ∨ 𝑃)) = ((𝑋 ∨ 𝑃) ∧ 𝑌)) |
15 | 2, 3, 12, 14 | syl3anc 1363 | . 2 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ 𝑋 ≤ 𝑌) → (𝑌 ∧ (𝑋 ∨ 𝑃)) = ((𝑋 ∨ 𝑃) ∧ 𝑌)) |
16 | atmod.l | . . 3 ⊢ ≤ = (le‘𝐾) | |
17 | 6, 16, 10, 13, 7 | atmod1i2 36875 | . 2 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ 𝑋 ≤ 𝑌) → (𝑋 ∨ (𝑃 ∧ 𝑌)) = ((𝑋 ∨ 𝑃) ∧ 𝑌)) |
18 | 6, 13 | latmcom 17673 | . . . 4 ⊢ ((𝐾 ∈ Lat ∧ 𝑃 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑃 ∧ 𝑌) = (𝑌 ∧ 𝑃)) |
19 | 2, 9, 3, 18 | syl3anc 1363 | . . 3 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ 𝑋 ≤ 𝑌) → (𝑃 ∧ 𝑌) = (𝑌 ∧ 𝑃)) |
20 | 19 | oveq2d 7161 | . 2 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ 𝑋 ≤ 𝑌) → (𝑋 ∨ (𝑃 ∧ 𝑌)) = (𝑋 ∨ (𝑌 ∧ 𝑃))) |
21 | 15, 17, 20 | 3eqtr2rd 2860 | 1 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ 𝑋 ≤ 𝑌) → (𝑋 ∨ (𝑌 ∧ 𝑃)) = (𝑌 ∧ (𝑋 ∨ 𝑃))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ w3a 1079 = wceq 1528 ∈ wcel 2105 class class class wbr 5057 ‘cfv 6348 (class class class)co 7145 Basecbs 16471 lecple 16560 joincjn 17542 meetcmee 17543 Latclat 17643 Atomscatm 36279 HLchlt 36366 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1787 ax-4 1801 ax-5 1902 ax-6 1961 ax-7 2006 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2151 ax-12 2167 ax-ext 2790 ax-rep 5181 ax-sep 5194 ax-nul 5201 ax-pow 5257 ax-pr 5320 ax-un 7450 |
This theorem depends on definitions: df-bi 208 df-an 397 df-or 842 df-3an 1081 df-tru 1531 df-ex 1772 df-nf 1776 df-sb 2061 df-mo 2615 df-eu 2647 df-clab 2797 df-cleq 2811 df-clel 2890 df-nfc 2960 df-ne 3014 df-ral 3140 df-rex 3141 df-reu 3142 df-rab 3144 df-v 3494 df-sbc 3770 df-csb 3881 df-dif 3936 df-un 3938 df-in 3940 df-ss 3949 df-nul 4289 df-if 4464 df-pw 4537 df-sn 4558 df-pr 4560 df-op 4564 df-uni 4831 df-iun 4912 df-iin 4913 df-br 5058 df-opab 5120 df-mpt 5138 df-id 5453 df-xp 5554 df-rel 5555 df-cnv 5556 df-co 5557 df-dm 5558 df-rn 5559 df-res 5560 df-ima 5561 df-iota 6307 df-fun 6350 df-fn 6351 df-f 6352 df-f1 6353 df-fo 6354 df-f1o 6355 df-fv 6356 df-riota 7103 df-ov 7148 df-oprab 7149 df-mpo 7150 df-1st 7678 df-2nd 7679 df-proset 17526 df-poset 17544 df-plt 17556 df-lub 17572 df-glb 17573 df-join 17574 df-meet 17575 df-p0 17637 df-lat 17644 df-clat 17706 df-oposet 36192 df-ol 36194 df-oml 36195 df-covers 36282 df-ats 36283 df-atl 36314 df-cvlat 36338 df-hlat 36367 df-psubsp 36519 df-pmap 36520 df-padd 36812 |
This theorem is referenced by: dalawlem3 36889 |
Copyright terms: Public domain | W3C validator |