| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > pclun2N | Structured version Visualization version GIF version | ||
| Description: The projective subspace closure of the union of two subspaces equals their projective sum. (Contributed by NM, 12-Sep-2013.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| pclun2.s | ⊢ 𝑆 = (PSubSp‘𝐾) |
| pclun2.p | ⊢ + = (+𝑃‘𝐾) |
| pclun2.c | ⊢ 𝑈 = (PCl‘𝐾) |
| Ref | Expression |
|---|---|
| pclun2N | ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → (𝑈‘(𝑋 ∪ 𝑌)) = (𝑋 + 𝑌)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simp1 1154 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → 𝐾 ∈ HL) | |
| 2 | eqid 2760 | . . . . 5 ⊢ (Atoms‘𝐾) = (Atoms‘𝐾) | |
| 3 | pclun2.s | . . . . 5 ⊢ 𝑆 = (PSubSp‘𝐾) | |
| 4 | 2, 3 | psubssat 40904 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑆) → 𝑋 ⊆ (Atoms‘𝐾)) |
| 5 | 4 | 3adant3 1150 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → 𝑋 ⊆ (Atoms‘𝐾)) |
| 6 | 2, 3 | psubssat 40904 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑌 ∈ 𝑆) → 𝑌 ⊆ (Atoms‘𝐾)) |
| 7 | 6 | 3adant2 1149 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → 𝑌 ⊆ (Atoms‘𝐾)) |
| 8 | pclun2.p | . . . 4 ⊢ + = (+𝑃‘𝐾) | |
| 9 | pclun2.c | . . . 4 ⊢ 𝑈 = (PCl‘𝐾) | |
| 10 | 2, 8, 9 | pclunN 41048 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ⊆ (Atoms‘𝐾) ∧ 𝑌 ⊆ (Atoms‘𝐾)) → (𝑈‘(𝑋 ∪ 𝑌)) = (𝑈‘(𝑋 + 𝑌))) |
| 11 | 1, 5, 7, 10 | syl3anc 1398 | . 2 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → (𝑈‘(𝑋 ∪ 𝑌)) = (𝑈‘(𝑋 + 𝑌))) |
| 12 | 3, 8 | paddclN 40992 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → (𝑋 + 𝑌) ∈ 𝑆) |
| 13 | 3, 9 | pclidN 41046 | . . 3 ⊢ ((𝐾 ∈ HL ∧ (𝑋 + 𝑌) ∈ 𝑆) → (𝑈‘(𝑋 + 𝑌)) = (𝑋 + 𝑌)) |
| 14 | 1, 12, 13 | syl2anc 596 | . 2 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → (𝑈‘(𝑋 + 𝑌)) = (𝑋 + 𝑌)) |
| 15 | 11, 14 | eqtrd 2795 | 1 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → (𝑈‘(𝑋 ∪ 𝑌)) = (𝑋 + 𝑌)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ w3a 1103 = wceq 1569 ∈ wcel 2144 ⊆ wss 3895 ∪ cun 4149 ‘cfv 6538 (class class class)co 7420 Atomscatm 40413 HLchlt 40500 PSubSpcpsubsp 40646 +𝑃cpadd 40945 PClcpclN 41037 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7751 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-ss 3896 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-int 4907 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-id 5545 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 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 7377 df-ov 7423 df-oprab 7424 df-mpo 7425 df-1st 8001 df-2nd 8002 df-proset 18473 df-poset 18492 df-plt 18507 df-lub 18523 df-glb 18524 df-join 18525 df-meet 18526 df-p0 18602 df-lat 18611 df-clat 18678 df-oposet 40326 df-ol 40328 df-oml 40329 df-covers 40416 df-ats 40417 df-atl 40448 df-cvlat 40472 df-hlat 40501 df-psubsp 40653 df-padd 40946 df-pclN 41038 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |