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 32764
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 5270 . . 3 (𝜑𝐷 ∈ V)
43mptexd 7172 . 2 (𝜑 → (𝑥𝐷 ↦ ((𝐹𝑥)𝑂𝐵)) ∈ V)
5 fisuppov1.1 . 2 (𝜑𝑍𝑉)
6 funmpt 6531 . . 3 Fun (𝑥𝐷 ↦ ((𝐹𝑥)𝑂𝐵))
76a1i 11 . 2 (𝜑 → Fun (𝑥𝐷 ↦ ((𝐹𝑥)𝑂𝐵)))
8 fisuppov1.7 . 2 (𝜑𝐹 finSupp 0 )
9 fisuppov1.6 . . . . . 6 (𝜑𝐹:𝐴𝐸)
109, 2feqresmpt 6904 . . . . 5 (𝜑 → (𝐹𝐷) = (𝑥𝐷 ↦ (𝐹𝑥)))
1110oveq1d 7375 . . . 4 (𝜑 → ((𝐹𝐷) supp 0 ) = ((𝑥𝐷 ↦ (𝐹𝑥)) supp 0 ))
129, 1fexd 7175 . . . . 5 (𝜑𝐹 ∈ V)
13 fisuppov1.2 . . . . 5 (𝜑0𝑋)
14 ressuppss 8127 . . . . 5 ((𝐹 ∈ V ∧ 0𝑋) → ((𝐹𝐷) supp 0 ) ⊆ (𝐹 supp 0 ))
1512, 13, 14syl2anc 585 . . . 4 (𝜑 → ((𝐹𝐷) supp 0 ) ⊆ (𝐹 supp 0 ))
1611, 15eqsstrrd 3970 . . 3 (𝜑 → ((𝑥𝐷 ↦ (𝐹𝑥)) supp 0 ) ⊆ (𝐹 supp 0 ))
17 fisuppov1.8 . . 3 ((𝜑𝑦𝑌) → ( 0 𝑂𝑦) = 𝑍)
18 fvexd 6850 . . 3 ((𝜑𝑥𝐷) → (𝐹𝑥) ∈ V)
19 fisuppov1.5 . . 3 ((𝜑𝑥𝐷) → 𝐵𝑌)
2016, 17, 18, 19, 13suppssov1 8141 . 2 (𝜑 → ((𝑥𝐷 ↦ ((𝐹𝑥)𝑂𝐵)) supp 𝑍) ⊆ (𝐹 supp 0 ))
214, 5, 7, 8, 20fsuppsssuppgd 9289 1 (𝜑 → (𝑥𝐷 ↦ ((𝐹𝑥)𝑂𝐵)) finSupp 𝑍)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1542  wcel 2114  Vcvv 3441  wss 3902   class class class wbr 5099  cmpt 5180  cres 5627  Fun wfun 6487  wf 6489  cfv 6493  (class class class)co 7360   supp csupp 8104   finSupp cfsupp 9268
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5225  ax-sep 5242  ax-nul 5252  ax-pr 5378  ax-un 7682
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3062  df-reu 3352  df-rab 3401  df-v 3443  df-sbc 3742  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4287  df-if 4481  df-pw 4557  df-sn 4582  df-pr 4584  df-op 4588  df-uni 4865  df-iun 4949  df-br 5100  df-opab 5162  df-mpt 5181  df-tr 5207  df-id 5520  df-eprel 5525  df-po 5533  df-so 5534  df-fr 5578  df-we 5580  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  df-ord 6321  df-on 6322  df-lim 6323  df-suc 6324  df-iota 6449  df-fun 6495  df-fn 6496  df-f 6497  df-f1 6498  df-fo 6499  df-f1o 6500  df-fv 6501  df-ov 7363  df-oprab 7364  df-mpo 7365  df-om 7811  df-supp 8105  df-1o 8399  df-en 8888  df-fin 8891  df-fsupp 9269
This theorem is referenced by:  elrgspnlem1  33326  elrgspnlem2  33327  evlextv  33709  fldextrspunlsplem  33832
  Copyright terms: Public domain W3C validator