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

Theorem pj1val 19951
Description: The left projection function (for a direct product of group subspaces). (Contributed by Mario Carneiro, 15-Oct-2015.) (Revised by Mario Carneiro, 21-Apr-2016.)
Hypotheses
Ref Expression
pj1fval.v 𝐵 = (Base‘𝐺)
pj1fval.a + = (+g‘𝐺)
pj1fval.s ⊕ = (LSSum‘𝐺)
pj1fval.p 𝑃 = (proj1‘𝐺)
Assertion
Ref Expression
pj1val (((𝐺 ∈ 𝑉 ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) ∧ 𝑋 ∈ (𝑇 ⊕ 𝑈)) → ((𝑇𝑃𝑈)‘𝑋) = (℩𝑥 ∈ 𝑇 ∃𝑦 ∈ 𝑈 𝑋 = (𝑥 + 𝑦)))
Distinct variable groups:   𝑥,𝑦,𝐵   𝑥,𝑇,𝑦   𝑥,𝑈,𝑦   𝑥, ⊕ ,𝑦   𝑥,𝐺,𝑦   𝑥,𝑉,𝑦   𝑥,𝑋,𝑦
Allowed substitution hints:   𝑃(𝑥, 𝑦)   + (𝑥, 𝑦)

Proof of Theorem pj1val
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 pj1fval.v . . . 4 𝐵 = (Base‘𝐺)
2 pj1fval.a . . . 4 + = (+g‘𝐺)
3 pj1fval.s . . . 4 ⊕ = (LSSum‘𝐺)
4 pj1fval.p . . . 4 𝑃 = (proj1‘𝐺)
51, 2, 3, 4pj1fval 19950 . . 3 ((𝐺 ∈ 𝑉 ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) → (𝑇𝑃𝑈) = (𝑧 ∈ (𝑇 ⊕ 𝑈) ↦ (℩𝑥 ∈ 𝑇 ∃𝑦 ∈ 𝑈 𝑧 = (𝑥 + 𝑦))))
65adantr 486 . 2 (((𝐺 ∈ 𝑉 ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) ∧ 𝑋 ∈ (𝑇 ⊕ 𝑈)) → (𝑇𝑃𝑈) = (𝑧 ∈ (𝑇 ⊕ 𝑈) ↦ (℩𝑥 ∈ 𝑇 ∃𝑦 ∈ 𝑈 𝑧 = (𝑥 + 𝑦))))
7 simpr 490 . . . . 5 ((((𝐺 ∈ 𝑉 ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) ∧ 𝑋 ∈ (𝑇 ⊕ 𝑈)) ∧ 𝑧 = 𝑋) → 𝑧 = 𝑋)
87eqeq1d 2765 . . . 4 ((((𝐺 ∈ 𝑉 ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) ∧ 𝑋 ∈ (𝑇 ⊕ 𝑈)) ∧ 𝑧 = 𝑋) → (𝑧 = (𝑥 + 𝑦) ↔ 𝑋 = (𝑥 + 𝑦)))
98rexbidv 3190 . . 3 ((((𝐺 ∈ 𝑉 ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) ∧ 𝑋 ∈ (𝑇 ⊕ 𝑈)) ∧ 𝑧 = 𝑋) → (∃𝑦 ∈ 𝑈 𝑧 = (𝑥 + 𝑦) ↔ ∃𝑦 ∈ 𝑈 𝑋 = (𝑥 + 𝑦)))
109riotabidv 7408 . 2 ((((𝐺 ∈ 𝑉 ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) ∧ 𝑋 ∈ (𝑇 ⊕ 𝑈)) ∧ 𝑧 = 𝑋) → (℩𝑥 ∈ 𝑇 ∃𝑦 ∈ 𝑈 𝑧 = (𝑥 + 𝑦)) = (℩𝑥 ∈ 𝑇 ∃𝑦 ∈ 𝑈 𝑋 = (𝑥 + 𝑦)))
11 simpr 490 . 2 (((𝐺 ∈ 𝑉 ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) ∧ 𝑋 ∈ (𝑇 ⊕ 𝑈)) → 𝑋 ∈ (𝑇 ⊕ 𝑈))
12 riotaex 7410 . . 3 (℩𝑥 ∈ 𝑇 ∃𝑦 ∈ 𝑈 𝑋 = (𝑥 + 𝑦)) ∈ V
1312a1i 11 . 2 (((𝐺 ∈ 𝑉 ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) ∧ 𝑋 ∈ (𝑇 ⊕ 𝑈)) → (℩𝑥 ∈ 𝑇 ∃𝑦 ∈ 𝑈 𝑋 = (𝑥 + 𝑦)) ∈ V)
146, 10, 11, 13fvmptd 7030 1 (((𝐺 ∈ 𝑉 ∧ 𝑇 ⊆ 𝐵 ∧ 𝑈 ⊆ 𝐵) ∧ 𝑋 ∈ (𝑇 ⊕ 𝑈)) → ((𝑇𝑃𝑈)‘𝑋) = (℩𝑥 ∈ 𝑇 ∃𝑦 ∈ 𝑈 𝑋 = (𝑥 + 𝑦)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147  ∃wrex 3090  Vcvv 3454   ⊆ wss 3900   ↦ cmpt 5190  ‘cfv 6564  ℩crio 7405  (class class class)co 7449  Basecbs 17428  +gcplusg 17469  LSSumclsm 19890  proj1cpj1 19891
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 5236  ax-sep 5253  ax-nul 5264  ax-pow 5332  ax-pr 5396  ax-un 7781
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  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-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  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 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5172  df-mpt 5191  df-id 5551  df-xp 5662  df-rel 5663  df-cnv 5664  df-co 5665  df-dm 5666  df-rn 5667  df-res 5668  df-ima 5669  df-iota 6518  df-fun 6566  df-fn 6567  df-f 6568  df-f1 6569  df-fo 6570  df-f1o 6571  df-fv 6572  df-riota 7406  df-ov 7452  df-oprab 7453  df-mpo 7454  df-1st 8033  df-2nd 8034  df-pj1 19893
This theorem is used by:  pj1id  19955
  Copyright terms: Public domain W3C validator