| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > osumcllem3N | Structured version Visualization version GIF version | ||
| Description: Lemma for osumclN 40719. (Contributed by NM, 23-Mar-2012.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| osumcllem.l | ⊢ ≤ = (le‘𝐾) |
| osumcllem.j | ⊢ ∨ = (join‘𝐾) |
| osumcllem.a | ⊢ 𝐴 = (Atoms‘𝐾) |
| osumcllem.p | ⊢ + = (+𝑃‘𝐾) |
| osumcllem.o | ⊢ ⊥ = (⊥𝑃‘𝐾) |
| osumcllem.c | ⊢ 𝐶 = (PSubCl‘𝐾) |
| osumcllem.m | ⊢ 𝑀 = (𝑋 + {𝑝}) |
| osumcllem.u | ⊢ 𝑈 = ( ⊥ ‘( ⊥ ‘(𝑋 + 𝑌))) |
| Ref | Expression |
|---|---|
| osumcllem3N | ⊢ ((𝐾 ∈ HL ∧ 𝑌 ∈ 𝐶 ∧ 𝑋 ⊆ ( ⊥ ‘𝑌)) → (( ⊥ ‘𝑋) ∩ 𝑈) = 𝑌) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | incom 4163 | . 2 ⊢ (( ⊥ ‘𝑋) ∩ 𝑈) = (𝑈 ∩ ( ⊥ ‘𝑋)) | |
| 2 | osumcllem.u | . . . . 5 ⊢ 𝑈 = ( ⊥ ‘( ⊥ ‘(𝑋 + 𝑌))) | |
| 3 | simp1 1154 | . . . . . . . 8 ⊢ ((𝐾 ∈ HL ∧ 𝑌 ∈ 𝐶 ∧ 𝑋 ⊆ ( ⊥ ‘𝑌)) → 𝐾 ∈ HL) | |
| 4 | simp3 1156 | . . . . . . . . 9 ⊢ ((𝐾 ∈ HL ∧ 𝑌 ∈ 𝐶 ∧ 𝑋 ⊆ ( ⊥ ‘𝑌)) → 𝑋 ⊆ ( ⊥ ‘𝑌)) | |
| 5 | osumcllem.a | . . . . . . . . . . . 12 ⊢ 𝐴 = (Atoms‘𝐾) | |
| 6 | osumcllem.c | . . . . . . . . . . . 12 ⊢ 𝐶 = (PSubCl‘𝐾) | |
| 7 | 5, 6 | psubclssatN 40693 | . . . . . . . . . . 11 ⊢ ((𝐾 ∈ HL ∧ 𝑌 ∈ 𝐶) → 𝑌 ⊆ 𝐴) |
| 8 | 7 | 3adant3 1150 | . . . . . . . . . 10 ⊢ ((𝐾 ∈ HL ∧ 𝑌 ∈ 𝐶 ∧ 𝑋 ⊆ ( ⊥ ‘𝑌)) → 𝑌 ⊆ 𝐴) |
| 9 | osumcllem.o | . . . . . . . . . . 11 ⊢ ⊥ = (⊥𝑃‘𝐾) | |
| 10 | 5, 9 | polssatN 40660 | . . . . . . . . . 10 ⊢ ((𝐾 ∈ HL ∧ 𝑌 ⊆ 𝐴) → ( ⊥ ‘𝑌) ⊆ 𝐴) |
| 11 | 3, 8, 10 | syl2anc 595 | . . . . . . . . 9 ⊢ ((𝐾 ∈ HL ∧ 𝑌 ∈ 𝐶 ∧ 𝑋 ⊆ ( ⊥ ‘𝑌)) → ( ⊥ ‘𝑌) ⊆ 𝐴) |
| 12 | 4, 11 | sstrd 3948 | . . . . . . . 8 ⊢ ((𝐾 ∈ HL ∧ 𝑌 ∈ 𝐶 ∧ 𝑋 ⊆ ( ⊥ ‘𝑌)) → 𝑋 ⊆ 𝐴) |
| 13 | osumcllem.p | . . . . . . . . 9 ⊢ + = (+𝑃‘𝐾) | |
| 14 | 5, 13, 9 | poldmj1N 40680 | . . . . . . . 8 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴) → ( ⊥ ‘(𝑋 + 𝑌)) = (( ⊥ ‘𝑋) ∩ ( ⊥ ‘𝑌))) |
| 15 | 3, 12, 8, 14 | syl3anc 1398 | . . . . . . 7 ⊢ ((𝐾 ∈ HL ∧ 𝑌 ∈ 𝐶 ∧ 𝑋 ⊆ ( ⊥ ‘𝑌)) → ( ⊥ ‘(𝑋 + 𝑌)) = (( ⊥ ‘𝑋) ∩ ( ⊥ ‘𝑌))) |
| 16 | incom 4163 | . . . . . . 7 ⊢ (( ⊥ ‘𝑋) ∩ ( ⊥ ‘𝑌)) = (( ⊥ ‘𝑌) ∩ ( ⊥ ‘𝑋)) | |
| 17 | 15, 16 | eqtrdi 2814 | . . . . . 6 ⊢ ((𝐾 ∈ HL ∧ 𝑌 ∈ 𝐶 ∧ 𝑋 ⊆ ( ⊥ ‘𝑌)) → ( ⊥ ‘(𝑋 + 𝑌)) = (( ⊥ ‘𝑌) ∩ ( ⊥ ‘𝑋))) |
| 18 | 17 | fveq2d 6887 | . . . . 5 ⊢ ((𝐾 ∈ HL ∧ 𝑌 ∈ 𝐶 ∧ 𝑋 ⊆ ( ⊥ ‘𝑌)) → ( ⊥ ‘( ⊥ ‘(𝑋 + 𝑌))) = ( ⊥ ‘(( ⊥ ‘𝑌) ∩ ( ⊥ ‘𝑋)))) |
| 19 | 2, 18 | eqtrid 2810 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑌 ∈ 𝐶 ∧ 𝑋 ⊆ ( ⊥ ‘𝑌)) → 𝑈 = ( ⊥ ‘(( ⊥ ‘𝑌) ∩ ( ⊥ ‘𝑋)))) |
| 20 | 19 | ineq1d 4173 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑌 ∈ 𝐶 ∧ 𝑋 ⊆ ( ⊥ ‘𝑌)) → (𝑈 ∩ ( ⊥ ‘𝑋)) = (( ⊥ ‘(( ⊥ ‘𝑌) ∩ ( ⊥ ‘𝑋))) ∩ ( ⊥ ‘𝑋))) |
| 21 | 5, 9 | polcon2N 40671 | . . . . 5 ⊢ ((𝐾 ∈ HL ∧ 𝑌 ⊆ 𝐴 ∧ 𝑋 ⊆ ( ⊥ ‘𝑌)) → 𝑌 ⊆ ( ⊥ ‘𝑋)) |
| 22 | 8, 21 | syld3an2 1438 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑌 ∈ 𝐶 ∧ 𝑋 ⊆ ( ⊥ ‘𝑌)) → 𝑌 ⊆ ( ⊥ ‘𝑋)) |
| 23 | 5, 9 | poml5N 40706 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ ( ⊥ ‘𝑋)) → (( ⊥ ‘(( ⊥ ‘𝑌) ∩ ( ⊥ ‘𝑋))) ∩ ( ⊥ ‘𝑋)) = ( ⊥ ‘( ⊥ ‘𝑌))) |
| 24 | 3, 12, 22, 23 | syl3anc 1398 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑌 ∈ 𝐶 ∧ 𝑋 ⊆ ( ⊥ ‘𝑌)) → (( ⊥ ‘(( ⊥ ‘𝑌) ∩ ( ⊥ ‘𝑋))) ∩ ( ⊥ ‘𝑋)) = ( ⊥ ‘( ⊥ ‘𝑌))) |
| 25 | 9, 6 | psubcli2N 40691 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑌 ∈ 𝐶) → ( ⊥ ‘( ⊥ ‘𝑌)) = 𝑌) |
| 26 | 25 | 3adant3 1150 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑌 ∈ 𝐶 ∧ 𝑋 ⊆ ( ⊥ ‘𝑌)) → ( ⊥ ‘( ⊥ ‘𝑌)) = 𝑌) |
| 27 | 20, 24, 26 | 3eqtrd 2802 | . 2 ⊢ ((𝐾 ∈ HL ∧ 𝑌 ∈ 𝐶 ∧ 𝑋 ⊆ ( ⊥ ‘𝑌)) → (𝑈 ∩ ( ⊥ ‘𝑋)) = 𝑌) |
| 28 | 1, 27 | eqtrid 2810 | 1 ⊢ ((𝐾 ∈ HL ∧ 𝑌 ∈ 𝐶 ∧ 𝑋 ⊆ ( ⊥ ‘𝑌)) → (( ⊥ ‘𝑋) ∩ 𝑈) = 𝑌) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ w3a 1103 = wceq 1570 ∈ wcel 2143 ∩ cin 3905 ⊆ wss 3906 {csn 4590 ‘cfv 6538 (class class class)co 7412 lecple 17318 joincjn 18368 Atomscatm 40015 HLchlt 40102 +𝑃cpadd 40547 ⊥𝑃cpolN 40654 PSubClcpscN 40686 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-rep 5239 ax-sep 5258 ax-nul 5270 ax-pow 5338 ax-pr 5406 ax-un 7734 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-ral 3080 df-rex 3090 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3746 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4288 df-if 4489 df-pw 4565 df-sn 4591 df-pr 4593 df-op 4597 df-uni 4874 df-iun 4959 df-iin 4960 df-br 5111 df-opab 5175 df-mpt 5194 df-id 5558 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-1st 7987 df-2nd 7988 df-proset 18351 df-poset 18370 df-plt 18385 df-lub 18401 df-glb 18402 df-join 18403 df-meet 18404 df-p0 18480 df-p1 18481 df-lat 18489 df-clat 18556 df-oposet 39928 df-ol 39930 df-oml 39931 df-covers 40018 df-ats 40019 df-atl 40050 df-cvlat 40074 df-hlat 40103 df-psubsp 40255 df-pmap 40256 df-padd 40548 df-polarityN 40655 df-psubclN 40687 |
| This theorem is referenced by: osumcllem9N 40716 |
| Copyright terms: Public domain | W3C validator |