| 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 40413. (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 4149 | . 2 ⊢ (( ⊥ ‘𝑋) ∩ 𝑈) = (𝑈 ∩ ( ⊥ ‘𝑋)) | |
| 2 | osumcllem.u | . . . . 5 ⊢ 𝑈 = ( ⊥ ‘( ⊥ ‘(𝑋 + 𝑌))) | |
| 3 | simp1 1137 | . . . . . . . 8 ⊢ ((𝐾 ∈ HL ∧ 𝑌 ∈ 𝐶 ∧ 𝑋 ⊆ ( ⊥ ‘𝑌)) → 𝐾 ∈ HL) | |
| 4 | simp3 1139 | . . . . . . . . 9 ⊢ ((𝐾 ∈ HL ∧ 𝑌 ∈ 𝐶 ∧ 𝑋 ⊆ ( ⊥ ‘𝑌)) → 𝑋 ⊆ ( ⊥ ‘𝑌)) | |
| 5 | osumcllem.a | . . . . . . . . . . . 12 ⊢ 𝐴 = (Atoms‘𝐾) | |
| 6 | osumcllem.c | . . . . . . . . . . . 12 ⊢ 𝐶 = (PSubCl‘𝐾) | |
| 7 | 5, 6 | psubclssatN 40387 | . . . . . . . . . . 11 ⊢ ((𝐾 ∈ HL ∧ 𝑌 ∈ 𝐶) → 𝑌 ⊆ 𝐴) |
| 8 | 7 | 3adant3 1133 | . . . . . . . . . 10 ⊢ ((𝐾 ∈ HL ∧ 𝑌 ∈ 𝐶 ∧ 𝑋 ⊆ ( ⊥ ‘𝑌)) → 𝑌 ⊆ 𝐴) |
| 9 | osumcllem.o | . . . . . . . . . . 11 ⊢ ⊥ = (⊥𝑃‘𝐾) | |
| 10 | 5, 9 | polssatN 40354 | . . . . . . . . . 10 ⊢ ((𝐾 ∈ HL ∧ 𝑌 ⊆ 𝐴) → ( ⊥ ‘𝑌) ⊆ 𝐴) |
| 11 | 3, 8, 10 | syl2anc 585 | . . . . . . . . 9 ⊢ ((𝐾 ∈ HL ∧ 𝑌 ∈ 𝐶 ∧ 𝑋 ⊆ ( ⊥ ‘𝑌)) → ( ⊥ ‘𝑌) ⊆ 𝐴) |
| 12 | 4, 11 | sstrd 3932 | . . . . . . . 8 ⊢ ((𝐾 ∈ HL ∧ 𝑌 ∈ 𝐶 ∧ 𝑋 ⊆ ( ⊥ ‘𝑌)) → 𝑋 ⊆ 𝐴) |
| 13 | osumcllem.p | . . . . . . . . 9 ⊢ + = (+𝑃‘𝐾) | |
| 14 | 5, 13, 9 | poldmj1N 40374 | . . . . . . . 8 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴) → ( ⊥ ‘(𝑋 + 𝑌)) = (( ⊥ ‘𝑋) ∩ ( ⊥ ‘𝑌))) |
| 15 | 3, 12, 8, 14 | syl3anc 1374 | . . . . . . 7 ⊢ ((𝐾 ∈ HL ∧ 𝑌 ∈ 𝐶 ∧ 𝑋 ⊆ ( ⊥ ‘𝑌)) → ( ⊥ ‘(𝑋 + 𝑌)) = (( ⊥ ‘𝑋) ∩ ( ⊥ ‘𝑌))) |
| 16 | incom 4149 | . . . . . . 7 ⊢ (( ⊥ ‘𝑋) ∩ ( ⊥ ‘𝑌)) = (( ⊥ ‘𝑌) ∩ ( ⊥ ‘𝑋)) | |
| 17 | 15, 16 | eqtrdi 2787 | . . . . . 6 ⊢ ((𝐾 ∈ HL ∧ 𝑌 ∈ 𝐶 ∧ 𝑋 ⊆ ( ⊥ ‘𝑌)) → ( ⊥ ‘(𝑋 + 𝑌)) = (( ⊥ ‘𝑌) ∩ ( ⊥ ‘𝑋))) |
| 18 | 17 | fveq2d 6844 | . . . . 5 ⊢ ((𝐾 ∈ HL ∧ 𝑌 ∈ 𝐶 ∧ 𝑋 ⊆ ( ⊥ ‘𝑌)) → ( ⊥ ‘( ⊥ ‘(𝑋 + 𝑌))) = ( ⊥ ‘(( ⊥ ‘𝑌) ∩ ( ⊥ ‘𝑋)))) |
| 19 | 2, 18 | eqtrid 2783 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑌 ∈ 𝐶 ∧ 𝑋 ⊆ ( ⊥ ‘𝑌)) → 𝑈 = ( ⊥ ‘(( ⊥ ‘𝑌) ∩ ( ⊥ ‘𝑋)))) |
| 20 | 19 | ineq1d 4159 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑌 ∈ 𝐶 ∧ 𝑋 ⊆ ( ⊥ ‘𝑌)) → (𝑈 ∩ ( ⊥ ‘𝑋)) = (( ⊥ ‘(( ⊥ ‘𝑌) ∩ ( ⊥ ‘𝑋))) ∩ ( ⊥ ‘𝑋))) |
| 21 | 5, 9 | polcon2N 40365 | . . . . 5 ⊢ ((𝐾 ∈ HL ∧ 𝑌 ⊆ 𝐴 ∧ 𝑋 ⊆ ( ⊥ ‘𝑌)) → 𝑌 ⊆ ( ⊥ ‘𝑋)) |
| 22 | 8, 21 | syld3an2 1414 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑌 ∈ 𝐶 ∧ 𝑋 ⊆ ( ⊥ ‘𝑌)) → 𝑌 ⊆ ( ⊥ ‘𝑋)) |
| 23 | 5, 9 | poml5N 40400 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ ( ⊥ ‘𝑋)) → (( ⊥ ‘(( ⊥ ‘𝑌) ∩ ( ⊥ ‘𝑋))) ∩ ( ⊥ ‘𝑋)) = ( ⊥ ‘( ⊥ ‘𝑌))) |
| 24 | 3, 12, 22, 23 | syl3anc 1374 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑌 ∈ 𝐶 ∧ 𝑋 ⊆ ( ⊥ ‘𝑌)) → (( ⊥ ‘(( ⊥ ‘𝑌) ∩ ( ⊥ ‘𝑋))) ∩ ( ⊥ ‘𝑋)) = ( ⊥ ‘( ⊥ ‘𝑌))) |
| 25 | 9, 6 | psubcli2N 40385 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑌 ∈ 𝐶) → ( ⊥ ‘( ⊥ ‘𝑌)) = 𝑌) |
| 26 | 25 | 3adant3 1133 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑌 ∈ 𝐶 ∧ 𝑋 ⊆ ( ⊥ ‘𝑌)) → ( ⊥ ‘( ⊥ ‘𝑌)) = 𝑌) |
| 27 | 20, 24, 26 | 3eqtrd 2775 | . 2 ⊢ ((𝐾 ∈ HL ∧ 𝑌 ∈ 𝐶 ∧ 𝑋 ⊆ ( ⊥ ‘𝑌)) → (𝑈 ∩ ( ⊥ ‘𝑋)) = 𝑌) |
| 28 | 1, 27 | eqtrid 2783 | 1 ⊢ ((𝐾 ∈ HL ∧ 𝑌 ∈ 𝐶 ∧ 𝑋 ⊆ ( ⊥ ‘𝑌)) → (( ⊥ ‘𝑋) ∩ 𝑈) = 𝑌) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 ∩ cin 3888 ⊆ wss 3889 {csn 4567 ‘cfv 6498 (class class class)co 7367 lecple 17227 joincjn 18277 Atomscatm 39709 HLchlt 39796 +𝑃cpadd 40241 ⊥𝑃cpolN 40348 PSubClcpscN 40380 |
| 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-mpo 7372 df-1st 7942 df-2nd 7943 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-psubsp 39949 df-pmap 39950 df-padd 40242 df-polarityN 40349 df-psubclN 40381 |
| This theorem is referenced by: osumcllem9N 40410 |
| Copyright terms: Public domain | W3C validator |