Theorem fisuppov1 33276

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

Step	Hyp	Ref	Expression
1		fisuppov1.3	. . . 4 ⊢ (𝜑 → 𝐴 ∈ 𝑊)
2		fisuppov1.4	. . . 4 ⊢ (𝜑 → 𝐷 ⊆ 𝐴)
3	1, 2	ssexd 5285	. . 3 ⊢ (𝜑 → 𝐷 ∈ V)
4	3	mptexd 7230	. 2 ⊢ (𝜑 → (𝑥 ∈ 𝐷 ↦ ((𝐹‘𝑥)𝑂𝐵)) ∈ V)
5		fisuppov1.1	. 2 ⊢ (𝜑 → 𝑍 ∈ 𝑉)
6		funmpt 6578	. . 3 ⊢ Fun (𝑥 ∈ 𝐷 ↦ ((𝐹‘𝑥)𝑂𝐵))
7	6	a1i 11	. 2 ⊢ (𝜑 → Fun (𝑥 ∈ 𝐷 ↦ ((𝐹‘𝑥)𝑂𝐵)))
8		fisuppov1.7	. 2 ⊢ (𝜑 → 𝐹 finSupp 0 )
9		fisuppov1.6	. . . . . 6 ⊢ (𝜑 → 𝐹:𝐴⟶𝐸)
10	9, 2	feqresmpt 6954	. . . . 5 ⊢ (𝜑 → (𝐹 ↾ 𝐷) = (𝑥 ∈ 𝐷 ↦ (𝐹‘𝑥)))
11	10	oveq1d 7435	. . . 4 ⊢ (𝜑 → ((𝐹 ↾ 𝐷) supp 0 ) = ((𝑥 ∈ 𝐷 ↦ (𝐹‘𝑥)) supp 0 ))
12	9, 1	fexd 7233	. . . . 5 ⊢ (𝜑 → 𝐹 ∈ V)
13		fisuppov1.2	. . . . 5 ⊢ (𝜑 → 0 ∈ 𝑋)
14		ressuppss 8200	. . . . 5 ⊢ ((𝐹 ∈ V ∧ 0 ∈ 𝑋) → ((𝐹 ↾ 𝐷) supp 0 ) ⊆ (𝐹 supp 0 ))
15	12, 13, 14	syl2anc 596	. . . 4 ⊢ (𝜑 → ((𝐹 ↾ 𝐷) supp 0 ) ⊆ (𝐹 supp 0 ))
16	11, 15	eqsstrrd 3943	. . 3 ⊢ (𝜑 → ((𝑥 ∈ 𝐷 ↦ (𝐹‘𝑥)) supp 0 ) ⊆ (𝐹 supp 0 ))
17		fisuppov1.8	. . 3 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑌) → ( 0 𝑂𝑦) = 𝑍)
18		fvexd 6900	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → (𝐹‘𝑥) ∈ V)
19		fisuppov1.5	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → 𝐵 ∈ 𝑌)
20	16, 17, 18, 19, 13	suppssov1 8214	. 2 ⊢ (𝜑 → ((𝑥 ∈ 𝐷 ↦ ((𝐹‘𝑥)𝑂𝐵)) supp 𝑍) ⊆ (𝐹 supp 0 ))
21	4, 5, 7, 8, 20	fsuppsssuppgd 9374	1 ⊢ (𝜑 → (𝑥 ∈ 𝐷 ↦ ((𝐹‘𝑥)𝑂𝐵)) finSupp 𝑍)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2144  Vcvv 3450   ⊆ wss 3895   class class class wbr 5102   ↦ cmpt 5185   ↾ cres 5652  Fun wfun 6532  ⟶wf 6534  ‘cfv 6538  (class class class)co 7420   supp csupp 8177   finSupp cfsupp 9353

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pr 5390  ax-un 7751

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  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 3739  df-csb 3847  df-ss 3896  df-pss 4014  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5545  df-eprel 5550  df-po 5558  df-so 5559  df-fr 5603  df-we 5605  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-ov 7423  df-oprab 7424  df-mpo 7425  df-om 7878  df-supp 8178  df-1o 8476  df-en 8974  df-fin 8977  df-fsupp 9354

This theorem is used by:  elrgspnlem1  33803  elrgspnlem2  33804  selvply1rhmlemb  34151  evlextv  34174  fldextrspunlsplem  34305