| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > pj1eq | Structured version Visualization version GIF version | ||
| Description: Any element of a direct subspace sum can be decomposed uniquely into projections onto the left and right factors. (Contributed by Mario Carneiro, 16-Oct-2015.) |
| Ref | Expression |
|---|---|
| pj1eu.a | ⊢ + = (+g‘𝐺) |
| pj1eu.s | ⊢ ⊕ = (LSSum‘𝐺) |
| pj1eu.o | ⊢ 0 = (0g‘𝐺) |
| pj1eu.z | ⊢ 𝑍 = (Cntz‘𝐺) |
| pj1eu.2 | ⊢ (𝜑 → 𝑇 ∈ (SubGrp‘𝐺)) |
| pj1eu.3 | ⊢ (𝜑 → 𝑈 ∈ (SubGrp‘𝐺)) |
| pj1eu.4 | ⊢ (𝜑 → (𝑇 ∩ 𝑈) = { 0 }) |
| pj1eu.5 | ⊢ (𝜑 → 𝑇 ⊆ (𝑍‘𝑈)) |
| pj1f.p | ⊢ 𝑃 = (proj1‘𝐺) |
| pj1eq.5 | ⊢ (𝜑 → 𝑋 ∈ (𝑇 ⊕ 𝑈)) |
| pj1eq.6 | ⊢ (𝜑 → 𝐵 ∈ 𝑇) |
| pj1eq.7 | ⊢ (𝜑 → 𝐶 ∈ 𝑈) |
| Ref | Expression |
|---|---|
| pj1eq | ⊢ (𝜑 → (𝑋 = (𝐵 + 𝐶) ↔ (((𝑇𝑃𝑈)‘𝑋) = 𝐵 ∧ ((𝑈𝑃𝑇)‘𝑋) = 𝐶))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | pj1eq.5 | . . . 4 ⊢ (𝜑 → 𝑋 ∈ (𝑇 ⊕ 𝑈)) | |
| 2 | pj1eu.a | . . . . 5 ⊢ + = (+g‘𝐺) | |
| 3 | pj1eu.s | . . . . 5 ⊢ ⊕ = (LSSum‘𝐺) | |
| 4 | pj1eu.o | . . . . 5 ⊢ 0 = (0g‘𝐺) | |
| 5 | pj1eu.z | . . . . 5 ⊢ 𝑍 = (Cntz‘𝐺) | |
| 6 | pj1eu.2 | . . . . 5 ⊢ (𝜑 → 𝑇 ∈ (SubGrp‘𝐺)) | |
| 7 | pj1eu.3 | . . . . 5 ⊢ (𝜑 → 𝑈 ∈ (SubGrp‘𝐺)) | |
| 8 | pj1eu.4 | . . . . 5 ⊢ (𝜑 → (𝑇 ∩ 𝑈) = { 0 }) | |
| 9 | pj1eu.5 | . . . . 5 ⊢ (𝜑 → 𝑇 ⊆ (𝑍‘𝑈)) | |
| 10 | pj1f.p | . . . . 5 ⊢ 𝑃 = (proj1‘𝐺) | |
| 11 | 2, 3, 4, 5, 6, 7, 8, 9, 10 | pj1id 19922 | . . . 4 ⊢ ((𝜑 ∧ 𝑋 ∈ (𝑇 ⊕ 𝑈)) → 𝑋 = (((𝑇𝑃𝑈)‘𝑋) + ((𝑈𝑃𝑇)‘𝑋))) |
| 12 | 1, 11 | mpdan 700 | . . 3 ⊢ (𝜑 → 𝑋 = (((𝑇𝑃𝑈)‘𝑋) + ((𝑈𝑃𝑇)‘𝑋))) |
| 13 | 12 | eqeq1d 2762 | . 2 ⊢ (𝜑 → (𝑋 = (𝐵 + 𝐶) ↔ (((𝑇𝑃𝑈)‘𝑋) + ((𝑈𝑃𝑇)‘𝑋)) = (𝐵 + 𝐶))) |
| 14 | 2, 3, 4, 5, 6, 7, 8, 9, 10 | pj1f 19920 | . . . 4 ⊢ (𝜑 → (𝑇𝑃𝑈):(𝑇 ⊕ 𝑈)⟶𝑇) |
| 15 | 14, 1 | ffvelcdmd 7090 | . . 3 ⊢ (𝜑 → ((𝑇𝑃𝑈)‘𝑋) ∈ 𝑇) |
| 16 | pj1eq.6 | . . 3 ⊢ (𝜑 → 𝐵 ∈ 𝑇) | |
| 17 | 2, 3, 4, 5, 6, 7, 8, 9, 10 | pj2f 19921 | . . . 4 ⊢ (𝜑 → (𝑈𝑃𝑇):(𝑇 ⊕ 𝑈)⟶𝑈) |
| 18 | 17, 1 | ffvelcdmd 7090 | . . 3 ⊢ (𝜑 → ((𝑈𝑃𝑇)‘𝑋) ∈ 𝑈) |
| 19 | pj1eq.7 | . . 3 ⊢ (𝜑 → 𝐶 ∈ 𝑈) | |
| 20 | 2, 4, 5, 6, 7, 8, 9, 15, 16, 18, 19 | subgdisjb 19916 | . 2 ⊢ (𝜑 → ((((𝑇𝑃𝑈)‘𝑋) + ((𝑈𝑃𝑇)‘𝑋)) = (𝐵 + 𝐶) ↔ (((𝑇𝑃𝑈)‘𝑋) = 𝐵 ∧ ((𝑈𝑃𝑇)‘𝑋) = 𝐶))) |
| 21 | 13, 20 | bitrd 282 | 1 ⊢ (𝜑 → (𝑋 = (𝐵 + 𝐶) ↔ (((𝑇𝑃𝑈)‘𝑋) = 𝐵 ∧ ((𝑈𝑃𝑇)‘𝑋) = 𝐶))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1569 ∈ wcel 2144 ⊆ wss 3896 ∩ cin 4088 {csn 4584 ‘cfv 6543 (class class class)co 7424 +gcplusg 17437 0gc0g 17619 SubGrpcsubg 19339 Cntzccntz 19538 LSSumclsm 19857 proj1cpj1 19858 |
| 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 5327 ax-pr 5391 ax-un 7755 ax-cnex 11263 ax-resscn 11264 ax-1cn 11265 ax-icn 11266 ax-addcl 11267 ax-addrcl 11268 ax-mulcl 11269 ax-mulrcl 11270 ax-mulcom 11271 ax-addass 11272 ax-mulass 11273 ax-distr 11274 ax-i2m1 11275 ax-1ne0 11276 ax-1rid 11277 ax-rnegex 11278 ax-rrecex 11279 ax-cnre 11280 ax-pre-lttri 11281 ax-pre-lttrn 11282 ax-pre-ltadd 11283 ax-pre-mulgt0 11284 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 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-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3848 df-ss 3897 df-pss 4013 df-dif 4046 df-in 4090 df-un 4150 df-nul 4278 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6307 df-ord 6368 df-on 6369 df-lim 6370 df-suc 6371 df-iota 6497 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-riota 7381 df-ov 7427 df-oprab 7428 df-mpo 7429 df-om 7882 df-1st 8005 df-2nd 8006 df-frecs 8307 df-wrecs 8338 df-recs 8387 df-rdg 8426 df-er 8725 df-en 8982 df-dom 8983 df-sdom 8984 df-pnf 11352 df-mnf 11353 df-xr 11354 df-ltxr 11355 df-le 11356 df-sub 11550 df-neg 11551 df-nn 12343 df-2 12412 df-sets 17351 df-slot 17369 df-ndx 17381 df-base 17397 df-ress 17418 df-plusg 17450 df-0g 17621 df-mgm 18825 df-sgrp 18917 df-mnd 18933 df-grp 19156 df-minusg 19157 df-sbg 19158 df-subg 19342 df-cntz 19540 df-lsm 19859 df-pj1 19860 |
| This theorem is used by: pj1lid 19924 pj1rid 19925 pj1ghm 19926 lsmhash 19928 dpjidcl 20283 pj1lmhm 21384 |
| Copyright terms: Public domain | W3C validator |