| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > 2polssN | Structured version Visualization version GIF version | ||
| Description: A set of atoms is a subset of its double polarity. (Contributed by NM, 29-Jan-2012.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| 2polss.a | ⊢ 𝐴 = (Atoms‘𝐾) |
| 2polss.p | ⊢ ⊥ = (⊥𝑃‘𝐾) |
| Ref | Expression |
|---|---|
| 2polssN | ⊢ ((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) → 𝑋 ⊆ ( ⊥ ‘( ⊥ ‘𝑋))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | hlclat 39804 | . . . . . 6 ⊢ (𝐾 ∈ HL → 𝐾 ∈ CLat) | |
| 2 | 1 | ad3antrrr 731 | . . . . 5 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) ∧ 𝑝 ∈ 𝐴) ∧ 𝑝 ∈ 𝑋) → 𝐾 ∈ CLat) |
| 3 | simpr 484 | . . . . 5 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) ∧ 𝑝 ∈ 𝐴) ∧ 𝑝 ∈ 𝑋) → 𝑝 ∈ 𝑋) | |
| 4 | simpllr 776 | . . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) ∧ 𝑝 ∈ 𝐴) ∧ 𝑝 ∈ 𝑋) → 𝑋 ⊆ 𝐴) | |
| 5 | eqid 2736 | . . . . . . 7 ⊢ (Base‘𝐾) = (Base‘𝐾) | |
| 6 | 2polss.a | . . . . . . 7 ⊢ 𝐴 = (Atoms‘𝐾) | |
| 7 | 5, 6 | atssbase 39736 | . . . . . 6 ⊢ 𝐴 ⊆ (Base‘𝐾) |
| 8 | 4, 7 | sstrdi 3934 | . . . . 5 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) ∧ 𝑝 ∈ 𝐴) ∧ 𝑝 ∈ 𝑋) → 𝑋 ⊆ (Base‘𝐾)) |
| 9 | eqid 2736 | . . . . . 6 ⊢ (le‘𝐾) = (le‘𝐾) | |
| 10 | eqid 2736 | . . . . . 6 ⊢ (lub‘𝐾) = (lub‘𝐾) | |
| 11 | 5, 9, 10 | lubel 18480 | . . . . 5 ⊢ ((𝐾 ∈ CLat ∧ 𝑝 ∈ 𝑋 ∧ 𝑋 ⊆ (Base‘𝐾)) → 𝑝(le‘𝐾)((lub‘𝐾)‘𝑋)) |
| 12 | 2, 3, 8, 11 | syl3anc 1374 | . . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) ∧ 𝑝 ∈ 𝐴) ∧ 𝑝 ∈ 𝑋) → 𝑝(le‘𝐾)((lub‘𝐾)‘𝑋)) |
| 13 | 12 | ex 412 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) ∧ 𝑝 ∈ 𝐴) → (𝑝 ∈ 𝑋 → 𝑝(le‘𝐾)((lub‘𝐾)‘𝑋))) |
| 14 | 13 | ss2rabdv 4015 | . 2 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) → {𝑝 ∈ 𝐴 ∣ 𝑝 ∈ 𝑋} ⊆ {𝑝 ∈ 𝐴 ∣ 𝑝(le‘𝐾)((lub‘𝐾)‘𝑋)}) |
| 15 | sseqin2 4163 | . . . . 5 ⊢ (𝑋 ⊆ 𝐴 ↔ (𝐴 ∩ 𝑋) = 𝑋) | |
| 16 | 15 | biimpi 216 | . . . 4 ⊢ (𝑋 ⊆ 𝐴 → (𝐴 ∩ 𝑋) = 𝑋) |
| 17 | 16 | adantl 481 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) → (𝐴 ∩ 𝑋) = 𝑋) |
| 18 | dfin5 3897 | . . 3 ⊢ (𝐴 ∩ 𝑋) = {𝑝 ∈ 𝐴 ∣ 𝑝 ∈ 𝑋} | |
| 19 | 17, 18 | eqtr3di 2786 | . 2 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) → 𝑋 = {𝑝 ∈ 𝐴 ∣ 𝑝 ∈ 𝑋}) |
| 20 | eqid 2736 | . . . 4 ⊢ (pmap‘𝐾) = (pmap‘𝐾) | |
| 21 | 2polss.p | . . . 4 ⊢ ⊥ = (⊥𝑃‘𝐾) | |
| 22 | 10, 6, 20, 21 | 2polvalN 40360 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) → ( ⊥ ‘( ⊥ ‘𝑋)) = ((pmap‘𝐾)‘((lub‘𝐾)‘𝑋))) |
| 23 | sstr 3930 | . . . . . 6 ⊢ ((𝑋 ⊆ 𝐴 ∧ 𝐴 ⊆ (Base‘𝐾)) → 𝑋 ⊆ (Base‘𝐾)) | |
| 24 | 7, 23 | mpan2 692 | . . . . 5 ⊢ (𝑋 ⊆ 𝐴 → 𝑋 ⊆ (Base‘𝐾)) |
| 25 | 5, 10 | clatlubcl 18469 | . . . . 5 ⊢ ((𝐾 ∈ CLat ∧ 𝑋 ⊆ (Base‘𝐾)) → ((lub‘𝐾)‘𝑋) ∈ (Base‘𝐾)) |
| 26 | 1, 24, 25 | syl2an 597 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) → ((lub‘𝐾)‘𝑋) ∈ (Base‘𝐾)) |
| 27 | 5, 9, 6, 20 | pmapval 40203 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ ((lub‘𝐾)‘𝑋) ∈ (Base‘𝐾)) → ((pmap‘𝐾)‘((lub‘𝐾)‘𝑋)) = {𝑝 ∈ 𝐴 ∣ 𝑝(le‘𝐾)((lub‘𝐾)‘𝑋)}) |
| 28 | 26, 27 | syldan 592 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) → ((pmap‘𝐾)‘((lub‘𝐾)‘𝑋)) = {𝑝 ∈ 𝐴 ∣ 𝑝(le‘𝐾)((lub‘𝐾)‘𝑋)}) |
| 29 | 22, 28 | eqtrd 2771 | . 2 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) → ( ⊥ ‘( ⊥ ‘𝑋)) = {𝑝 ∈ 𝐴 ∣ 𝑝(le‘𝐾)((lub‘𝐾)‘𝑋)}) |
| 30 | 14, 19, 29 | 3sstr4d 3977 | 1 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) → 𝑋 ⊆ ( ⊥ ‘( ⊥ ‘𝑋))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 {crab 3389 ∩ cin 3888 ⊆ wss 3889 class class class wbr 5085 ‘cfv 6498 Basecbs 17179 lecple 17227 lubclub 18275 CLatccla 18464 Atomscatm 39709 HLchlt 39796 pmapcpmap 39943 ⊥𝑃cpolN 40348 |
| 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-iin 4936 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-proset 18260 df-poset 18279 df-plt 18294 df-lub 18310 df-glb 18311 df-join 18312 df-meet 18313 df-p0 18389 df-p1 18390 df-lat 18398 df-clat 18465 df-oposet 39622 df-ol 39624 df-oml 39625 df-covers 39712 df-ats 39713 df-atl 39744 df-cvlat 39768 df-hlat 39797 df-pmap 39950 df-polarityN 40349 |
| This theorem is referenced by: polcon2N 40365 pclss2polN 40367 sspmaplubN 40371 paddunN 40373 pnonsingN 40379 osumcllem1N 40402 osumcllem11N 40412 pexmidN 40415 |
| Copyright terms: Public domain | W3C validator |