| 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 1137 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → 𝐾 ∈ HL) | |
| 2 | eqid 2736 | . . . . 5 ⊢ (Atoms‘𝐾) = (Atoms‘𝐾) | |
| 3 | pclun2.s | . . . . 5 ⊢ 𝑆 = (PSubSp‘𝐾) | |
| 4 | 2, 3 | psubssat 40200 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑆) → 𝑋 ⊆ (Atoms‘𝐾)) |
| 5 | 4 | 3adant3 1133 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → 𝑋 ⊆ (Atoms‘𝐾)) |
| 6 | 2, 3 | psubssat 40200 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑌 ∈ 𝑆) → 𝑌 ⊆ (Atoms‘𝐾)) |
| 7 | 6 | 3adant2 1132 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → 𝑌 ⊆ (Atoms‘𝐾)) |
| 8 | pclun2.p | . . . 4 ⊢ + = (+𝑃‘𝐾) | |
| 9 | pclun2.c | . . . 4 ⊢ 𝑈 = (PCl‘𝐾) | |
| 10 | 2, 8, 9 | pclunN 40344 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ⊆ (Atoms‘𝐾) ∧ 𝑌 ⊆ (Atoms‘𝐾)) → (𝑈‘(𝑋 ∪ 𝑌)) = (𝑈‘(𝑋 + 𝑌))) |
| 11 | 1, 5, 7, 10 | syl3anc 1374 | . 2 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → (𝑈‘(𝑋 ∪ 𝑌)) = (𝑈‘(𝑋 + 𝑌))) |
| 12 | 3, 8 | paddclN 40288 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → (𝑋 + 𝑌) ∈ 𝑆) |
| 13 | 3, 9 | pclidN 40342 | . . 3 ⊢ ((𝐾 ∈ HL ∧ (𝑋 + 𝑌) ∈ 𝑆) → (𝑈‘(𝑋 + 𝑌)) = (𝑋 + 𝑌)) |
| 14 | 1, 12, 13 | syl2anc 585 | . 2 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → (𝑈‘(𝑋 + 𝑌)) = (𝑋 + 𝑌)) |
| 15 | 11, 14 | eqtrd 2771 | 1 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → (𝑈‘(𝑋 ∪ 𝑌)) = (𝑋 + 𝑌)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 ∪ cun 3887 ⊆ wss 3889 ‘cfv 6498 (class class class)co 7367 Atomscatm 39709 HLchlt 39796 PSubSpcpsubsp 39942 +𝑃cpadd 40241 PClcpclN 40333 |
| 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-int 4890 df-iun 4935 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-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-padd 40242 df-pclN 40334 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |