| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > pj1rid | Structured version Visualization version GIF version | ||
| Description: The left projection function is the zero operator on the right subspace. (Contributed by Mario Carneiro, 15-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‘𝐺) |
| Ref | Expression |
|---|---|
| pj1rid | ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑈) → ((𝑇𝑃𝑈)‘𝑋) = 0 ) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | pj1eu.2 | . . . . . . 7 ⊢ (𝜑 → 𝑇 ∈ (SubGrp‘𝐺)) | |
| 2 | 1 | adantr 485 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑈) → 𝑇 ∈ (SubGrp‘𝐺)) |
| 3 | subgrcl 19201 | . . . . . 6 ⊢ (𝑇 ∈ (SubGrp‘𝐺) → 𝐺 ∈ Grp) | |
| 4 | 2, 3 | syl 18 | . . . . 5 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑈) → 𝐺 ∈ Grp) |
| 5 | pj1eu.3 | . . . . . . 7 ⊢ (𝜑 → 𝑈 ∈ (SubGrp‘𝐺)) | |
| 6 | eqid 2763 | . . . . . . . 8 ⊢ (Base‘𝐺) = (Base‘𝐺) | |
| 7 | 6 | subgss 19197 | . . . . . . 7 ⊢ (𝑈 ∈ (SubGrp‘𝐺) → 𝑈 ⊆ (Base‘𝐺)) |
| 8 | 5, 7 | syl 18 | . . . . . 6 ⊢ (𝜑 → 𝑈 ⊆ (Base‘𝐺)) |
| 9 | 8 | sselda 3937 | . . . . 5 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑈) → 𝑋 ∈ (Base‘𝐺)) |
| 10 | pj1eu.a | . . . . . 6 ⊢ + = (+g‘𝐺) | |
| 11 | pj1eu.o | . . . . . 6 ⊢ 0 = (0g‘𝐺) | |
| 12 | 6, 10, 11 | grplid 19038 | . . . . 5 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ (Base‘𝐺)) → ( 0 + 𝑋) = 𝑋) |
| 13 | 4, 9, 12 | syl2anc 595 | . . . 4 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑈) → ( 0 + 𝑋) = 𝑋) |
| 14 | 13 | eqcomd 2769 | . . 3 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑈) → 𝑋 = ( 0 + 𝑋)) |
| 15 | pj1eu.s | . . . 4 ⊢ ⊕ = (LSSum‘𝐺) | |
| 16 | pj1eu.z | . . . 4 ⊢ 𝑍 = (Cntz‘𝐺) | |
| 17 | 5 | adantr 485 | . . . 4 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑈) → 𝑈 ∈ (SubGrp‘𝐺)) |
| 18 | pj1eu.4 | . . . . 5 ⊢ (𝜑 → (𝑇 ∩ 𝑈) = { 0 }) | |
| 19 | 18 | adantr 485 | . . . 4 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑈) → (𝑇 ∩ 𝑈) = { 0 }) |
| 20 | pj1eu.5 | . . . . 5 ⊢ (𝜑 → 𝑇 ⊆ (𝑍‘𝑈)) | |
| 21 | 20 | adantr 485 | . . . 4 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑈) → 𝑇 ⊆ (𝑍‘𝑈)) |
| 22 | pj1f.p | . . . 4 ⊢ 𝑃 = (proj1‘𝐺) | |
| 23 | 15 | lsmub2 19732 | . . . . . 6 ⊢ ((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) → 𝑈 ⊆ (𝑇 ⊕ 𝑈)) |
| 24 | 1, 5, 23 | syl2anc 595 | . . . . 5 ⊢ (𝜑 → 𝑈 ⊆ (𝑇 ⊕ 𝑈)) |
| 25 | 24 | sselda 3937 | . . . 4 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑈) → 𝑋 ∈ (𝑇 ⊕ 𝑈)) |
| 26 | 11 | subg0cl 19204 | . . . . 5 ⊢ (𝑇 ∈ (SubGrp‘𝐺) → 0 ∈ 𝑇) |
| 27 | 2, 26 | syl 18 | . . . 4 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑈) → 0 ∈ 𝑇) |
| 28 | simpr 489 | . . . 4 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑈) → 𝑋 ∈ 𝑈) | |
| 29 | 10, 15, 11, 16, 2, 17, 19, 21, 22, 25, 27, 28 | pj1eq 19774 | . . 3 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑈) → (𝑋 = ( 0 + 𝑋) ↔ (((𝑇𝑃𝑈)‘𝑋) = 0 ∧ ((𝑈𝑃𝑇)‘𝑋) = 𝑋))) |
| 30 | 14, 29 | mpbid 235 | . 2 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑈) → (((𝑇𝑃𝑈)‘𝑋) = 0 ∧ ((𝑈𝑃𝑇)‘𝑋) = 𝑋)) |
| 31 | 30 | simpld 499 | 1 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑈) → ((𝑇𝑃𝑈)‘𝑋) = 0 ) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 400 = wceq 1570 ∈ wcel 2143 ∩ cin 3904 ⊆ wss 3905 {csn 4589 ‘cfv 6536 (class class class)co 7410 Basecbs 17273 +gcplusg 17314 0gc0g 17496 Grpcgrp 19004 SubGrpcsubg 19190 Cntzccntz 19389 LSSumclsm 19708 proj1cpj1 19709 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-rep 5238 ax-sep 5257 ax-nul 5269 ax-pow 5336 ax-pr 5404 ax-un 7732 ax-cnex 11160 ax-resscn 11161 ax-1cn 11162 ax-icn 11163 ax-addcl 11164 ax-addrcl 11165 ax-mulcl 11166 ax-mulrcl 11167 ax-mulcom 11168 ax-addass 11169 ax-mulass 11170 ax-distr 11171 ax-i2m1 11172 ax-1ne0 11173 ax-1rid 11174 ax-rnegex 11175 ax-rrecex 11176 ax-cnre 11177 ax-pre-lttri 11178 ax-pre-lttrn 11179 ax-pre-ltadd 11180 ax-pre-mulgt0 11181 |
| This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3065 df-ral 3080 df-rex 3090 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3745 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-pss 3925 df-nul 4287 df-if 4488 df-pw 4564 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4873 df-iun 4958 df-br 5110 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5556 df-eprel 5561 df-po 5569 df-so 5570 df-fr 5614 df-we 5616 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-pred 6302 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7367 df-ov 7413 df-oprab 7414 df-mpo 7415 df-om 7859 df-1st 7982 df-2nd 7983 df-frecs 8274 df-wrecs 8305 df-recs 8354 df-rdg 8393 df-er 8690 df-en 8940 df-dom 8941 df-sdom 8942 df-pnf 11249 df-mnf 11250 df-xr 11251 df-ltxr 11252 df-le 11253 df-sub 11447 df-neg 11448 df-nn 12238 df-2 12307 df-sets 17228 df-slot 17246 df-ndx 17258 df-base 17274 df-ress 17295 df-plusg 17327 df-0g 17498 df-mgm 18702 df-sgrp 18781 df-mnd 18797 df-submnd 18846 df-grp 19007 df-minusg 19008 df-sbg 19009 df-subg 19193 df-cntz 19391 df-lsm 19710 df-pj1 19711 |
| This theorem is used by: dpjidcl 20134 |
| Copyright terms: Public domain | W3C validator |