| 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 19964 | . . . 4 ⊢ ((𝜑 ∧ 𝑋 ∈ (𝑇 ⊕ 𝑈)) → 𝑋 = (((𝑇𝑃𝑈)‘𝑋) + ((𝑈𝑃𝑇)‘𝑋))) |
| 12 | 1, 11 | mpdan 700 | . . 3 ⊢ (𝜑 → 𝑋 = (((𝑇𝑃𝑈)‘𝑋) + ((𝑈𝑃𝑇)‘𝑋))) |
| 13 | 12 | eqeq1d 2765 | . 2 ⊢ (𝜑 → (𝑋 = (𝐵 + 𝐶) ↔ (((𝑇𝑃𝑈)‘𝑋) + ((𝑈𝑃𝑇)‘𝑋)) = (𝐵 + 𝐶))) |
| 14 | 2, 3, 4, 5, 6, 7, 8, 9, 10 | pj1f 19962 | . . . 4 ⊢ (𝜑 → (𝑇𝑃𝑈):(𝑇 ⊕ 𝑈)⟶𝑇) |
| 15 | 14, 1 | ffvelcdmd 7117 | . . 3 ⊢ (𝜑 → ((𝑇𝑃𝑈)‘𝑋) ∈ 𝑇) |
| 16 | pj1eq.6 | . . 3 ⊢ (𝜑 → 𝐵 ∈ 𝑇) | |
| 17 | 2, 3, 4, 5, 6, 7, 8, 9, 10 | pj2f 19963 | . . . 4 ⊢ (𝜑 → (𝑈𝑃𝑇):(𝑇 ⊕ 𝑈)⟶𝑈) |
| 18 | 17, 1 | ffvelcdmd 7117 | . . 3 ⊢ (𝜑 → ((𝑈𝑃𝑇)‘𝑋) ∈ 𝑈) |
| 19 | pj1eq.7 | . . 3 ⊢ (𝜑 → 𝐶 ∈ 𝑈) | |
| 20 | 2, 4, 5, 6, 7, 8, 9, 15, 16, 18, 19 | subgdisjb 19958 | . 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 1570 ∈ wcel 2147 ⊆ wss 3900 ∩ cin 4092 {csn 4588 ‘cfv 6566 (class class class)co 7451 +gcplusg 17472 0gc0g 17660 SubGrpcsubg 19380 Cntzccntz 19580 LSSumclsm 19899 proj1cpj1 19900 |
| 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 5238 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-cnex 11295 ax-resscn 11296 ax-1cn 11297 ax-icn 11298 ax-addcl 11299 ax-addrcl 11300 ax-mulcl 11301 ax-mulrcl 11302 ax-mulcom 11303 ax-addass 11304 ax-mulass 11305 ax-distr 11306 ax-i2m1 11307 ax-1ne0 11308 ax-1rid 11309 ax-rnegex 11310 ax-rrecex 11311 ax-cnre 11312 ax-pre-lttri 11313 ax-pre-lttrn 11314 ax-pre-ltadd 11315 ax-pre-mulgt0 11316 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 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-nel 3066 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-pss 4017 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 4841 df-uni 4873 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-pred 6330 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-om 7912 df-1st 8035 df-2nd 8036 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-rdg 8456 df-er 8755 df-en 9012 df-dom 9013 df-sdom 9014 df-pnf 11384 df-mnf 11385 df-xr 11386 df-ltxr 11387 df-le 11388 df-sub 11582 df-neg 11583 df-nn 12376 df-2 12445 df-sets 17386 df-slot 17404 df-ndx 17416 df-base 17432 df-ress 17453 df-plusg 17486 df-0g 17662 df-mgm 18866 df-sgrp 18958 df-mnd 18974 df-grp 19197 df-minusg 19198 df-sbg 19199 df-subg 19383 df-cntz 19582 df-lsm 19901 df-pj1 19902 |
| This theorem is used by: pj1lid 19966 pj1rid 19967 pj1ghm 19968 lsmhash 19970 dpjidcl 20325 pj1lmhm 21426 |
| Copyright terms: Public domain | W3C validator |