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

Theorem fsuppco2 9376
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 9377 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 6708 . . 3 (𝜑 → Fun 𝐺)
3 fsuppco2.f . . . 4 (𝜑𝐹:𝐴𝐵)
43ffund 6708 . . 3 (𝜑 → Fun 𝐹)
5 funco 6574 . . 3 ((Fun 𝐺 ∧ Fun 𝐹) → Fun (𝐺𝐹))
62, 4, 5syl2anc 596 . 2 (𝜑 → Fun (𝐺𝐹))
7 fsuppco2.n . . . 4 (𝜑𝐹 finSupp 𝑍)
87fsuppimpd 9342 . . 3 (𝜑 → (𝐹 supp 𝑍) ∈ Fin)
9 fco 6728 . . . . 5 ((𝐺:𝐵𝐵𝐹:𝐴𝐵) → (𝐺𝐹):𝐴𝐵)
101, 3, 9syl2anc 596 . . . 4 (𝜑 → (𝐺𝐹):𝐴𝐵)
11 eldifi 4078 . . . . . 6 (𝑥 ∈ (𝐴 ∖ (𝐹 supp 𝑍)) → 𝑥𝐴)
12 fvco3 6979 . . . . . 6 ((𝐹:𝐴𝐵𝑥𝐴) → ((𝐺𝐹)‘𝑥) = (𝐺‘(𝐹𝑥)))
133, 11, 12syl2an 608 . . . . 5 ((𝜑𝑥 ∈ (𝐴 ∖ (𝐹 supp 𝑍))) → ((𝐺𝐹)‘𝑥) = (𝐺‘(𝐹𝑥)))
14 ssidd 3954 . . . . . . 7 (𝜑 → (𝐹 supp 𝑍) ⊆ (𝐹 supp 𝑍))
15 fsuppco2.a . . . . . . 7 (𝜑𝐴𝑈)
16 fsuppco2.z . . . . . . 7 (𝜑𝑍𝑊)
173, 14, 15, 16suppssr 8194 . . . . . 6 ((𝜑𝑥 ∈ (𝐴 ∖ (𝐹 supp 𝑍))) → (𝐹𝑥) = 𝑍)
1817fveq2d 6883 . . . . 5 ((𝜑𝑥 ∈ (𝐴 ∖ (𝐹 supp 𝑍))) → (𝐺‘(𝐹𝑥)) = (𝐺𝑍))
19 fsuppco2.i . . . . . 6 (𝜑 → (𝐺𝑍) = 𝑍)
2019adantr 486 . . . . 5 ((𝜑𝑥 ∈ (𝐴 ∖ (𝐹 supp 𝑍))) → (𝐺𝑍) = 𝑍)
2113, 18, 203eqtrd 2799 . . . 4 ((𝜑𝑥 ∈ (𝐴 ∖ (𝐹 supp 𝑍))) → ((𝐺𝐹)‘𝑥) = 𝑍)
2210, 21suppss 8193 . . 3 (𝜑 → ((𝐺𝐹) supp 𝑍) ⊆ (𝐹 supp 𝑍))
238, 22ssfid 9242 . 2 (𝜑 → ((𝐺𝐹) supp 𝑍) ∈ Fin)
24 fsuppco2.b . . . . 5 (𝜑𝐵𝑉)
251, 24fexd 7227 . . . 4 (𝜑𝐺 ∈ V)
263, 15fexd 7227 . . . 4 (𝜑𝐹 ∈ V)
27 coexg 7927 . . . 4 ((𝐺 ∈ V ∧ 𝐹 ∈ V) → (𝐺𝐹) ∈ V)
2825, 26, 27syl2anc 596 . . 3 (𝜑 → (𝐺𝐹) ∈ V)
29 isfsupp 9338 . . 3 (((𝐺𝐹) ∈ V ∧ 𝑍𝑊) → ((𝐺𝐹) finSupp 𝑍 ↔ (Fun (𝐺𝐹) ∧ ((𝐺𝐹) supp 𝑍) ∈ Fin)))
3028, 16, 29syl2anc 596 . 2 (𝜑 → ((𝐺𝐹) finSupp 𝑍 ↔ (Fun (𝐺𝐹) ∧ ((𝐺𝐹) supp 𝑍) ∈ Fin)))
316, 23, 30mpbir2and 726 1 (𝜑 → (𝐺𝐹) finSupp 𝑍)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wb 209  wa 401   = wceq 1570  wcel 2145  Vcvv 3450  cdif 3896   class class class wbr 5103  ccom 5659  Fun wfun 6527  wf 6529  cfv 6533  (class class class)co 7414   supp csupp 8159  Fincfn 8955   finSupp cfsupp 9334
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 2732  ax-rep 5232  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7737
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  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-tr 5213  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-ord 6360  df-on 6361  df-lim 6362  df-suc 6363  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-ov 7417  df-oprab 7418  df-mpo 7419  df-om 7864  df-supp 8160  df-1o 8458  df-en 8956  df-fin 8959  df-fsupp 9335
This theorem is used by:  gsumzinv  20075  gsumsub  20078  elrgspnlem1  33685
  Copyright terms: Public domain W3C validator