| 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 39824 | . . . . . 6 ⊢ (𝐾 ∈ HL → 𝐾 ∈ CLat) | |
| 2 | 1 | ad3antrrr 731 | . . . . 5 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) ∧ 𝑝 ∈ 𝐴) ∧ 𝑝 ∈ 𝑋) → 𝐾 ∈ CLat) |
| 3 | simpr 484 | . . . . 5 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) ∧ 𝑝 ∈ 𝐴) ∧ 𝑝 ∈ 𝑋) → 𝑝 ∈ 𝑋) | |
| 4 | simpllr 776 | . . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) ∧ 𝑝 ∈ 𝐴) ∧ 𝑝 ∈ 𝑋) → 𝑋 ⊆ 𝐴) | |
| 5 | eqid 2737 | . . . . . . 7 ⊢ (Base‘𝐾) = (Base‘𝐾) | |
| 6 | 2polss.a | . . . . . . 7 ⊢ 𝐴 = (Atoms‘𝐾) | |
| 7 | 5, 6 | atssbase 39756 | . . . . . 6 ⊢ 𝐴 ⊆ (Base‘𝐾) |
| 8 | 4, 7 | sstrdi 3935 | . . . . 5 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) ∧ 𝑝 ∈ 𝐴) ∧ 𝑝 ∈ 𝑋) → 𝑋 ⊆ (Base‘𝐾)) |
| 9 | eqid 2737 | . . . . . 6 ⊢ (le‘𝐾) = (le‘𝐾) | |
| 10 | eqid 2737 | . . . . . 6 ⊢ (lub‘𝐾) = (lub‘𝐾) | |
| 11 | 5, 9, 10 | lubel 18475 | . . . . 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 4016 | . 2 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) → {𝑝 ∈ 𝐴 ∣ 𝑝 ∈ 𝑋} ⊆ {𝑝 ∈ 𝐴 ∣ 𝑝(le‘𝐾)((lub‘𝐾)‘𝑋)}) |
| 15 | sseqin2 4164 | . . . . 5 ⊢ (𝑋 ⊆ 𝐴 ↔ (𝐴 ∩ 𝑋) = 𝑋) | |
| 16 | 15 | biimpi 216 | . . . 4 ⊢ (𝑋 ⊆ 𝐴 → (𝐴 ∩ 𝑋) = 𝑋) |
| 17 | 16 | adantl 481 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) → (𝐴 ∩ 𝑋) = 𝑋) |
| 18 | dfin5 3898 | . . 3 ⊢ (𝐴 ∩ 𝑋) = {𝑝 ∈ 𝐴 ∣ 𝑝 ∈ 𝑋} | |
| 19 | 17, 18 | eqtr3di 2787 | . 2 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) → 𝑋 = {𝑝 ∈ 𝐴 ∣ 𝑝 ∈ 𝑋}) |
| 20 | eqid 2737 | . . . 4 ⊢ (pmap‘𝐾) = (pmap‘𝐾) | |
| 21 | 2polss.p | . . . 4 ⊢ ⊥ = (⊥𝑃‘𝐾) | |
| 22 | 10, 6, 20, 21 | 2polvalN 40380 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) → ( ⊥ ‘( ⊥ ‘𝑋)) = ((pmap‘𝐾)‘((lub‘𝐾)‘𝑋))) |
| 23 | sstr 3931 | . . . . . 6 ⊢ ((𝑋 ⊆ 𝐴 ∧ 𝐴 ⊆ (Base‘𝐾)) → 𝑋 ⊆ (Base‘𝐾)) | |
| 24 | 7, 23 | mpan2 692 | . . . . 5 ⊢ (𝑋 ⊆ 𝐴 → 𝑋 ⊆ (Base‘𝐾)) |
| 25 | 5, 10 | clatlubcl 18464 | . . . . 5 ⊢ ((𝐾 ∈ CLat ∧ 𝑋 ⊆ (Base‘𝐾)) → ((lub‘𝐾)‘𝑋) ∈ (Base‘𝐾)) |
| 26 | 1, 24, 25 | syl2an 597 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) → ((lub‘𝐾)‘𝑋) ∈ (Base‘𝐾)) |
| 27 | 5, 9, 6, 20 | pmapval 40223 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ ((lub‘𝐾)‘𝑋) ∈ (Base‘𝐾)) → ((pmap‘𝐾)‘((lub‘𝐾)‘𝑋)) = {𝑝 ∈ 𝐴 ∣ 𝑝(le‘𝐾)((lub‘𝐾)‘𝑋)}) |
| 28 | 26, 27 | syldan 592 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) → ((pmap‘𝐾)‘((lub‘𝐾)‘𝑋)) = {𝑝 ∈ 𝐴 ∣ 𝑝(le‘𝐾)((lub‘𝐾)‘𝑋)}) |
| 29 | 22, 28 | eqtrd 2772 | . 2 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) → ( ⊥ ‘( ⊥ ‘𝑋)) = {𝑝 ∈ 𝐴 ∣ 𝑝(le‘𝐾)((lub‘𝐾)‘𝑋)}) |
| 30 | 14, 19, 29 | 3sstr4d 3978 | 1 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) → 𝑋 ⊆ ( ⊥ ‘( ⊥ ‘𝑋))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 {crab 3390 ∩ cin 3889 ⊆ wss 3890 class class class wbr 5086 ‘cfv 6494 Basecbs 17174 lecple 17222 lubclub 18270 CLatccla 18459 Atomscatm 39729 HLchlt 39816 pmapcpmap 39963 ⊥𝑃cpolN 40368 |
| 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 2709 ax-rep 5213 ax-sep 5232 ax-nul 5242 ax-pow 5304 ax-pr 5372 ax-un 7684 |
| 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 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3063 df-rmo 3343 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-iun 4936 df-iin 4937 df-br 5087 df-opab 5149 df-mpt 5168 df-id 5521 df-xp 5632 df-rel 5633 df-cnv 5634 df-co 5635 df-dm 5636 df-rn 5637 df-res 5638 df-ima 5639 df-iota 6450 df-fun 6496 df-fn 6497 df-f 6498 df-f1 6499 df-fo 6500 df-f1o 6501 df-fv 6502 df-riota 7319 df-ov 7365 df-oprab 7366 df-proset 18255 df-poset 18274 df-plt 18289 df-lub 18305 df-glb 18306 df-join 18307 df-meet 18308 df-p0 18384 df-p1 18385 df-lat 18393 df-clat 18460 df-oposet 39642 df-ol 39644 df-oml 39645 df-covers 39732 df-ats 39733 df-atl 39764 df-cvlat 39788 df-hlat 39817 df-pmap 39970 df-polarityN 40369 |
| This theorem is referenced by: polcon2N 40385 pclss2polN 40387 sspmaplubN 40391 paddunN 40393 pnonsingN 40399 osumcllem1N 40422 osumcllem11N 40432 pexmidN 40435 |
| Copyright terms: Public domain | W3C validator |