MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  pj1id Structured version   Visualization version   GIF version

Theorem pj1id 19671
Description: Any element of a direct subspace sum can be decomposed into projections onto the left and right factors. (Contributed by Mario Carneiro, 15-Oct-2015.) (Revised by Mario Carneiro, 21-Apr-2016.)
Hypotheses
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𝐺)
Assertion
Ref Expression
pj1id ((𝜑𝑋 ∈ (𝑇 𝑈)) → 𝑋 = (((𝑇𝑃𝑈)‘𝑋) + ((𝑈𝑃𝑇)‘𝑋)))

Proof of Theorem pj1id
Dummy variables 𝑣 𝑢 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 pj1eu.2 . . . . . . 7 (𝜑𝑇 ∈ (SubGrp‘𝐺))
2 subgrcl 19099 . . . . . . 7 (𝑇 ∈ (SubGrp‘𝐺) → 𝐺 ∈ Grp)
31, 2syl 17 . . . . . 6 (𝜑𝐺 ∈ Grp)
4 eqid 2725 . . . . . . . 8 (Base‘𝐺) = (Base‘𝐺)
54subgss 19095 . . . . . . 7 (𝑇 ∈ (SubGrp‘𝐺) → 𝑇 ⊆ (Base‘𝐺))
61, 5syl 17 . . . . . 6 (𝜑𝑇 ⊆ (Base‘𝐺))
7 pj1eu.3 . . . . . . 7 (𝜑𝑈 ∈ (SubGrp‘𝐺))
84subgss 19095 . . . . . . 7 (𝑈 ∈ (SubGrp‘𝐺) → 𝑈 ⊆ (Base‘𝐺))
97, 8syl 17 . . . . . 6 (𝜑𝑈 ⊆ (Base‘𝐺))
103, 6, 93jca 1125 . . . . 5 (𝜑 → (𝐺 ∈ Grp ∧ 𝑇 ⊆ (Base‘𝐺) ∧ 𝑈 ⊆ (Base‘𝐺)))
11 pj1eu.a . . . . . 6 + = (+g𝐺)
12 pj1eu.s . . . . . 6 = (LSSum‘𝐺)
13 pj1f.p . . . . . 6 𝑃 = (proj1𝐺)
144, 11, 12, 13pj1val 19667 . . . . 5 (((𝐺 ∈ Grp ∧ 𝑇 ⊆ (Base‘𝐺) ∧ 𝑈 ⊆ (Base‘𝐺)) ∧ 𝑋 ∈ (𝑇 𝑈)) → ((𝑇𝑃𝑈)‘𝑋) = (𝑥𝑇𝑦𝑈 𝑋 = (𝑥 + 𝑦)))
1510, 14sylan 578 . . . 4 ((𝜑𝑋 ∈ (𝑇 𝑈)) → ((𝑇𝑃𝑈)‘𝑋) = (𝑥𝑇𝑦𝑈 𝑋 = (𝑥 + 𝑦)))
16 pj1eu.o . . . . . 6 0 = (0g𝐺)
17 pj1eu.z . . . . . 6 𝑍 = (Cntz‘𝐺)
18 pj1eu.4 . . . . . 6 (𝜑 → (𝑇𝑈) = { 0 })
19 pj1eu.5 . . . . . 6 (𝜑𝑇 ⊆ (𝑍𝑈))
2011, 12, 16, 17, 1, 7, 18, 19pj1eu 19668 . . . . 5 ((𝜑𝑋 ∈ (𝑇 𝑈)) → ∃!𝑥𝑇𝑦𝑈 𝑋 = (𝑥 + 𝑦))
21 riotacl2 7392 . . . . 5 (∃!𝑥𝑇𝑦𝑈 𝑋 = (𝑥 + 𝑦) → (𝑥𝑇𝑦𝑈 𝑋 = (𝑥 + 𝑦)) ∈ {𝑥𝑇 ∣ ∃𝑦𝑈 𝑋 = (𝑥 + 𝑦)})
2220, 21syl 17 . . . 4 ((𝜑𝑋 ∈ (𝑇 𝑈)) → (𝑥𝑇𝑦𝑈 𝑋 = (𝑥 + 𝑦)) ∈ {𝑥𝑇 ∣ ∃𝑦𝑈 𝑋 = (𝑥 + 𝑦)})
2315, 22eqeltrd 2825 . . 3 ((𝜑𝑋 ∈ (𝑇 𝑈)) → ((𝑇𝑃𝑈)‘𝑋) ∈ {𝑥𝑇 ∣ ∃𝑦𝑈 𝑋 = (𝑥 + 𝑦)})
24 oveq1 7426 . . . . . . 7 (𝑥 = ((𝑇𝑃𝑈)‘𝑋) → (𝑥 + 𝑦) = (((𝑇𝑃𝑈)‘𝑋) + 𝑦))
2524eqeq2d 2736 . . . . . 6 (𝑥 = ((𝑇𝑃𝑈)‘𝑋) → (𝑋 = (𝑥 + 𝑦) ↔ 𝑋 = (((𝑇𝑃𝑈)‘𝑋) + 𝑦)))
2625rexbidv 3168 . . . . 5 (𝑥 = ((𝑇𝑃𝑈)‘𝑋) → (∃𝑦𝑈 𝑋 = (𝑥 + 𝑦) ↔ ∃𝑦𝑈 𝑋 = (((𝑇𝑃𝑈)‘𝑋) + 𝑦)))
2726elrab 3679 . . . 4 (((𝑇𝑃𝑈)‘𝑋) ∈ {𝑥𝑇 ∣ ∃𝑦𝑈 𝑋 = (𝑥 + 𝑦)} ↔ (((𝑇𝑃𝑈)‘𝑋) ∈ 𝑇 ∧ ∃𝑦𝑈 𝑋 = (((𝑇𝑃𝑈)‘𝑋) + 𝑦)))
2827simprbi 495 . . 3 (((𝑇𝑃𝑈)‘𝑋) ∈ {𝑥𝑇 ∣ ∃𝑦𝑈 𝑋 = (𝑥 + 𝑦)} → ∃𝑦𝑈 𝑋 = (((𝑇𝑃𝑈)‘𝑋) + 𝑦))
2923, 28syl 17 . 2 ((𝜑𝑋 ∈ (𝑇 𝑈)) → ∃𝑦𝑈 𝑋 = (((𝑇𝑃𝑈)‘𝑋) + 𝑦))
30 simprr 771 . . 3 (((𝜑𝑋 ∈ (𝑇 𝑈)) ∧ (𝑦𝑈𝑋 = (((𝑇𝑃𝑈)‘𝑋) + 𝑦))) → 𝑋 = (((𝑇𝑃𝑈)‘𝑋) + 𝑦))
313ad2antrr 724 . . . . . 6 (((𝜑𝑋 ∈ (𝑇 𝑈)) ∧ (𝑦𝑈𝑋 = (((𝑇𝑃𝑈)‘𝑋) + 𝑦))) → 𝐺 ∈ Grp)
329ad2antrr 724 . . . . . 6 (((𝜑𝑋 ∈ (𝑇 𝑈)) ∧ (𝑦𝑈𝑋 = (((𝑇𝑃𝑈)‘𝑋) + 𝑦))) → 𝑈 ⊆ (Base‘𝐺))
336ad2antrr 724 . . . . . 6 (((𝜑𝑋 ∈ (𝑇 𝑈)) ∧ (𝑦𝑈𝑋 = (((𝑇𝑃𝑈)‘𝑋) + 𝑦))) → 𝑇 ⊆ (Base‘𝐺))
34 simplr 767 . . . . . . 7 (((𝜑𝑋 ∈ (𝑇 𝑈)) ∧ (𝑦𝑈𝑋 = (((𝑇𝑃𝑈)‘𝑋) + 𝑦))) → 𝑋 ∈ (𝑇 𝑈))
3512, 17lsmcom2 19627 . . . . . . . . 9 ((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) → (𝑇 𝑈) = (𝑈 𝑇))
361, 7, 19, 35syl3anc 1368 . . . . . . . 8 (𝜑 → (𝑇 𝑈) = (𝑈 𝑇))
3736ad2antrr 724 . . . . . . 7 (((𝜑𝑋 ∈ (𝑇 𝑈)) ∧ (𝑦𝑈𝑋 = (((𝑇𝑃𝑈)‘𝑋) + 𝑦))) → (𝑇 𝑈) = (𝑈 𝑇))
3834, 37eleqtrd 2827 . . . . . 6 (((𝜑𝑋 ∈ (𝑇 𝑈)) ∧ (𝑦𝑈𝑋 = (((𝑇𝑃𝑈)‘𝑋) + 𝑦))) → 𝑋 ∈ (𝑈 𝑇))
394, 11, 12, 13pj1val 19667 . . . . . 6 (((𝐺 ∈ Grp ∧ 𝑈 ⊆ (Base‘𝐺) ∧ 𝑇 ⊆ (Base‘𝐺)) ∧ 𝑋 ∈ (𝑈 𝑇)) → ((𝑈𝑃𝑇)‘𝑋) = (𝑢𝑈𝑣𝑇 𝑋 = (𝑢 + 𝑣)))
4031, 32, 33, 38, 39syl31anc 1370 . . . . 5 (((𝜑𝑋 ∈ (𝑇 𝑈)) ∧ (𝑦𝑈𝑋 = (((𝑇𝑃𝑈)‘𝑋) + 𝑦))) → ((𝑈𝑃𝑇)‘𝑋) = (𝑢𝑈𝑣𝑇 𝑋 = (𝑢 + 𝑣)))
4111, 12, 16, 17, 1, 7, 18, 19, 13pj1f 19669 . . . . . . . . 9 (𝜑 → (𝑇𝑃𝑈):(𝑇 𝑈)⟶𝑇)
4241ad2antrr 724 . . . . . . . 8 (((𝜑𝑋 ∈ (𝑇 𝑈)) ∧ (𝑦𝑈𝑋 = (((𝑇𝑃𝑈)‘𝑋) + 𝑦))) → (𝑇𝑃𝑈):(𝑇 𝑈)⟶𝑇)
4342, 34ffvelcdmd 7094 . . . . . . 7 (((𝜑𝑋 ∈ (𝑇 𝑈)) ∧ (𝑦𝑈𝑋 = (((𝑇𝑃𝑈)‘𝑋) + 𝑦))) → ((𝑇𝑃𝑈)‘𝑋) ∈ 𝑇)
4419ad2antrr 724 . . . . . . . . . 10 (((𝜑𝑋 ∈ (𝑇 𝑈)) ∧ (𝑦𝑈𝑋 = (((𝑇𝑃𝑈)‘𝑋) + 𝑦))) → 𝑇 ⊆ (𝑍𝑈))
4544, 43sseldd 3977 . . . . . . . . 9 (((𝜑𝑋 ∈ (𝑇 𝑈)) ∧ (𝑦𝑈𝑋 = (((𝑇𝑃𝑈)‘𝑋) + 𝑦))) → ((𝑇𝑃𝑈)‘𝑋) ∈ (𝑍𝑈))
46 simprl 769 . . . . . . . . 9 (((𝜑𝑋 ∈ (𝑇 𝑈)) ∧ (𝑦𝑈𝑋 = (((𝑇𝑃𝑈)‘𝑋) + 𝑦))) → 𝑦𝑈)
4711, 17cntzi 19297 . . . . . . . . 9 ((((𝑇𝑃𝑈)‘𝑋) ∈ (𝑍𝑈) ∧ 𝑦𝑈) → (((𝑇𝑃𝑈)‘𝑋) + 𝑦) = (𝑦 + ((𝑇𝑃𝑈)‘𝑋)))
4845, 46, 47syl2anc 582 . . . . . . . 8 (((𝜑𝑋 ∈ (𝑇 𝑈)) ∧ (𝑦𝑈𝑋 = (((𝑇𝑃𝑈)‘𝑋) + 𝑦))) → (((𝑇𝑃𝑈)‘𝑋) + 𝑦) = (𝑦 + ((𝑇𝑃𝑈)‘𝑋)))
4930, 48eqtrd 2765 . . . . . . 7 (((𝜑𝑋 ∈ (𝑇 𝑈)) ∧ (𝑦𝑈𝑋 = (((𝑇𝑃𝑈)‘𝑋) + 𝑦))) → 𝑋 = (𝑦 + ((𝑇𝑃𝑈)‘𝑋)))
50 oveq2 7427 . . . . . . . 8 (𝑣 = ((𝑇𝑃𝑈)‘𝑋) → (𝑦 + 𝑣) = (𝑦 + ((𝑇𝑃𝑈)‘𝑋)))
5150rspceeqv 3628 . . . . . . 7 ((((𝑇𝑃𝑈)‘𝑋) ∈ 𝑇𝑋 = (𝑦 + ((𝑇𝑃𝑈)‘𝑋))) → ∃𝑣𝑇 𝑋 = (𝑦 + 𝑣))
5243, 49, 51syl2anc 582 . . . . . 6 (((𝜑𝑋 ∈ (𝑇 𝑈)) ∧ (𝑦𝑈𝑋 = (((𝑇𝑃𝑈)‘𝑋) + 𝑦))) → ∃𝑣𝑇 𝑋 = (𝑦 + 𝑣))
53 simpll 765 . . . . . . . 8 (((𝜑𝑋 ∈ (𝑇 𝑈)) ∧ (𝑦𝑈𝑋 = (((𝑇𝑃𝑈)‘𝑋) + 𝑦))) → 𝜑)
54 incom 4199 . . . . . . . . . 10 (𝑈𝑇) = (𝑇𝑈)
5554, 18eqtrid 2777 . . . . . . . . 9 (𝜑 → (𝑈𝑇) = { 0 })
5617, 1, 7, 19cntzrecd 19650 . . . . . . . . 9 (𝜑𝑈 ⊆ (𝑍𝑇))
5711, 12, 16, 17, 7, 1, 55, 56pj1eu 19668 . . . . . . . 8 ((𝜑𝑋 ∈ (𝑈 𝑇)) → ∃!𝑢𝑈𝑣𝑇 𝑋 = (𝑢 + 𝑣))
5853, 38, 57syl2anc 582 . . . . . . 7 (((𝜑𝑋 ∈ (𝑇 𝑈)) ∧ (𝑦𝑈𝑋 = (((𝑇𝑃𝑈)‘𝑋) + 𝑦))) → ∃!𝑢𝑈𝑣𝑇 𝑋 = (𝑢 + 𝑣))
59 oveq1 7426 . . . . . . . . . 10 (𝑢 = 𝑦 → (𝑢 + 𝑣) = (𝑦 + 𝑣))
6059eqeq2d 2736 . . . . . . . . 9 (𝑢 = 𝑦 → (𝑋 = (𝑢 + 𝑣) ↔ 𝑋 = (𝑦 + 𝑣)))
6160rexbidv 3168 . . . . . . . 8 (𝑢 = 𝑦 → (∃𝑣𝑇 𝑋 = (𝑢 + 𝑣) ↔ ∃𝑣𝑇 𝑋 = (𝑦 + 𝑣)))
6261riota2 7401 . . . . . . 7 ((𝑦𝑈 ∧ ∃!𝑢𝑈𝑣𝑇 𝑋 = (𝑢 + 𝑣)) → (∃𝑣𝑇 𝑋 = (𝑦 + 𝑣) ↔ (𝑢𝑈𝑣𝑇 𝑋 = (𝑢 + 𝑣)) = 𝑦))
6346, 58, 62syl2anc 582 . . . . . 6 (((𝜑𝑋 ∈ (𝑇 𝑈)) ∧ (𝑦𝑈𝑋 = (((𝑇𝑃𝑈)‘𝑋) + 𝑦))) → (∃𝑣𝑇 𝑋 = (𝑦 + 𝑣) ↔ (𝑢𝑈𝑣𝑇 𝑋 = (𝑢 + 𝑣)) = 𝑦))
6452, 63mpbid 231 . . . . 5 (((𝜑𝑋 ∈ (𝑇 𝑈)) ∧ (𝑦𝑈𝑋 = (((𝑇𝑃𝑈)‘𝑋) + 𝑦))) → (𝑢𝑈𝑣𝑇 𝑋 = (𝑢 + 𝑣)) = 𝑦)
6540, 64eqtrd 2765 . . . 4 (((𝜑𝑋 ∈ (𝑇 𝑈)) ∧ (𝑦𝑈𝑋 = (((𝑇𝑃𝑈)‘𝑋) + 𝑦))) → ((𝑈𝑃𝑇)‘𝑋) = 𝑦)
6665oveq2d 7435 . . 3 (((𝜑𝑋 ∈ (𝑇 𝑈)) ∧ (𝑦𝑈𝑋 = (((𝑇𝑃𝑈)‘𝑋) + 𝑦))) → (((𝑇𝑃𝑈)‘𝑋) + ((𝑈𝑃𝑇)‘𝑋)) = (((𝑇𝑃𝑈)‘𝑋) + 𝑦))
6730, 66eqtr4d 2768 . 2 (((𝜑𝑋 ∈ (𝑇 𝑈)) ∧ (𝑦𝑈𝑋 = (((𝑇𝑃𝑈)‘𝑋) + 𝑦))) → 𝑋 = (((𝑇𝑃𝑈)‘𝑋) + ((𝑈𝑃𝑇)‘𝑋)))
6829, 67rexlimddv 3150 1 ((𝜑𝑋 ∈ (𝑇 𝑈)) → 𝑋 = (((𝑇𝑃𝑈)‘𝑋) + ((𝑈𝑃𝑇)‘𝑋)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 394  w3a 1084   = wceq 1533  wcel 2098  wrex 3059  ∃!wreu 3361  {crab 3418  cin 3943  wss 3944  {csn 4630  wf 6545  cfv 6549  crio 7374  (class class class)co 7419  Basecbs 17188  +gcplusg 17241  0gc0g 17429  Grpcgrp 18903  SubGrpcsubg 19088  Cntzccntz 19283  LSSumclsm 19606  proj1cpj1 19607
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-10 2129  ax-11 2146  ax-12 2166  ax-ext 2696  ax-rep 5286  ax-sep 5300  ax-nul 5307  ax-pow 5365  ax-pr 5429  ax-un 7741  ax-cnex 11201  ax-resscn 11202  ax-1cn 11203  ax-icn 11204  ax-addcl 11205  ax-addrcl 11206  ax-mulcl 11207  ax-mulrcl 11208  ax-mulcom 11209  ax-addass 11210  ax-mulass 11211  ax-distr 11212  ax-i2m1 11213  ax-1ne0 11214  ax-1rid 11215  ax-rnegex 11216  ax-rrecex 11217  ax-cnre 11218  ax-pre-lttri 11219  ax-pre-lttrn 11220  ax-pre-ltadd 11221  ax-pre-mulgt0 11222
This theorem depends on definitions:  df-bi 206  df-an 395  df-or 846  df-3or 1085  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-nf 1778  df-sb 2060  df-mo 2528  df-eu 2557  df-clab 2703  df-cleq 2717  df-clel 2802  df-nfc 2877  df-ne 2930  df-nel 3036  df-ral 3051  df-rex 3060  df-rmo 3363  df-reu 3364  df-rab 3419  df-v 3463  df-sbc 3774  df-csb 3890  df-dif 3947  df-un 3949  df-in 3951  df-ss 3961  df-pss 3964  df-nul 4323  df-if 4531  df-pw 4606  df-sn 4631  df-pr 4633  df-op 4637  df-uni 4910  df-iun 4999  df-br 5150  df-opab 5212  df-mpt 5233  df-tr 5267  df-id 5576  df-eprel 5582  df-po 5590  df-so 5591  df-fr 5633  df-we 5635  df-xp 5684  df-rel 5685  df-cnv 5686  df-co 5687  df-dm 5688  df-rn 5689  df-res 5690  df-ima 5691  df-pred 6307  df-ord 6374  df-on 6375  df-lim 6376  df-suc 6377  df-iota 6501  df-fun 6551  df-fn 6552  df-f 6553  df-f1 6554  df-fo 6555  df-f1o 6556  df-fv 6557  df-riota 7375  df-ov 7422  df-oprab 7423  df-mpo 7424  df-om 7872  df-1st 7994  df-2nd 7995  df-frecs 8287  df-wrecs 8318  df-recs 8392  df-rdg 8431  df-er 8725  df-en 8965  df-dom 8966  df-sdom 8967  df-pnf 11287  df-mnf 11288  df-xr 11289  df-ltxr 11290  df-le 11291  df-sub 11483  df-neg 11484  df-nn 12251  df-2 12313  df-sets 17141  df-slot 17159  df-ndx 17171  df-base 17189  df-ress 17218  df-plusg 17254  df-0g 17431  df-mgm 18608  df-sgrp 18687  df-mnd 18703  df-grp 18906  df-minusg 18907  df-sbg 18908  df-subg 19091  df-cntz 19285  df-lsm 19608  df-pj1 19609
This theorem is referenced by:  pj1eq  19672  pj1ghm  19675  pj1lmhm  21002
  Copyright terms: Public domain W3C validator