| 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 39686 | . . . . . 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 39618 | . . . . . 6 ⊢ 𝐴 ⊆ (Base‘𝐾) |
| 8 | 4, 7 | sstrdi 3947 | . . . . 5 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) ∧ 𝑝 ∈ 𝐴) ∧ 𝑝 ∈ 𝑋) → 𝑋 ⊆ (Base‘𝐾)) |
| 9 | eqid 2737 | . . . . . 6 ⊢ (le‘𝐾) = (le‘𝐾) | |
| 10 | eqid 2737 | . . . . . 6 ⊢ (lub‘𝐾) = (lub‘𝐾) | |
| 11 | 5, 9, 10 | lubel 18441 | . . . . 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 4028 | . 2 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) → {𝑝 ∈ 𝐴 ∣ 𝑝 ∈ 𝑋} ⊆ {𝑝 ∈ 𝐴 ∣ 𝑝(le‘𝐾)((lub‘𝐾)‘𝑋)}) |
| 15 | sseqin2 4176 | . . . . 5 ⊢ (𝑋 ⊆ 𝐴 ↔ (𝐴 ∩ 𝑋) = 𝑋) | |
| 16 | 15 | biimpi 216 | . . . 4 ⊢ (𝑋 ⊆ 𝐴 → (𝐴 ∩ 𝑋) = 𝑋) |
| 17 | 16 | adantl 481 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) → (𝐴 ∩ 𝑋) = 𝑋) |
| 18 | dfin5 3910 | . . 3 ⊢ (𝐴 ∩ 𝑋) = {𝑝 ∈ 𝐴 ∣ 𝑝 ∈ 𝑋} | |
| 19 | 17, 18 | eqtr3di 2787 | . 2 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) → 𝑋 = {𝑝 ∈ 𝐴 ∣ 𝑝 ∈ 𝑋}) |
| 20 | eqid 2737 | . . . 4 ⊢ (pmap‘𝐾) = (pmap‘𝐾) | |
| 21 | 2polss.p | . . . 4 ⊢ ⊥ = (⊥𝑃‘𝐾) | |
| 22 | 10, 6, 20, 21 | 2polvalN 40242 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) → ( ⊥ ‘( ⊥ ‘𝑋)) = ((pmap‘𝐾)‘((lub‘𝐾)‘𝑋))) |
| 23 | sstr 3943 | . . . . . 6 ⊢ ((𝑋 ⊆ 𝐴 ∧ 𝐴 ⊆ (Base‘𝐾)) → 𝑋 ⊆ (Base‘𝐾)) | |
| 24 | 7, 23 | mpan2 692 | . . . . 5 ⊢ (𝑋 ⊆ 𝐴 → 𝑋 ⊆ (Base‘𝐾)) |
| 25 | 5, 10 | clatlubcl 18430 | . . . . 5 ⊢ ((𝐾 ∈ CLat ∧ 𝑋 ⊆ (Base‘𝐾)) → ((lub‘𝐾)‘𝑋) ∈ (Base‘𝐾)) |
| 26 | 1, 24, 25 | syl2an 597 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) → ((lub‘𝐾)‘𝑋) ∈ (Base‘𝐾)) |
| 27 | 5, 9, 6, 20 | pmapval 40085 | . . . 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 3990 | 1 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) → 𝑋 ⊆ ( ⊥ ‘( ⊥ ‘𝑋))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 {crab 3400 ∩ cin 3901 ⊆ wss 3902 class class class wbr 5099 ‘cfv 6493 Basecbs 17140 lecple 17188 lubclub 18236 CLatccla 18425 Atomscatm 39591 HLchlt 39678 pmapcpmap 39825 ⊥𝑃cpolN 40230 |
| 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 5225 ax-sep 5242 ax-nul 5252 ax-pow 5311 ax-pr 5378 ax-un 7682 |
| 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 3062 df-rmo 3351 df-reu 3352 df-rab 3401 df-v 3443 df-sbc 3742 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4287 df-if 4481 df-pw 4557 df-sn 4582 df-pr 4584 df-op 4588 df-uni 4865 df-iun 4949 df-iin 4950 df-br 5100 df-opab 5162 df-mpt 5181 df-id 5520 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-iota 6449 df-fun 6495 df-fn 6496 df-f 6497 df-f1 6498 df-fo 6499 df-f1o 6500 df-fv 6501 df-riota 7317 df-ov 7363 df-oprab 7364 df-proset 18221 df-poset 18240 df-plt 18255 df-lub 18271 df-glb 18272 df-join 18273 df-meet 18274 df-p0 18350 df-p1 18351 df-lat 18359 df-clat 18426 df-oposet 39504 df-ol 39506 df-oml 39507 df-covers 39594 df-ats 39595 df-atl 39626 df-cvlat 39650 df-hlat 39679 df-pmap 39832 df-polarityN 40231 |
| This theorem is referenced by: polcon2N 40247 pclss2polN 40249 sspmaplubN 40253 paddunN 40255 pnonsingN 40261 osumcllem1N 40284 osumcllem11N 40294 pexmidN 40297 |
| Copyright terms: Public domain | W3C validator |