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

Theorem pj1id 19732
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 19162 . . . . . . 7 (𝑇 ∈ (SubGrp‘𝐺) → 𝐺 ∈ Grp)
31, 2syl 17 . . . . . 6 (𝜑𝐺 ∈ Grp)
4 eqid 2735 . . . . . . . 8 (Base‘𝐺) = (Base‘𝐺)
54subgss 19158 . . . . . . 7 (𝑇 ∈ (SubGrp‘𝐺) → 𝑇 ⊆ (Base‘𝐺))
61, 5syl 17 . . . . . 6 (𝜑𝑇 ⊆ (Base‘𝐺))
7 pj1eu.3 . . . . . . 7 (𝜑𝑈 ∈ (SubGrp‘𝐺))
84subgss 19158 . . . . . . 7 (𝑈 ∈ (SubGrp‘𝐺) → 𝑈 ⊆ (Base‘𝐺))
97, 8syl 17 . . . . . 6 (𝜑𝑈 ⊆ (Base‘𝐺))
103, 6, 93jca 1127 . . . . 5 (𝜑 → (𝐺 ∈ Grp ∧ 𝑇 ⊆ (Base‘𝐺) ∧ 𝑈 ⊆ (Base‘𝐺)))
11 pj1eu.a . . . . . 6 + = (+g𝐺)
12 pj1eu.s . . . . . 6 = (LSSum‘𝐺)
13 pj1f.p . . . . . 6 𝑃 = (proj1𝐺)
144, 11, 12, 13pj1val 19728 . . . . 5 (((𝐺 ∈ Grp ∧ 𝑇 ⊆ (Base‘𝐺) ∧ 𝑈 ⊆ (Base‘𝐺)) ∧ 𝑋 ∈ (𝑇 𝑈)) → ((𝑇𝑃𝑈)‘𝑋) = (𝑥𝑇𝑦𝑈 𝑋 = (𝑥 + 𝑦)))
1510, 14sylan 580 . . . 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 19729 . . . . 5 ((𝜑𝑋 ∈ (𝑇 𝑈)) → ∃!𝑥𝑇𝑦𝑈 𝑋 = (𝑥 + 𝑦))
21 riotacl2 7404 . . . . 5 (∃!𝑥𝑇𝑦𝑈 𝑋 = (𝑥 + 𝑦) → (𝑥𝑇𝑦𝑈 𝑋 = (𝑥 + 𝑦)) ∈ {𝑥𝑇 ∣ ∃𝑦𝑈 𝑋 = (𝑥 + 𝑦)})
2220, 21syl 17 . . . 4 ((𝜑𝑋 ∈ (𝑇 𝑈)) → (𝑥𝑇𝑦𝑈 𝑋 = (𝑥 + 𝑦)) ∈ {𝑥𝑇 ∣ ∃𝑦𝑈 𝑋 = (𝑥 + 𝑦)})
2315, 22eqeltrd 2839 . . 3 ((𝜑𝑋 ∈ (𝑇 𝑈)) → ((𝑇𝑃𝑈)‘𝑋) ∈ {𝑥𝑇 ∣ ∃𝑦𝑈 𝑋 = (𝑥 + 𝑦)})
24 oveq1 7438 . . . . . . 7 (𝑥 = ((𝑇𝑃𝑈)‘𝑋) → (𝑥 + 𝑦) = (((𝑇𝑃𝑈)‘𝑋) + 𝑦))
2524eqeq2d 2746 . . . . . 6 (𝑥 = ((𝑇𝑃𝑈)‘𝑋) → (𝑋 = (𝑥 + 𝑦) ↔ 𝑋 = (((𝑇𝑃𝑈)‘𝑋) + 𝑦)))
2625rexbidv 3177 . . . . 5 (𝑥 = ((𝑇𝑃𝑈)‘𝑋) → (∃𝑦𝑈 𝑋 = (𝑥 + 𝑦) ↔ ∃𝑦𝑈 𝑋 = (((𝑇𝑃𝑈)‘𝑋) + 𝑦)))
2726elrab 3695 . . . 4 (((𝑇𝑃𝑈)‘𝑋) ∈ {𝑥𝑇 ∣ ∃𝑦𝑈 𝑋 = (𝑥 + 𝑦)} ↔ (((𝑇𝑃𝑈)‘𝑋) ∈ 𝑇 ∧ ∃𝑦𝑈 𝑋 = (((𝑇𝑃𝑈)‘𝑋) + 𝑦)))
2827simprbi 496 . . 3 (((𝑇𝑃𝑈)‘𝑋) ∈ {𝑥𝑇 ∣ ∃𝑦𝑈 𝑋 = (𝑥 + 𝑦)} → ∃𝑦𝑈 𝑋 = (((𝑇𝑃𝑈)‘𝑋) + 𝑦))
2923, 28syl 17 . 2 ((𝜑𝑋 ∈ (𝑇 𝑈)) → ∃𝑦𝑈 𝑋 = (((𝑇𝑃𝑈)‘𝑋) + 𝑦))
30 simprr 773 . . 3 (((𝜑𝑋 ∈ (𝑇 𝑈)) ∧ (𝑦𝑈𝑋 = (((𝑇𝑃𝑈)‘𝑋) + 𝑦))) → 𝑋 = (((𝑇𝑃𝑈)‘𝑋) + 𝑦))
313ad2antrr 726 . . . . . 6 (((𝜑𝑋 ∈ (𝑇 𝑈)) ∧ (𝑦𝑈𝑋 = (((𝑇𝑃𝑈)‘𝑋) + 𝑦))) → 𝐺 ∈ Grp)
329ad2antrr 726 . . . . . 6 (((𝜑𝑋 ∈ (𝑇 𝑈)) ∧ (𝑦𝑈𝑋 = (((𝑇𝑃𝑈)‘𝑋) + 𝑦))) → 𝑈 ⊆ (Base‘𝐺))
336ad2antrr 726 . . . . . 6 (((𝜑𝑋 ∈ (𝑇 𝑈)) ∧ (𝑦𝑈𝑋 = (((𝑇𝑃𝑈)‘𝑋) + 𝑦))) → 𝑇 ⊆ (Base‘𝐺))
34 simplr 769 . . . . . . 7 (((𝜑𝑋 ∈ (𝑇 𝑈)) ∧ (𝑦𝑈𝑋 = (((𝑇𝑃𝑈)‘𝑋) + 𝑦))) → 𝑋 ∈ (𝑇 𝑈))
3512, 17lsmcom2 19688 . . . . . . . . 9 ((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍𝑈)) → (𝑇 𝑈) = (𝑈 𝑇))
361, 7, 19, 35syl3anc 1370 . . . . . . . 8 (𝜑 → (𝑇 𝑈) = (𝑈 𝑇))
3736ad2antrr 726 . . . . . . 7 (((𝜑𝑋 ∈ (𝑇 𝑈)) ∧ (𝑦𝑈𝑋 = (((𝑇𝑃𝑈)‘𝑋) + 𝑦))) → (𝑇 𝑈) = (𝑈 𝑇))
3834, 37eleqtrd 2841 . . . . . 6 (((𝜑𝑋 ∈ (𝑇 𝑈)) ∧ (𝑦𝑈𝑋 = (((𝑇𝑃𝑈)‘𝑋) + 𝑦))) → 𝑋 ∈ (𝑈 𝑇))
394, 11, 12, 13pj1val 19728 . . . . . 6 (((𝐺 ∈ Grp ∧ 𝑈 ⊆ (Base‘𝐺) ∧ 𝑇 ⊆ (Base‘𝐺)) ∧ 𝑋 ∈ (𝑈 𝑇)) → ((𝑈𝑃𝑇)‘𝑋) = (𝑢𝑈𝑣𝑇 𝑋 = (𝑢 + 𝑣)))
4031, 32, 33, 38, 39syl31anc 1372 . . . . 5 (((𝜑𝑋 ∈ (𝑇 𝑈)) ∧ (𝑦𝑈𝑋 = (((𝑇𝑃𝑈)‘𝑋) + 𝑦))) → ((𝑈𝑃𝑇)‘𝑋) = (𝑢𝑈𝑣𝑇 𝑋 = (𝑢 + 𝑣)))
4111, 12, 16, 17, 1, 7, 18, 19, 13pj1f 19730 . . . . . . . . 9 (𝜑 → (𝑇𝑃𝑈):(𝑇 𝑈)⟶𝑇)
4241ad2antrr 726 . . . . . . . 8 (((𝜑𝑋 ∈ (𝑇 𝑈)) ∧ (𝑦𝑈𝑋 = (((𝑇𝑃𝑈)‘𝑋) + 𝑦))) → (𝑇𝑃𝑈):(𝑇 𝑈)⟶𝑇)
4342, 34ffvelcdmd 7105 . . . . . . 7 (((𝜑𝑋 ∈ (𝑇 𝑈)) ∧ (𝑦𝑈𝑋 = (((𝑇𝑃𝑈)‘𝑋) + 𝑦))) → ((𝑇𝑃𝑈)‘𝑋) ∈ 𝑇)
4419ad2antrr 726 . . . . . . . . . 10 (((𝜑𝑋 ∈ (𝑇 𝑈)) ∧ (𝑦𝑈𝑋 = (((𝑇𝑃𝑈)‘𝑋) + 𝑦))) → 𝑇 ⊆ (𝑍𝑈))
4544, 43sseldd 3996 . . . . . . . . 9 (((𝜑𝑋 ∈ (𝑇 𝑈)) ∧ (𝑦𝑈𝑋 = (((𝑇𝑃𝑈)‘𝑋) + 𝑦))) → ((𝑇𝑃𝑈)‘𝑋) ∈ (𝑍𝑈))
46 simprl 771 . . . . . . . . 9 (((𝜑𝑋 ∈ (𝑇 𝑈)) ∧ (𝑦𝑈𝑋 = (((𝑇𝑃𝑈)‘𝑋) + 𝑦))) → 𝑦𝑈)
4711, 17cntzi 19360 . . . . . . . . 9 ((((𝑇𝑃𝑈)‘𝑋) ∈ (𝑍𝑈) ∧ 𝑦𝑈) → (((𝑇𝑃𝑈)‘𝑋) + 𝑦) = (𝑦 + ((𝑇𝑃𝑈)‘𝑋)))
4845, 46, 47syl2anc 584 . . . . . . . 8 (((𝜑𝑋 ∈ (𝑇 𝑈)) ∧ (𝑦𝑈𝑋 = (((𝑇𝑃𝑈)‘𝑋) + 𝑦))) → (((𝑇𝑃𝑈)‘𝑋) + 𝑦) = (𝑦 + ((𝑇𝑃𝑈)‘𝑋)))
4930, 48eqtrd 2775 . . . . . . 7 (((𝜑𝑋 ∈ (𝑇 𝑈)) ∧ (𝑦𝑈𝑋 = (((𝑇𝑃𝑈)‘𝑋) + 𝑦))) → 𝑋 = (𝑦 + ((𝑇𝑃𝑈)‘𝑋)))
50 oveq2 7439 . . . . . . . 8 (𝑣 = ((𝑇𝑃𝑈)‘𝑋) → (𝑦 + 𝑣) = (𝑦 + ((𝑇𝑃𝑈)‘𝑋)))
5150rspceeqv 3645 . . . . . . 7 ((((𝑇𝑃𝑈)‘𝑋) ∈ 𝑇𝑋 = (𝑦 + ((𝑇𝑃𝑈)‘𝑋))) → ∃𝑣𝑇 𝑋 = (𝑦 + 𝑣))
5243, 49, 51syl2anc 584 . . . . . 6 (((𝜑𝑋 ∈ (𝑇 𝑈)) ∧ (𝑦𝑈𝑋 = (((𝑇𝑃𝑈)‘𝑋) + 𝑦))) → ∃𝑣𝑇 𝑋 = (𝑦 + 𝑣))
53 simpll 767 . . . . . . . 8 (((𝜑𝑋 ∈ (𝑇 𝑈)) ∧ (𝑦𝑈𝑋 = (((𝑇𝑃𝑈)‘𝑋) + 𝑦))) → 𝜑)
54 incom 4217 . . . . . . . . . 10 (𝑈𝑇) = (𝑇𝑈)
5554, 18eqtrid 2787 . . . . . . . . 9 (𝜑 → (𝑈𝑇) = { 0 })
5617, 1, 7, 19cntzrecd 19711 . . . . . . . . 9 (𝜑𝑈 ⊆ (𝑍𝑇))
5711, 12, 16, 17, 7, 1, 55, 56pj1eu 19729 . . . . . . . 8 ((𝜑𝑋 ∈ (𝑈 𝑇)) → ∃!𝑢𝑈𝑣𝑇 𝑋 = (𝑢 + 𝑣))
5853, 38, 57syl2anc 584 . . . . . . 7 (((𝜑𝑋 ∈ (𝑇 𝑈)) ∧ (𝑦𝑈𝑋 = (((𝑇𝑃𝑈)‘𝑋) + 𝑦))) → ∃!𝑢𝑈𝑣𝑇 𝑋 = (𝑢 + 𝑣))
59 oveq1 7438 . . . . . . . . . 10 (𝑢 = 𝑦 → (𝑢 + 𝑣) = (𝑦 + 𝑣))
6059eqeq2d 2746 . . . . . . . . 9 (𝑢 = 𝑦 → (𝑋 = (𝑢 + 𝑣) ↔ 𝑋 = (𝑦 + 𝑣)))
6160rexbidv 3177 . . . . . . . 8 (𝑢 = 𝑦 → (∃𝑣𝑇 𝑋 = (𝑢 + 𝑣) ↔ ∃𝑣𝑇 𝑋 = (𝑦 + 𝑣)))
6261riota2 7413 . . . . . . 7 ((𝑦𝑈 ∧ ∃!𝑢𝑈𝑣𝑇 𝑋 = (𝑢 + 𝑣)) → (∃𝑣𝑇 𝑋 = (𝑦 + 𝑣) ↔ (𝑢𝑈𝑣𝑇 𝑋 = (𝑢 + 𝑣)) = 𝑦))
6346, 58, 62syl2anc 584 . . . . . 6 (((𝜑𝑋 ∈ (𝑇 𝑈)) ∧ (𝑦𝑈𝑋 = (((𝑇𝑃𝑈)‘𝑋) + 𝑦))) → (∃𝑣𝑇 𝑋 = (𝑦 + 𝑣) ↔ (𝑢𝑈𝑣𝑇 𝑋 = (𝑢 + 𝑣)) = 𝑦))
6452, 63mpbid 232 . . . . 5 (((𝜑𝑋 ∈ (𝑇 𝑈)) ∧ (𝑦𝑈𝑋 = (((𝑇𝑃𝑈)‘𝑋) + 𝑦))) → (𝑢𝑈𝑣𝑇 𝑋 = (𝑢 + 𝑣)) = 𝑦)
6540, 64eqtrd 2775 . . . 4 (((𝜑𝑋 ∈ (𝑇 𝑈)) ∧ (𝑦𝑈𝑋 = (((𝑇𝑃𝑈)‘𝑋) + 𝑦))) → ((𝑈𝑃𝑇)‘𝑋) = 𝑦)
6665oveq2d 7447 . . 3 (((𝜑𝑋 ∈ (𝑇 𝑈)) ∧ (𝑦𝑈𝑋 = (((𝑇𝑃𝑈)‘𝑋) + 𝑦))) → (((𝑇𝑃𝑈)‘𝑋) + ((𝑈𝑃𝑇)‘𝑋)) = (((𝑇𝑃𝑈)‘𝑋) + 𝑦))
6730, 66eqtr4d 2778 . 2 (((𝜑𝑋 ∈ (𝑇 𝑈)) ∧ (𝑦𝑈𝑋 = (((𝑇𝑃𝑈)‘𝑋) + 𝑦))) → 𝑋 = (((𝑇𝑃𝑈)‘𝑋) + ((𝑈𝑃𝑇)‘𝑋)))
6829, 67rexlimddv 3159 1 ((𝜑𝑋 ∈ (𝑇 𝑈)) → 𝑋 = (((𝑇𝑃𝑈)‘𝑋) + ((𝑈𝑃𝑇)‘𝑋)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  w3a 1086   = wceq 1537  wcel 2106  wrex 3068  ∃!wreu 3376  {crab 3433  cin 3962  wss 3963  {csn 4631  wf 6559  cfv 6563  crio 7387  (class class class)co 7431  Basecbs 17245  +gcplusg 17298  0gc0g 17486  Grpcgrp 18964  SubGrpcsubg 19151  Cntzccntz 19346  LSSumclsm 19667  proj1cpj1 19668
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-ext 2706  ax-rep 5285  ax-sep 5302  ax-nul 5312  ax-pow 5371  ax-pr 5438  ax-un 7754  ax-cnex 11209  ax-resscn 11210  ax-1cn 11211  ax-icn 11212  ax-addcl 11213  ax-addrcl 11214  ax-mulcl 11215  ax-mulrcl 11216  ax-mulcom 11217  ax-addass 11218  ax-mulass 11219  ax-distr 11220  ax-i2m1 11221  ax-1ne0 11222  ax-1rid 11223  ax-rnegex 11224  ax-rrecex 11225  ax-cnre 11226  ax-pre-lttri 11227  ax-pre-lttrn 11228  ax-pre-ltadd 11229  ax-pre-mulgt0 11230
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-nf 1781  df-sb 2063  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2727  df-clel 2814  df-nfc 2890  df-ne 2939  df-nel 3045  df-ral 3060  df-rex 3069  df-rmo 3378  df-reu 3379  df-rab 3434  df-v 3480  df-sbc 3792  df-csb 3909  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-pss 3983  df-nul 4340  df-if 4532  df-pw 4607  df-sn 4632  df-pr 4634  df-op 4638  df-uni 4913  df-iun 4998  df-br 5149  df-opab 5211  df-mpt 5232  df-tr 5266  df-id 5583  df-eprel 5589  df-po 5597  df-so 5598  df-fr 5641  df-we 5643  df-xp 5695  df-rel 5696  df-cnv 5697  df-co 5698  df-dm 5699  df-rn 5700  df-res 5701  df-ima 5702  df-pred 6323  df-ord 6389  df-on 6390  df-lim 6391  df-suc 6392  df-iota 6516  df-fun 6565  df-fn 6566  df-f 6567  df-f1 6568  df-fo 6569  df-f1o 6570  df-fv 6571  df-riota 7388  df-ov 7434  df-oprab 7435  df-mpo 7436  df-om 7888  df-1st 8013  df-2nd 8014  df-frecs 8305  df-wrecs 8336  df-recs 8410  df-rdg 8449  df-er 8744  df-en 8985  df-dom 8986  df-sdom 8987  df-pnf 11295  df-mnf 11296  df-xr 11297  df-ltxr 11298  df-le 11299  df-sub 11492  df-neg 11493  df-nn 12265  df-2 12327  df-sets 17198  df-slot 17216  df-ndx 17228  df-base 17246  df-ress 17275  df-plusg 17311  df-0g 17488  df-mgm 18666  df-sgrp 18745  df-mnd 18761  df-grp 18967  df-minusg 18968  df-sbg 18969  df-subg 19154  df-cntz 19348  df-lsm 19669  df-pj1 19670
This theorem is referenced by:  pj1eq  19733  pj1ghm  19736  pj1lmhm  21117
  Copyright terms: Public domain W3C validator