| 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 2763 | . . . . 5 ⊢ (Atoms‘𝐾) = (Atoms‘𝐾) | |
| 3 | pclun2.s | . . . . 5 ⊢ 𝑆 = (PSubSp‘𝐾) | |
| 4 | 2, 3 | psubssat 41014 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑆) → 𝑋 ⊆ (Atoms‘𝐾)) |
| 5 | 4 | 3adant3 1150 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → 𝑋 ⊆ (Atoms‘𝐾)) |
| 6 | 2, 3 | psubssat 41014 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑌 ∈ 𝑆) → 𝑌 ⊆ (Atoms‘𝐾)) |
| 7 | 6 | 3adant2 1149 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → 𝑌 ⊆ (Atoms‘𝐾)) |
| 8 | pclun2.p | . . . 4 ⊢ + = (+𝑃‘𝐾) | |
| 9 | pclun2.c | . . . 4 ⊢ 𝑈 = (PCl‘𝐾) | |
| 10 | 2, 8, 9 | pclunN 41158 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ⊆ (Atoms‘𝐾) ∧ 𝑌 ⊆ (Atoms‘𝐾)) → (𝑈‘(𝑋 ∪ 𝑌)) = (𝑈‘(𝑋 + 𝑌))) |
| 11 | 1, 5, 7, 10 | syl3anc 1399 | . 2 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → (𝑈‘(𝑋 ∪ 𝑌)) = (𝑈‘(𝑋 + 𝑌))) |
| 12 | 3, 8 | paddclN 41102 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → (𝑋 + 𝑌) ∈ 𝑆) |
| 13 | 3, 9 | pclidN 41156 | . . 3 ⊢ ((𝐾 ∈ HL ∧ (𝑋 + 𝑌) ∈ 𝑆) → (𝑈‘(𝑋 + 𝑌)) = (𝑋 + 𝑌)) |
| 14 | 1, 12, 13 | syl2anc 596 | . 2 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → (𝑈‘(𝑋 + 𝑌)) = (𝑋 + 𝑌)) |
| 15 | 11, 14 | eqtrd 2798 | 1 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → (𝑈‘(𝑋 ∪ 𝑌)) = (𝑋 + 𝑌)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ w3a 1103 = wceq 1570 ∈ wcel 2147 ⊆ wss 3900 ∪ cun 4152 ‘cfv 6561 (class class class)co 7446 Atomscatm 40523 HLchlt 40610 PSubSpcpsubsp 40756 +𝑃cpadd 41055 PClcpclN 41147 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5236 ax-sep 5253 ax-nul 5264 ax-pow 5332 ax-pr 5396 ax-un 7778 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-int 4911 df-iun 4956 df-br 5107 df-opab 5172 df-mpt 5191 df-id 5551 df-xp 5662 df-rel 5663 df-cnv 5664 df-co 5665 df-dm 5666 df-rn 5667 df-res 5668 df-ima 5669 df-iota 6515 df-fun 6563 df-fn 6564 df-f 6565 df-f1 6566 df-fo 6567 df-f1o 6568 df-fv 6569 df-riota 7403 df-ov 7449 df-oprab 7450 df-mpo 7451 df-1st 8028 df-2nd 8029 df-proset 18500 df-poset 18519 df-plt 18534 df-lub 18550 df-glb 18551 df-join 18552 df-meet 18553 df-p0 18629 df-lat 18638 df-clat 18705 df-oposet 40436 df-ol 40438 df-oml 40439 df-covers 40526 df-ats 40527 df-atl 40558 df-cvlat 40582 df-hlat 40611 df-psubsp 40763 df-padd 41056 df-pclN 41148 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |