| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > poml6N | Structured version Visualization version GIF version | ||
| Description: Orthomodular law for projective lattices. (Contributed by NM, 25-Mar-2012.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| poml6.c | ⊢ 𝐶 = (PSubCl‘𝐾) |
| poml6.p | ⊢ ⊥ = (⊥𝑃‘𝐾) |
| Ref | Expression |
|---|---|
| poml6N | ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐶 ∧ 𝑌 ∈ 𝐶) ∧ 𝑋 ⊆ 𝑌) → (( ⊥ ‘(( ⊥ ‘𝑋) ∩ 𝑌)) ∩ 𝑌) = 𝑋) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpl1 1208 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐶 ∧ 𝑌 ∈ 𝐶) ∧ 𝑋 ⊆ 𝑌) → 𝐾 ∈ HL) | |
| 2 | simpl2 1209 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐶 ∧ 𝑌 ∈ 𝐶) ∧ 𝑋 ⊆ 𝑌) → 𝑋 ∈ 𝐶) | |
| 3 | eqid 2769 | . . . . 5 ⊢ (Atoms‘𝐾) = (Atoms‘𝐾) | |
| 4 | poml6.c | . . . . 5 ⊢ 𝐶 = (PSubCl‘𝐾) | |
| 5 | 3, 4 | psubclssatN 40604 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐶) → 𝑋 ⊆ (Atoms‘𝐾)) |
| 6 | 1, 2, 5 | syl2anc 595 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐶 ∧ 𝑌 ∈ 𝐶) ∧ 𝑋 ⊆ 𝑌) → 𝑋 ⊆ (Atoms‘𝐾)) |
| 7 | simpl3 1210 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐶 ∧ 𝑌 ∈ 𝐶) ∧ 𝑋 ⊆ 𝑌) → 𝑌 ∈ 𝐶) | |
| 8 | 3, 4 | psubclssatN 40604 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑌 ∈ 𝐶) → 𝑌 ⊆ (Atoms‘𝐾)) |
| 9 | 1, 7, 8 | syl2anc 595 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐶 ∧ 𝑌 ∈ 𝐶) ∧ 𝑋 ⊆ 𝑌) → 𝑌 ⊆ (Atoms‘𝐾)) |
| 10 | simpr 489 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐶 ∧ 𝑌 ∈ 𝐶) ∧ 𝑋 ⊆ 𝑌) → 𝑋 ⊆ 𝑌) | |
| 11 | poml6.p | . . . . 5 ⊢ ⊥ = (⊥𝑃‘𝐾) | |
| 12 | 11, 4 | psubcli2N 40602 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑌 ∈ 𝐶) → ( ⊥ ‘( ⊥ ‘𝑌)) = 𝑌) |
| 13 | 1, 7, 12 | syl2anc 595 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐶 ∧ 𝑌 ∈ 𝐶) ∧ 𝑋 ⊆ 𝑌) → ( ⊥ ‘( ⊥ ‘𝑌)) = 𝑌) |
| 14 | 3, 11 | poml4N 40616 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ⊆ (Atoms‘𝐾) ∧ 𝑌 ⊆ (Atoms‘𝐾)) → ((𝑋 ⊆ 𝑌 ∧ ( ⊥ ‘( ⊥ ‘𝑌)) = 𝑌) → (( ⊥ ‘(( ⊥ ‘𝑋) ∩ 𝑌)) ∩ 𝑌) = ( ⊥ ‘( ⊥ ‘𝑋)))) |
| 15 | 14 | imp 411 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ (Atoms‘𝐾) ∧ 𝑌 ⊆ (Atoms‘𝐾)) ∧ (𝑋 ⊆ 𝑌 ∧ ( ⊥ ‘( ⊥ ‘𝑌)) = 𝑌)) → (( ⊥ ‘(( ⊥ ‘𝑋) ∩ 𝑌)) ∩ 𝑌) = ( ⊥ ‘( ⊥ ‘𝑋))) |
| 16 | 1, 6, 9, 10, 13, 15 | syl32anc 1403 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐶 ∧ 𝑌 ∈ 𝐶) ∧ 𝑋 ⊆ 𝑌) → (( ⊥ ‘(( ⊥ ‘𝑋) ∩ 𝑌)) ∩ 𝑌) = ( ⊥ ‘( ⊥ ‘𝑋))) |
| 17 | 11, 4 | psubcli2N 40602 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐶) → ( ⊥ ‘( ⊥ ‘𝑋)) = 𝑋) |
| 18 | 1, 2, 17 | syl2anc 595 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐶 ∧ 𝑌 ∈ 𝐶) ∧ 𝑋 ⊆ 𝑌) → ( ⊥ ‘( ⊥ ‘𝑋)) = 𝑋) |
| 19 | 16, 18 | eqtrd 2804 | 1 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐶 ∧ 𝑌 ∈ 𝐶) ∧ 𝑋 ⊆ 𝑌) → (( ⊥ ‘(( ⊥ ‘𝑋) ∩ 𝑌)) ∩ 𝑌) = 𝑋) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 ∧ w3a 1101 = wceq 1567 ∈ wcel 2149 ∩ cin 3912 ⊆ wss 3913 ‘cfv 6537 Atomscatm 39926 HLchlt 40013 ⊥𝑃cpolN 40565 PSubClcpscN 40597 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-rep 5242 ax-sep 5261 ax-nul 5271 ax-pow 5337 ax-pr 5405 ax-un 7733 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-ral 3086 df-rex 3096 df-rmo 3376 df-reu 3377 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4877 df-iun 4962 df-iin 4963 df-br 5114 df-opab 5178 df-mpt 5197 df-id 5557 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-res 5674 df-ima 5675 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7368 df-ov 7414 df-oprab 7415 df-proset 18349 df-poset 18368 df-plt 18383 df-lub 18399 df-glb 18400 df-join 18401 df-meet 18402 df-p0 18478 df-p1 18479 df-lat 18487 df-clat 18554 df-oposet 39839 df-ol 39841 df-oml 39842 df-covers 39929 df-ats 39930 df-atl 39961 df-cvlat 39985 df-hlat 40014 df-pmap 40167 df-polarityN 40566 df-psubclN 40598 |
| This theorem is referenced by: osumcllem9N 40627 |
| Copyright terms: Public domain | W3C validator |