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 32779
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 5273 . . 3 (𝜑𝐷 ∈ V)
43mptexd 7182 . 2 (𝜑 → (𝑥𝐷 ↦ ((𝐹𝑥)𝑂𝐵)) ∈ V)
5 fisuppov1.1 . 2 (𝜑𝑍𝑉)
6 funmpt 6540 . . 3 Fun (𝑥𝐷 ↦ ((𝐹𝑥)𝑂𝐵))
76a1i 11 . 2 (𝜑 → Fun (𝑥𝐷 ↦ ((𝐹𝑥)𝑂𝐵)))
8 fisuppov1.7 . 2 (𝜑𝐹 finSupp 0 )
9 fisuppov1.6 . . . . . 6 (𝜑𝐹:𝐴𝐸)
109, 2feqresmpt 6913 . . . . 5 (𝜑 → (𝐹𝐷) = (𝑥𝐷 ↦ (𝐹𝑥)))
1110oveq1d 7385 . . . 4 (𝜑 → ((𝐹𝐷) supp 0 ) = ((𝑥𝐷 ↦ (𝐹𝑥)) supp 0 ))
129, 1fexd 7185 . . . . 5 (𝜑𝐹 ∈ V)
13 fisuppov1.2 . . . . 5 (𝜑0𝑋)
14 ressuppss 8137 . . . . 5 ((𝐹 ∈ V ∧ 0𝑋) → ((𝐹𝐷) supp 0 ) ⊆ (𝐹 supp 0 ))
1512, 13, 14syl2anc 585 . . . 4 (𝜑 → ((𝐹𝐷) supp 0 ) ⊆ (𝐹 supp 0 ))
1611, 15eqsstrrd 3971 . . 3 (𝜑 → ((𝑥𝐷 ↦ (𝐹𝑥)) supp 0 ) ⊆ (𝐹 supp 0 ))
17 fisuppov1.8 . . 3 ((𝜑𝑦𝑌) → ( 0 𝑂𝑦) = 𝑍)
18 fvexd 6859 . . 3 ((𝜑𝑥𝐷) → (𝐹𝑥) ∈ V)
19 fisuppov1.5 . . 3 ((𝜑𝑥𝐷) → 𝐵𝑌)
2016, 17, 18, 19, 13suppssov1 8151 . 2 (𝜑 → ((𝑥𝐷 ↦ ((𝐹𝑥)𝑂𝐵)) supp 𝑍) ⊆ (𝐹 supp 0 ))
214, 5, 7, 8, 20fsuppsssuppgd 9299 1 (𝜑 → (𝑥𝐷 ↦ ((𝐹𝑥)𝑂𝐵)) finSupp 𝑍)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1542  wcel 2114  Vcvv 3442  wss 3903   class class class wbr 5100  cmpt 5181  cres 5636  Fun wfun 6496  wf 6498  cfv 6502  (class class class)co 7370   supp csupp 8114   finSupp cfsupp 9278
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 5226  ax-sep 5245  ax-nul 5255  ax-pr 5381  ax-un 7692
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 3063  df-reu 3353  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-iun 4950  df-br 5101  df-opab 5163  df-mpt 5182  df-tr 5208  df-id 5529  df-eprel 5534  df-po 5542  df-so 5543  df-fr 5587  df-we 5589  df-xp 5640  df-rel 5641  df-cnv 5642  df-co 5643  df-dm 5644  df-rn 5645  df-res 5646  df-ima 5647  df-ord 6330  df-on 6331  df-lim 6332  df-suc 6333  df-iota 6458  df-fun 6504  df-fn 6505  df-f 6506  df-f1 6507  df-fo 6508  df-f1o 6509  df-fv 6510  df-ov 7373  df-oprab 7374  df-mpo 7375  df-om 7821  df-supp 8115  df-1o 8409  df-en 8898  df-fin 8901  df-fsupp 9279
This theorem is referenced by:  elrgspnlem1  33342  elrgspnlem2  33343  evlextv  33725  fldextrspunlsplem  33857
  Copyright terms: Public domain W3C validator