| 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 39969. (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 4209 | . 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 39943 | . . . . . . . . . . 11 ⊢ ((𝐾 ∈ HL ∧ 𝑌 ∈ 𝐶) → 𝑌 ⊆ 𝐴) |
| 8 | 7 | 3adant3 1133 | . . . . . . . . . 10 ⊢ ((𝐾 ∈ HL ∧ 𝑌 ∈ 𝐶 ∧ 𝑋 ⊆ ( ⊥ ‘𝑌)) → 𝑌 ⊆ 𝐴) |
| 9 | osumcllem.o | . . . . . . . . . . 11 ⊢ ⊥ = (⊥𝑃‘𝐾) | |
| 10 | 5, 9 | polssatN 39910 | . . . . . . . . . 10 ⊢ ((𝐾 ∈ HL ∧ 𝑌 ⊆ 𝐴) → ( ⊥ ‘𝑌) ⊆ 𝐴) |
| 11 | 3, 8, 10 | syl2anc 584 | . . . . . . . . 9 ⊢ ((𝐾 ∈ HL ∧ 𝑌 ∈ 𝐶 ∧ 𝑋 ⊆ ( ⊥ ‘𝑌)) → ( ⊥ ‘𝑌) ⊆ 𝐴) |
| 12 | 4, 11 | sstrd 3994 | . . . . . . . 8 ⊢ ((𝐾 ∈ HL ∧ 𝑌 ∈ 𝐶 ∧ 𝑋 ⊆ ( ⊥ ‘𝑌)) → 𝑋 ⊆ 𝐴) |
| 13 | osumcllem.p | . . . . . . . . 9 ⊢ + = (+𝑃‘𝐾) | |
| 14 | 5, 13, 9 | poldmj1N 39930 | . . . . . . . 8 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴) → ( ⊥ ‘(𝑋 + 𝑌)) = (( ⊥ ‘𝑋) ∩ ( ⊥ ‘𝑌))) |
| 15 | 3, 12, 8, 14 | syl3anc 1373 | . . . . . . 7 ⊢ ((𝐾 ∈ HL ∧ 𝑌 ∈ 𝐶 ∧ 𝑋 ⊆ ( ⊥ ‘𝑌)) → ( ⊥ ‘(𝑋 + 𝑌)) = (( ⊥ ‘𝑋) ∩ ( ⊥ ‘𝑌))) |
| 16 | incom 4209 | . . . . . . 7 ⊢ (( ⊥ ‘𝑋) ∩ ( ⊥ ‘𝑌)) = (( ⊥ ‘𝑌) ∩ ( ⊥ ‘𝑋)) | |
| 17 | 15, 16 | eqtrdi 2793 | . . . . . 6 ⊢ ((𝐾 ∈ HL ∧ 𝑌 ∈ 𝐶 ∧ 𝑋 ⊆ ( ⊥ ‘𝑌)) → ( ⊥ ‘(𝑋 + 𝑌)) = (( ⊥ ‘𝑌) ∩ ( ⊥ ‘𝑋))) |
| 18 | 17 | fveq2d 6910 | . . . . 5 ⊢ ((𝐾 ∈ HL ∧ 𝑌 ∈ 𝐶 ∧ 𝑋 ⊆ ( ⊥ ‘𝑌)) → ( ⊥ ‘( ⊥ ‘(𝑋 + 𝑌))) = ( ⊥ ‘(( ⊥ ‘𝑌) ∩ ( ⊥ ‘𝑋)))) |
| 19 | 2, 18 | eqtrid 2789 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑌 ∈ 𝐶 ∧ 𝑋 ⊆ ( ⊥ ‘𝑌)) → 𝑈 = ( ⊥ ‘(( ⊥ ‘𝑌) ∩ ( ⊥ ‘𝑋)))) |
| 20 | 19 | ineq1d 4219 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑌 ∈ 𝐶 ∧ 𝑋 ⊆ ( ⊥ ‘𝑌)) → (𝑈 ∩ ( ⊥ ‘𝑋)) = (( ⊥ ‘(( ⊥ ‘𝑌) ∩ ( ⊥ ‘𝑋))) ∩ ( ⊥ ‘𝑋))) |
| 21 | 5, 9 | polcon2N 39921 | . . . . 5 ⊢ ((𝐾 ∈ HL ∧ 𝑌 ⊆ 𝐴 ∧ 𝑋 ⊆ ( ⊥ ‘𝑌)) → 𝑌 ⊆ ( ⊥ ‘𝑋)) |
| 22 | 8, 21 | syld3an2 1413 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑌 ∈ 𝐶 ∧ 𝑋 ⊆ ( ⊥ ‘𝑌)) → 𝑌 ⊆ ( ⊥ ‘𝑋)) |
| 23 | 5, 9 | poml5N 39956 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ ( ⊥ ‘𝑋)) → (( ⊥ ‘(( ⊥ ‘𝑌) ∩ ( ⊥ ‘𝑋))) ∩ ( ⊥ ‘𝑋)) = ( ⊥ ‘( ⊥ ‘𝑌))) |
| 24 | 3, 12, 22, 23 | syl3anc 1373 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑌 ∈ 𝐶 ∧ 𝑋 ⊆ ( ⊥ ‘𝑌)) → (( ⊥ ‘(( ⊥ ‘𝑌) ∩ ( ⊥ ‘𝑋))) ∩ ( ⊥ ‘𝑋)) = ( ⊥ ‘( ⊥ ‘𝑌))) |
| 25 | 9, 6 | psubcli2N 39941 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑌 ∈ 𝐶) → ( ⊥ ‘( ⊥ ‘𝑌)) = 𝑌) |
| 26 | 25 | 3adant3 1133 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑌 ∈ 𝐶 ∧ 𝑋 ⊆ ( ⊥ ‘𝑌)) → ( ⊥ ‘( ⊥ ‘𝑌)) = 𝑌) |
| 27 | 20, 24, 26 | 3eqtrd 2781 | . 2 ⊢ ((𝐾 ∈ HL ∧ 𝑌 ∈ 𝐶 ∧ 𝑋 ⊆ ( ⊥ ‘𝑌)) → (𝑈 ∩ ( ⊥ ‘𝑋)) = 𝑌) |
| 28 | 1, 27 | eqtrid 2789 | 1 ⊢ ((𝐾 ∈ HL ∧ 𝑌 ∈ 𝐶 ∧ 𝑋 ⊆ ( ⊥ ‘𝑌)) → (( ⊥ ‘𝑋) ∩ 𝑈) = 𝑌) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ w3a 1087 = wceq 1540 ∈ wcel 2108 ∩ cin 3950 ⊆ wss 3951 {csn 4626 ‘cfv 6561 (class class class)co 7431 lecple 17304 joincjn 18357 Atomscatm 39264 HLchlt 39351 +𝑃cpadd 39797 ⊥𝑃cpolN 39904 PSubClcpscN 39936 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2157 ax-12 2177 ax-ext 2708 ax-rep 5279 ax-sep 5296 ax-nul 5306 ax-pow 5365 ax-pr 5432 ax-un 7755 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2065 df-mo 2540 df-eu 2569 df-clab 2715 df-cleq 2729 df-clel 2816 df-nfc 2892 df-ne 2941 df-ral 3062 df-rex 3071 df-rmo 3380 df-reu 3381 df-rab 3437 df-v 3482 df-sbc 3789 df-csb 3900 df-dif 3954 df-un 3956 df-in 3958 df-ss 3968 df-nul 4334 df-if 4526 df-pw 4602 df-sn 4627 df-pr 4629 df-op 4633 df-uni 4908 df-iun 4993 df-iin 4994 df-br 5144 df-opab 5206 df-mpt 5226 df-id 5578 df-xp 5691 df-rel 5692 df-cnv 5693 df-co 5694 df-dm 5695 df-rn 5696 df-res 5697 df-ima 5698 df-iota 6514 df-fun 6563 df-fn 6564 df-f 6565 df-f1 6566 df-fo 6567 df-f1o 6568 df-fv 6569 df-riota 7388 df-ov 7434 df-oprab 7435 df-mpo 7436 df-1st 8014 df-2nd 8015 df-proset 18340 df-poset 18359 df-plt 18375 df-lub 18391 df-glb 18392 df-join 18393 df-meet 18394 df-p0 18470 df-p1 18471 df-lat 18477 df-clat 18544 df-oposet 39177 df-ol 39179 df-oml 39180 df-covers 39267 df-ats 39268 df-atl 39299 df-cvlat 39323 df-hlat 39352 df-psubsp 39505 df-pmap 39506 df-padd 39798 df-polarityN 39905 df-psubclN 39937 |
| This theorem is referenced by: osumcllem9N 39966 |
| Copyright terms: Public domain | W3C validator |