| 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 19684 | . . . 4 ⊢ ((𝜑 ∧ 𝑋 ∈ (𝑇 ⊕ 𝑈)) → 𝑋 = (((𝑇𝑃𝑈)‘𝑋) + ((𝑈𝑃𝑇)‘𝑋))) |
| 12 | 1, 11 | mpdan 687 | . . 3 ⊢ (𝜑 → 𝑋 = (((𝑇𝑃𝑈)‘𝑋) + ((𝑈𝑃𝑇)‘𝑋))) |
| 13 | 12 | eqeq1d 2736 | . 2 ⊢ (𝜑 → (𝑋 = (𝐵 + 𝐶) ↔ (((𝑇𝑃𝑈)‘𝑋) + ((𝑈𝑃𝑇)‘𝑋)) = (𝐵 + 𝐶))) |
| 14 | 2, 3, 4, 5, 6, 7, 8, 9, 10 | pj1f 19682 | . . . 4 ⊢ (𝜑 → (𝑇𝑃𝑈):(𝑇 ⊕ 𝑈)⟶𝑇) |
| 15 | 14, 1 | ffvelcdmd 7084 | . . 3 ⊢ (𝜑 → ((𝑇𝑃𝑈)‘𝑋) ∈ 𝑇) |
| 16 | pj1eq.6 | . . 3 ⊢ (𝜑 → 𝐵 ∈ 𝑇) | |
| 17 | 2, 3, 4, 5, 6, 7, 8, 9, 10 | pj2f 19683 | . . . 4 ⊢ (𝜑 → (𝑈𝑃𝑇):(𝑇 ⊕ 𝑈)⟶𝑈) |
| 18 | 17, 1 | ffvelcdmd 7084 | . . 3 ⊢ (𝜑 → ((𝑈𝑃𝑇)‘𝑋) ∈ 𝑈) |
| 19 | pj1eq.7 | . . 3 ⊢ (𝜑 → 𝐶 ∈ 𝑈) | |
| 20 | 2, 4, 5, 6, 7, 8, 9, 15, 16, 18, 19 | subgdisjb 19678 | . 2 ⊢ (𝜑 → ((((𝑇𝑃𝑈)‘𝑋) + ((𝑈𝑃𝑇)‘𝑋)) = (𝐵 + 𝐶) ↔ (((𝑇𝑃𝑈)‘𝑋) = 𝐵 ∧ ((𝑈𝑃𝑇)‘𝑋) = 𝐶))) |
| 21 | 13, 20 | bitrd 279 | 1 ⊢ (𝜑 → (𝑋 = (𝐵 + 𝐶) ↔ (((𝑇𝑃𝑈)‘𝑋) = 𝐵 ∧ ((𝑈𝑃𝑇)‘𝑋) = 𝐶))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1539 ∈ wcel 2107 ∩ cin 3930 ⊆ wss 3931 {csn 4606 ‘cfv 6540 (class class class)co 7412 +gcplusg 17272 0gc0g 17454 SubGrpcsubg 19106 Cntzccntz 19301 LSSumclsm 19619 proj1cpj1 19620 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1794 ax-4 1808 ax-5 1909 ax-6 1966 ax-7 2006 ax-8 2109 ax-9 2117 ax-10 2140 ax-11 2156 ax-12 2176 ax-ext 2706 ax-rep 5259 ax-sep 5276 ax-nul 5286 ax-pow 5345 ax-pr 5412 ax-un 7736 ax-cnex 11192 ax-resscn 11193 ax-1cn 11194 ax-icn 11195 ax-addcl 11196 ax-addrcl 11197 ax-mulcl 11198 ax-mulrcl 11199 ax-mulcom 11200 ax-addass 11201 ax-mulass 11202 ax-distr 11203 ax-i2m1 11204 ax-1ne0 11205 ax-1rid 11206 ax-rnegex 11207 ax-rrecex 11208 ax-cnre 11209 ax-pre-lttri 11210 ax-pre-lttrn 11211 ax-pre-ltadd 11212 ax-pre-mulgt0 11213 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1779 df-nf 1783 df-sb 2064 df-mo 2538 df-eu 2567 df-clab 2713 df-cleq 2726 df-clel 2808 df-nfc 2884 df-ne 2932 df-nel 3036 df-ral 3051 df-rex 3060 df-rmo 3363 df-reu 3364 df-rab 3420 df-v 3465 df-sbc 3771 df-csb 3880 df-dif 3934 df-un 3936 df-in 3938 df-ss 3948 df-pss 3951 df-nul 4314 df-if 4506 df-pw 4582 df-sn 4607 df-pr 4609 df-op 4613 df-uni 4888 df-iun 4973 df-br 5124 df-opab 5186 df-mpt 5206 df-tr 5240 df-id 5558 df-eprel 5564 df-po 5572 df-so 5573 df-fr 5617 df-we 5619 df-xp 5671 df-rel 5672 df-cnv 5673 df-co 5674 df-dm 5675 df-rn 5676 df-res 5677 df-ima 5678 df-pred 6301 df-ord 6366 df-on 6367 df-lim 6368 df-suc 6369 df-iota 6493 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7869 df-1st 7995 df-2nd 7996 df-frecs 8287 df-wrecs 8318 df-recs 8392 df-rdg 8431 df-er 8726 df-en 8967 df-dom 8968 df-sdom 8969 df-pnf 11278 df-mnf 11279 df-xr 11280 df-ltxr 11281 df-le 11282 df-sub 11475 df-neg 11476 df-nn 12248 df-2 12310 df-sets 17182 df-slot 17200 df-ndx 17212 df-base 17229 df-ress 17252 df-plusg 17285 df-0g 17456 df-mgm 18621 df-sgrp 18700 df-mnd 18716 df-grp 18922 df-minusg 18923 df-sbg 18924 df-subg 19109 df-cntz 19303 df-lsm 19621 df-pj1 19622 |
| This theorem is referenced by: pj1lid 19686 pj1rid 19687 pj1ghm 19688 lsmhash 19690 dpjidcl 20045 pj1lmhm 21066 |
| Copyright terms: Public domain | W3C validator |