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

Theorem gsumcllem 20115
Description: Lemma for gsumcl 20122 and related theorems. (Contributed by Mario Carneiro, 15-Dec-2014.) (Revised by Mario Carneiro, 24-Apr-2016.) (Revised by AV, 31-May-2019.)
Hypotheses
Ref Expression
gsumcllem.f (𝜑 → 𝐹:𝐴⟶𝐵)
gsumcllem.a (𝜑 → 𝐴 ∈ 𝑉)
gsumcllem.z (𝜑 → 𝑍 ∈ 𝑈)
gsumcllem.s (𝜑 → (𝐹 supp 𝑍) ⊆ 𝑊)
Assertion
Ref Expression
gsumcllem ((𝜑 ∧ 𝑊 = ∅) → 𝐹 = (𝑘 ∈ 𝐴 ↦ 𝑍))
Distinct variable groups:   𝐴,𝑘   𝑘,𝐹   𝜑,𝑘   𝑘,𝑊
Allowed substitution hints:   𝐵(𝑘)   𝑈(𝑘)   𝑉(𝑘)   𝑍(𝑘)

Proof of Theorem gsumcllem
StepHypRef Expression
1 gsumcllem.f . . . 4 (𝜑 → 𝐹:𝐴⟶𝐵)
21feqmptd 6951 . . 3 (𝜑 → 𝐹 = (𝑘 ∈ 𝐴 ↦ (𝐹‘𝑘)))
32adantr 486 . 2 ((𝜑 ∧ 𝑊 = ∅) → 𝐹 = (𝑘 ∈ 𝐴 ↦ (𝐹‘𝑘)))
4 difeq2 4068 . . . . . . . 8 (𝑊 = ∅ → (𝐴 ∖ 𝑊) = (𝐴 ∖ ∅))
5 dif0 4327 . . . . . . . 8 (𝐴 ∖ ∅) = 𝐴
64, 5eqtrdi 2812 . . . . . . 7 (𝑊 = ∅ → (𝐴 ∖ 𝑊) = 𝐴)
76eleq2d 2847 . . . . . 6 (𝑊 = ∅ → (𝑘 ∈ (𝐴 ∖ 𝑊) ↔ 𝑘 ∈ 𝐴))
87biimpar 483 . . . . 5 ((𝑊 = ∅ ∧ 𝑘 ∈ 𝐴) → 𝑘 ∈ (𝐴 ∖ 𝑊))
9 gsumcllem.s . . . . . 6 (𝜑 → (𝐹 supp 𝑍) ⊆ 𝑊)
10 gsumcllem.a . . . . . 6 (𝜑 → 𝐴 ∈ 𝑉)
11 gsumcllem.z . . . . . 6 (𝜑 → 𝑍 ∈ 𝑈)
121, 9, 10, 11suppssr 8205 . . . . 5 ((𝜑 ∧ 𝑘 ∈ (𝐴 ∖ 𝑊)) → (𝐹‘𝑘) = 𝑍)
138, 12sylan2 605 . . . 4 ((𝜑 ∧ (𝑊 = ∅ ∧ 𝑘 ∈ 𝐴)) → (𝐹‘𝑘) = 𝑍)
1413anassrs 473 . . 3 (((𝜑 ∧ 𝑊 = ∅) ∧ 𝑘 ∈ 𝐴) → (𝐹‘𝑘) = 𝑍)
1514mpteq2dva 5198 . 2 ((𝜑 ∧ 𝑊 = ∅) → (𝑘 ∈ 𝐴 ↦ (𝐹‘𝑘)) = (𝑘 ∈ 𝐴 ↦ 𝑍))
163, 15eqtrd 2796 1 ((𝜑 ∧ 𝑊 = ∅) → 𝐹 = (𝑘 ∈ 𝐴 ↦ 𝑍))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145   ∖ cdif 3896   ⊆ wss 3899  ∅c0 4279   ↦ cmpt 5186  ⟶wf 6533  ‘cfv 6537  (class class class)co 7418   supp csupp 8170
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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pr 5391  ax-un 7749
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 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-ov 7421  df-oprab 7422  df-mpo 7423  df-supp 8171
This theorem is used by:  gsumzres  20116  gsumzcl2  20117  gsumzf1o  20119  gsumzaddlem  20128  gsumzmhm  20144  gsumzoppg  20151
  Copyright terms: Public domain W3C validator