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 32606
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 5279 . . 3 (𝜑𝐷 ∈ V)
43mptexd 7198 . 2 (𝜑 → (𝑥𝐷 ↦ ((𝐹𝑥)𝑂𝐵)) ∈ V)
5 fisuppov1.1 . 2 (𝜑𝑍𝑉)
6 funmpt 6554 . . 3 Fun (𝑥𝐷 ↦ ((𝐹𝑥)𝑂𝐵))
76a1i 11 . 2 (𝜑 → Fun (𝑥𝐷 ↦ ((𝐹𝑥)𝑂𝐵)))
8 fisuppov1.7 . 2 (𝜑𝐹 finSupp 0 )
9 fisuppov1.6 . . . . . 6 (𝜑𝐹:𝐴𝐸)
109, 2feqresmpt 6930 . . . . 5 (𝜑 → (𝐹𝐷) = (𝑥𝐷 ↦ (𝐹𝑥)))
1110oveq1d 7402 . . . 4 (𝜑 → ((𝐹𝐷) supp 0 ) = ((𝑥𝐷 ↦ (𝐹𝑥)) supp 0 ))
129, 1fexd 7201 . . . . 5 (𝜑𝐹 ∈ V)
13 fisuppov1.2 . . . . 5 (𝜑0𝑋)
14 ressuppss 8162 . . . . 5 ((𝐹 ∈ V ∧ 0𝑋) → ((𝐹𝐷) supp 0 ) ⊆ (𝐹 supp 0 ))
1512, 13, 14syl2anc 584 . . . 4 (𝜑 → ((𝐹𝐷) supp 0 ) ⊆ (𝐹 supp 0 ))
1611, 15eqsstrrd 3982 . . 3 (𝜑 → ((𝑥𝐷 ↦ (𝐹𝑥)) supp 0 ) ⊆ (𝐹 supp 0 ))
17 fisuppov1.8 . . 3 ((𝜑𝑦𝑌) → ( 0 𝑂𝑦) = 𝑍)
18 fvexd 6873 . . 3 ((𝜑𝑥𝐷) → (𝐹𝑥) ∈ V)
19 fisuppov1.5 . . 3 ((𝜑𝑥𝐷) → 𝐵𝑌)
2016, 17, 18, 19, 13suppssov1 8176 . 2 (𝜑 → ((𝑥𝐷 ↦ ((𝐹𝑥)𝑂𝐵)) supp 𝑍) ⊆ (𝐹 supp 0 ))
214, 5, 7, 8, 20fsuppsssuppgd 9333 1 (𝜑 → (𝑥𝐷 ↦ ((𝐹𝑥)𝑂𝐵)) finSupp 𝑍)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1540  wcel 2109  Vcvv 3447  wss 3914   class class class wbr 5107  cmpt 5188  cres 5640  Fun wfun 6505  wf 6507  cfv 6511  (class class class)co 7387   supp csupp 8139   finSupp cfsupp 9312
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 5234  ax-sep 5251  ax-nul 5261  ax-pr 5387  ax-un 7711
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 3355  df-rab 3406  df-v 3449  df-sbc 3754  df-csb 3863  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-pss 3934  df-nul 4297  df-if 4489  df-pw 4565  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-iun 4957  df-br 5108  df-opab 5170  df-mpt 5189  df-tr 5215  df-id 5533  df-eprel 5538  df-po 5546  df-so 5547  df-fr 5591  df-we 5593  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-res 5650  df-ima 5651  df-ord 6335  df-on 6336  df-lim 6337  df-suc 6338  df-iota 6464  df-fun 6513  df-fn 6514  df-f 6515  df-f1 6516  df-fo 6517  df-f1o 6518  df-fv 6519  df-ov 7390  df-oprab 7391  df-mpo 7392  df-om 7843  df-supp 8140  df-1o 8434  df-en 8919  df-fin 8922  df-fsupp 9313
This theorem is referenced by:  elrgspnlem1  33193  elrgspnlem2  33194  fldextrspunlsplem  33668
  Copyright terms: Public domain W3C validator