Users' Mathboxes Mathbox for Thierry Arnoux < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  fisuppov1 Structured version   Visualization version   GIF version

Theorem fisuppov1 32711
Description: Formula building theorem for finite support: operator with left annihilator. (Contributed by Thierry Arnoux, 5-Oct-2025.)
Hypotheses
Ref Expression
fisuppov1.1 (𝜑𝑍𝑉)
fisuppov1.2 (𝜑0𝑋)
fisuppov1.3 (𝜑𝐴𝑊)
fisuppov1.4 (𝜑𝐷𝐴)
fisuppov1.5 ((𝜑𝑥𝐷) → 𝐵𝑌)
fisuppov1.6 (𝜑𝐹:𝐴𝐸)
fisuppov1.7 (𝜑𝐹 finSupp 0 )
fisuppov1.8 ((𝜑𝑦𝑌) → ( 0 𝑂𝑦) = 𝑍)
Assertion
Ref Expression
fisuppov1 (𝜑 → (𝑥𝐷 ↦ ((𝐹𝑥)𝑂𝐵)) finSupp 𝑍)
Distinct variable groups:   𝑥, 0   𝑦, 0   𝑥,𝐴   𝑦,𝐵   𝑥,𝐷   𝑥,𝐹   𝑦,𝑂   𝑦,𝑌   𝑥,𝑍   𝑦,𝑍   𝜑,𝑥   𝜑,𝑦
Allowed substitution hints:   𝐴(𝑦)   𝐵(𝑥)   𝐷(𝑦)   𝐸(𝑥,𝑦)   𝐹(𝑦)   𝑂(𝑥)   𝑉(𝑥,𝑦)   𝑊(𝑥,𝑦)   𝑋(𝑥,𝑦)   𝑌(𝑥)

Proof of Theorem fisuppov1
StepHypRef Expression
1 fisuppov1.3 . . . 4 (𝜑𝐴𝑊)
2 fisuppov1.4 . . . 4 (𝜑𝐷𝐴)
31, 2ssexd 5267 . . 3 (𝜑𝐷 ∈ V)
43mptexd 7168 . 2 (𝜑 → (𝑥𝐷 ↦ ((𝐹𝑥)𝑂𝐵)) ∈ V)
5 fisuppov1.1 . 2 (𝜑𝑍𝑉)
6 funmpt 6528 . . 3 Fun (𝑥𝐷 ↦ ((𝐹𝑥)𝑂𝐵))
76a1i 11 . 2 (𝜑 → Fun (𝑥𝐷 ↦ ((𝐹𝑥)𝑂𝐵)))
8 fisuppov1.7 . 2 (𝜑𝐹 finSupp 0 )
9 fisuppov1.6 . . . . . 6 (𝜑𝐹:𝐴𝐸)
109, 2feqresmpt 6901 . . . . 5 (𝜑 → (𝐹𝐷) = (𝑥𝐷 ↦ (𝐹𝑥)))
1110oveq1d 7371 . . . 4 (𝜑 → ((𝐹𝐷) supp 0 ) = ((𝑥𝐷 ↦ (𝐹𝑥)) supp 0 ))
129, 1fexd 7171 . . . . 5 (𝜑𝐹 ∈ V)
13 fisuppov1.2 . . . . 5 (𝜑0𝑋)
14 ressuppss 8123 . . . . 5 ((𝐹 ∈ V ∧ 0𝑋) → ((𝐹𝐷) supp 0 ) ⊆ (𝐹 supp 0 ))
1512, 13, 14syl2anc 584 . . . 4 (𝜑 → ((𝐹𝐷) supp 0 ) ⊆ (𝐹 supp 0 ))
1611, 15eqsstrrd 3967 . . 3 (𝜑 → ((𝑥𝐷 ↦ (𝐹𝑥)) supp 0 ) ⊆ (𝐹 supp 0 ))
17 fisuppov1.8 . . 3 ((𝜑𝑦𝑌) → ( 0 𝑂𝑦) = 𝑍)
18 fvexd 6847 . . 3 ((𝜑𝑥𝐷) → (𝐹𝑥) ∈ V)
19 fisuppov1.5 . . 3 ((𝜑𝑥𝐷) → 𝐵𝑌)
2016, 17, 18, 19, 13suppssov1 8137 . 2 (𝜑 → ((𝑥𝐷 ↦ ((𝐹𝑥)𝑂𝐵)) supp 𝑍) ⊆ (𝐹 supp 0 ))
214, 5, 7, 8, 20fsuppsssuppgd 9283 1 (𝜑 → (𝑥𝐷 ↦ ((𝐹𝑥)𝑂𝐵)) finSupp 𝑍)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1541  wcel 2113  Vcvv 3438  wss 3899   class class class wbr 5096  cmpt 5177  cres 5624  Fun wfun 6484  wf 6486  cfv 6490  (class class class)co 7356   supp csupp 8100   finSupp cfsupp 9262
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2706  ax-rep 5222  ax-sep 5239  ax-nul 5249  ax-pr 5375  ax-un 7678
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2567  df-clab 2713  df-cleq 2726  df-clel 2809  df-nfc 2883  df-ne 2931  df-ral 3050  df-rex 3059  df-reu 3349  df-rab 3398  df-v 3440  df-sbc 3739  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4284  df-if 4478  df-pw 4554  df-sn 4579  df-pr 4581  df-op 4585  df-uni 4862  df-iun 4946  df-br 5097  df-opab 5159  df-mpt 5178  df-tr 5204  df-id 5517  df-eprel 5522  df-po 5530  df-so 5531  df-fr 5575  df-we 5577  df-xp 5628  df-rel 5629  df-cnv 5630  df-co 5631  df-dm 5632  df-rn 5633  df-res 5634  df-ima 5635  df-ord 6318  df-on 6319  df-lim 6320  df-suc 6321  df-iota 6446  df-fun 6492  df-fn 6493  df-f 6494  df-f1 6495  df-fo 6496  df-f1o 6497  df-fv 6498  df-ov 7359  df-oprab 7360  df-mpo 7361  df-om 7807  df-supp 8101  df-1o 8395  df-en 8882  df-fin 8885  df-fsupp 9263
This theorem is referenced by:  elrgspnlem1  33273  elrgspnlem2  33274  evlextv  33656  fldextrspunlsplem  33779
  Copyright terms: Public domain W3C validator