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

Theorem fsuppco2 9293
Description: The composition of a function which maps the zero to zero with a finitely supported function is finitely supported. This is not only a special case of fsuppcor 9294 because it does not require that the "zero" is an element of the range of the finitely supported function. (Contributed by AV, 6-Jun-2019.)
Hypotheses
Ref Expression
fsuppco2.z (𝜑𝑍𝑊)
fsuppco2.f (𝜑𝐹:𝐴𝐵)
fsuppco2.g (𝜑𝐺:𝐵𝐵)
fsuppco2.a (𝜑𝐴𝑈)
fsuppco2.b (𝜑𝐵𝑉)
fsuppco2.n (𝜑𝐹 finSupp 𝑍)
fsuppco2.i (𝜑 → (𝐺𝑍) = 𝑍)
Assertion
Ref Expression
fsuppco2 (𝜑 → (𝐺𝐹) finSupp 𝑍)

Proof of Theorem fsuppco2
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 fsuppco2.g . . . 4 (𝜑𝐺:𝐵𝐵)
21ffund 6656 . . 3 (𝜑 → Fun 𝐺)
3 fsuppco2.f . . . 4 (𝜑𝐹:𝐴𝐵)
43ffund 6656 . . 3 (𝜑 → Fun 𝐹)
5 funco 6522 . . 3 ((Fun 𝐺 ∧ Fun 𝐹) → Fun (𝐺𝐹))
62, 4, 5syl2anc 584 . 2 (𝜑 → Fun (𝐺𝐹))
7 fsuppco2.n . . . 4 (𝜑𝐹 finSupp 𝑍)
87fsuppimpd 9259 . . 3 (𝜑 → (𝐹 supp 𝑍) ∈ Fin)
9 fco 6676 . . . . 5 ((𝐺:𝐵𝐵𝐹:𝐴𝐵) → (𝐺𝐹):𝐴𝐵)
101, 3, 9syl2anc 584 . . . 4 (𝜑 → (𝐺𝐹):𝐴𝐵)
11 eldifi 4082 . . . . . 6 (𝑥 ∈ (𝐴 ∖ (𝐹 supp 𝑍)) → 𝑥𝐴)
12 fvco3 6922 . . . . . 6 ((𝐹:𝐴𝐵𝑥𝐴) → ((𝐺𝐹)‘𝑥) = (𝐺‘(𝐹𝑥)))
133, 11, 12syl2an 596 . . . . 5 ((𝜑𝑥 ∈ (𝐴 ∖ (𝐹 supp 𝑍))) → ((𝐺𝐹)‘𝑥) = (𝐺‘(𝐹𝑥)))
14 ssidd 3959 . . . . . . 7 (𝜑 → (𝐹 supp 𝑍) ⊆ (𝐹 supp 𝑍))
15 fsuppco2.a . . . . . . 7 (𝜑𝐴𝑈)
16 fsuppco2.z . . . . . . 7 (𝜑𝑍𝑊)
173, 14, 15, 16suppssr 8128 . . . . . 6 ((𝜑𝑥 ∈ (𝐴 ∖ (𝐹 supp 𝑍))) → (𝐹𝑥) = 𝑍)
1817fveq2d 6826 . . . . 5 ((𝜑𝑥 ∈ (𝐴 ∖ (𝐹 supp 𝑍))) → (𝐺‘(𝐹𝑥)) = (𝐺𝑍))
19 fsuppco2.i . . . . . 6 (𝜑 → (𝐺𝑍) = 𝑍)
2019adantr 480 . . . . 5 ((𝜑𝑥 ∈ (𝐴 ∖ (𝐹 supp 𝑍))) → (𝐺𝑍) = 𝑍)
2113, 18, 203eqtrd 2768 . . . 4 ((𝜑𝑥 ∈ (𝐴 ∖ (𝐹 supp 𝑍))) → ((𝐺𝐹)‘𝑥) = 𝑍)
2210, 21suppss 8127 . . 3 (𝜑 → ((𝐺𝐹) supp 𝑍) ⊆ (𝐹 supp 𝑍))
238, 22ssfid 9158 . 2 (𝜑 → ((𝐺𝐹) supp 𝑍) ∈ Fin)
24 fsuppco2.b . . . . 5 (𝜑𝐵𝑉)
251, 24fexd 7163 . . . 4 (𝜑𝐺 ∈ V)
263, 15fexd 7163 . . . 4 (𝜑𝐹 ∈ V)
27 coexg 7862 . . . 4 ((𝐺 ∈ V ∧ 𝐹 ∈ V) → (𝐺𝐹) ∈ V)
2825, 26, 27syl2anc 584 . . 3 (𝜑 → (𝐺𝐹) ∈ V)
29 isfsupp 9255 . . 3 (((𝐺𝐹) ∈ V ∧ 𝑍𝑊) → ((𝐺𝐹) finSupp 𝑍 ↔ (Fun (𝐺𝐹) ∧ ((𝐺𝐹) supp 𝑍) ∈ Fin)))
3028, 16, 29syl2anc 584 . 2 (𝜑 → ((𝐺𝐹) finSupp 𝑍 ↔ (Fun (𝐺𝐹) ∧ ((𝐺𝐹) supp 𝑍) ∈ Fin)))
316, 23, 30mpbir2and 713 1 (𝜑 → (𝐺𝐹) finSupp 𝑍)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1540  wcel 2109  Vcvv 3436  cdif 3900   class class class wbr 5092  ccom 5623  Fun wfun 6476  wf 6478  cfv 6482  (class class class)co 7349   supp csupp 8093  Fincfn 8872   finSupp cfsupp 9251
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-rep 5218  ax-sep 5235  ax-nul 5245  ax-pow 5304  ax-pr 5371  ax-un 7671
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-reu 3344  df-rab 3395  df-v 3438  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4285  df-if 4477  df-pw 4553  df-sn 4578  df-pr 4580  df-op 4584  df-uni 4859  df-iun 4943  df-br 5093  df-opab 5155  df-mpt 5174  df-tr 5200  df-id 5514  df-eprel 5519  df-po 5527  df-so 5528  df-fr 5572  df-we 5574  df-xp 5625  df-rel 5626  df-cnv 5627  df-co 5628  df-dm 5629  df-rn 5630  df-res 5631  df-ima 5632  df-ord 6310  df-on 6311  df-lim 6312  df-suc 6313  df-iota 6438  df-fun 6484  df-fn 6485  df-f 6486  df-f1 6487  df-fo 6488  df-f1o 6489  df-fv 6490  df-ov 7352  df-oprab 7353  df-mpo 7354  df-om 7800  df-supp 8094  df-1o 8388  df-en 8873  df-fin 8876  df-fsupp 9252
This theorem is referenced by:  gsumzinv  19824  gsumsub  19827  elrgspnlem1  33182
  Copyright terms: Public domain W3C validator