Theorem suppssov2 8215

Description: Formula building theorem for support restrictions: operator with right annihilator. (Contributed by SN, 11-Apr-2025.)

Hypotheses

Ref	Expression
suppssov2.s	⊢ (𝜑 → ((𝑥 ∈ 𝐷 ↦ 𝐵) supp 𝑌) ⊆ 𝐿)
suppssov2.o	⊢ ((𝜑 ∧ 𝑣 ∈ 𝑅) → (𝑣𝑂𝑌) = 𝑍)
suppssov2.a	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → 𝐴 ∈ 𝑅)
suppssov2.b	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → 𝐵 ∈ 𝑉)
suppssov2.y	⊢ (𝜑 → 𝑌 ∈ 𝑊)

Assertion

Ref	Expression
suppssov2	⊢ (𝜑 → ((𝑥 ∈ 𝐷 ↦ (𝐴𝑂𝐵)) supp 𝑍) ⊆ 𝐿)

Distinct variable groups:   𝜑,𝑣   𝜑,𝑥   𝑣,𝐴   𝑥,𝐷   𝑣,𝑂   𝑣,𝑅   𝑣,𝑌   𝑥,𝑌   𝑣,𝑍   𝑥,𝑍

Allowed substitution hints:   𝐴(𝑥)   𝐵(𝑥, 𝑣)   𝐷(𝑣)   𝑅(𝑥)   𝐿(𝑥, 𝑣)   𝑂(𝑥)   𝑉(𝑥, 𝑣)   𝑊(𝑥, 𝑣)

Proof of Theorem suppssov2

Step	Hyp	Ref	Expression
1		suppssov2.b	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → 𝐵 ∈ 𝑉)
2	1	elexd 3474	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → 𝐵 ∈ V)
3	2	adantlr 728	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝐷 ∈ V ∧ 𝑍 ∈ V)) ∧ 𝑥 ∈ 𝐷) → 𝐵 ∈ V)
4	3	adantr 486	. . . . . . 7 ⊢ ((((𝜑 ∧ (𝐷 ∈ V ∧ 𝑍 ∈ V)) ∧ 𝑥 ∈ 𝐷) ∧ (𝐴𝑂𝐵) ∈ (V ∖ {𝑍})) → 𝐵 ∈ V)
5		oveq1 7427	. . . . . . . . . . . 12 ⊢ (𝑣 = 𝐴 → (𝑣𝑂𝑌) = (𝐴𝑂𝑌))
6	5	eqeq1d 2763	. . . . . . . . . . 11 ⊢ (𝑣 = 𝐴 → ((𝑣𝑂𝑌) = 𝑍 ↔ (𝐴𝑂𝑌) = 𝑍))
7		suppssov2.o	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑣 ∈ 𝑅) → (𝑣𝑂𝑌) = 𝑍)
8	7	ralrimiva 3155	. . . . . . . . . . . 12 ⊢ (𝜑 → ∀𝑣 ∈ 𝑅 (𝑣𝑂𝑌) = 𝑍)
9	8	ad2antrr 739	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝐷 ∈ V ∧ 𝑍 ∈ V)) ∧ 𝑥 ∈ 𝐷) → ∀𝑣 ∈ 𝑅 (𝑣𝑂𝑌) = 𝑍)
10		suppssov2.a	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → 𝐴 ∈ 𝑅)
11	10	adantlr 728	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝐷 ∈ V ∧ 𝑍 ∈ V)) ∧ 𝑥 ∈ 𝐷) → 𝐴 ∈ 𝑅)
12	6, 9, 11	rspcdva 3578	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝐷 ∈ V ∧ 𝑍 ∈ V)) ∧ 𝑥 ∈ 𝐷) → (𝐴𝑂𝑌) = 𝑍)
13		oveq2 7428	. . . . . . . . . . 11 ⊢ (𝐵 = 𝑌 → (𝐴𝑂𝐵) = (𝐴𝑂𝑌))
14	13	eqeq1d 2763	. . . . . . . . . 10 ⊢ (𝐵 = 𝑌 → ((𝐴𝑂𝐵) = 𝑍 ↔ (𝐴𝑂𝑌) = 𝑍))
15	12, 14	syl5ibrcom 250	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝐷 ∈ V ∧ 𝑍 ∈ V)) ∧ 𝑥 ∈ 𝐷) → (𝐵 = 𝑌 → (𝐴𝑂𝐵) = 𝑍))
16	15	necon3d 2977	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝐷 ∈ V ∧ 𝑍 ∈ V)) ∧ 𝑥 ∈ 𝐷) → ((𝐴𝑂𝐵) ≠ 𝑍 → 𝐵 ≠ 𝑌))
17		eldifsni 4753	. . . . . . . 8 ⊢ ((𝐴𝑂𝐵) ∈ (V ∖ {𝑍}) → (𝐴𝑂𝐵) ≠ 𝑍)
18	16, 17	impel 515	. . . . . . 7 ⊢ ((((𝜑 ∧ (𝐷 ∈ V ∧ 𝑍 ∈ V)) ∧ 𝑥 ∈ 𝐷) ∧ (𝐴𝑂𝐵) ∈ (V ∖ {𝑍})) → 𝐵 ≠ 𝑌)
19		eldifsn 4748	. . . . . . 7 ⊢ (𝐵 ∈ (V ∖ {𝑌}) ↔ (𝐵 ∈ V ∧ 𝐵 ≠ 𝑌))
20	4, 18, 19	sylanbrc 595	. . . . . 6 ⊢ ((((𝜑 ∧ (𝐷 ∈ V ∧ 𝑍 ∈ V)) ∧ 𝑥 ∈ 𝐷) ∧ (𝐴𝑂𝐵) ∈ (V ∖ {𝑍})) → 𝐵 ∈ (V ∖ {𝑌}))
21	20	ex 418	. . . . 5 ⊢ (((𝜑 ∧ (𝐷 ∈ V ∧ 𝑍 ∈ V)) ∧ 𝑥 ∈ 𝐷) → ((𝐴𝑂𝐵) ∈ (V ∖ {𝑍}) → 𝐵 ∈ (V ∖ {𝑌})))
22	21	ss2rabdv 4023	. . . 4 ⊢ ((𝜑 ∧ (𝐷 ∈ V ∧ 𝑍 ∈ V)) → {𝑥 ∈ 𝐷 ∣ (𝐴𝑂𝐵) ∈ (V ∖ {𝑍})} ⊆ {𝑥 ∈ 𝐷 ∣ 𝐵 ∈ (V ∖ {𝑌})})
23		eqid 2761	. . . . 5 ⊢ (𝑥 ∈ 𝐷 ↦ (𝐴𝑂𝐵)) = (𝑥 ∈ 𝐷 ↦ (𝐴𝑂𝐵))
24		simprl 783	. . . . 5 ⊢ ((𝜑 ∧ (𝐷 ∈ V ∧ 𝑍 ∈ V)) → 𝐷 ∈ V)
25		simprr 785	. . . . 5 ⊢ ((𝜑 ∧ (𝐷 ∈ V ∧ 𝑍 ∈ V)) → 𝑍 ∈ V)
26	23, 24, 25	mptsuppdifd 8203	. . . 4 ⊢ ((𝜑 ∧ (𝐷 ∈ V ∧ 𝑍 ∈ V)) → ((𝑥 ∈ 𝐷 ↦ (𝐴𝑂𝐵)) supp 𝑍) = {𝑥 ∈ 𝐷 ∣ (𝐴𝑂𝐵) ∈ (V ∖ {𝑍})})
27		eqid 2761	. . . . 5 ⊢ (𝑥 ∈ 𝐷 ↦ 𝐵) = (𝑥 ∈ 𝐷 ↦ 𝐵)
28		suppssov2.y	. . . . . 6 ⊢ (𝜑 → 𝑌 ∈ 𝑊)
29	28	adantr 486	. . . . 5 ⊢ ((𝜑 ∧ (𝐷 ∈ V ∧ 𝑍 ∈ V)) → 𝑌 ∈ 𝑊)
30	27, 24, 29	mptsuppdifd 8203	. . . 4 ⊢ ((𝜑 ∧ (𝐷 ∈ V ∧ 𝑍 ∈ V)) → ((𝑥 ∈ 𝐷 ↦ 𝐵) supp 𝑌) = {𝑥 ∈ 𝐷 ∣ 𝐵 ∈ (V ∖ {𝑌})})
31	22, 26, 30	3sstr4d 3986	. . 3 ⊢ ((𝜑 ∧ (𝐷 ∈ V ∧ 𝑍 ∈ V)) → ((𝑥 ∈ 𝐷 ↦ (𝐴𝑂𝐵)) supp 𝑍) ⊆ ((𝑥 ∈ 𝐷 ↦ 𝐵) supp 𝑌))
32		suppssov2.s	. . . 4 ⊢ (𝜑 → ((𝑥 ∈ 𝐷 ↦ 𝐵) supp 𝑌) ⊆ 𝐿)
33	32	adantr 486	. . 3 ⊢ ((𝜑 ∧ (𝐷 ∈ V ∧ 𝑍 ∈ V)) → ((𝑥 ∈ 𝐷 ↦ 𝐵) supp 𝑌) ⊆ 𝐿)
34	31, 33	sstrd 3941	. 2 ⊢ ((𝜑 ∧ (𝐷 ∈ V ∧ 𝑍 ∈ V)) → ((𝑥 ∈ 𝐷 ↦ (𝐴𝑂𝐵)) supp 𝑍) ⊆ 𝐿)
35		mptexg 7227	. . . . . . 7 ⊢ (𝐷 ∈ V → (𝑥 ∈ 𝐷 ↦ (𝐴𝑂𝐵)) ∈ V)
36		ovex 7453	. . . . . . . . . 10 ⊢ (𝐴𝑂𝐵) ∈ V
37	36	rgenw 3081	. . . . . . . . 9 ⊢ ∀𝑥 ∈ 𝐷 (𝐴𝑂𝐵) ∈ V
38		dmmptg 6243	. . . . . . . . 9 ⊢ (∀𝑥 ∈ 𝐷 (𝐴𝑂𝐵) ∈ V → dom (𝑥 ∈ 𝐷 ↦ (𝐴𝑂𝐵)) = 𝐷)
39	37, 38	ax-mp 5	. . . . . . . 8 ⊢ dom (𝑥 ∈ 𝐷 ↦ (𝐴𝑂𝐵)) = 𝐷
40		dmexg 7913	. . . . . . . 8 ⊢ ((𝑥 ∈ 𝐷 ↦ (𝐴𝑂𝐵)) ∈ V → dom (𝑥 ∈ 𝐷 ↦ (𝐴𝑂𝐵)) ∈ V)
41	39, 40	eqeltrrid 2866	. . . . . . 7 ⊢ ((𝑥 ∈ 𝐷 ↦ (𝐴𝑂𝐵)) ∈ V → 𝐷 ∈ V)
42	35, 41	impbii 212	. . . . . 6 ⊢ (𝐷 ∈ V ↔ (𝑥 ∈ 𝐷 ↦ (𝐴𝑂𝐵)) ∈ V)
43	42	anbi1i 636	. . . . 5 ⊢ ((𝐷 ∈ V ∧ 𝑍 ∈ V) ↔ ((𝑥 ∈ 𝐷 ↦ (𝐴𝑂𝐵)) ∈ V ∧ 𝑍 ∈ V))
44		supp0prc 8180	. . . . 5 ⊢ (¬ ((𝑥 ∈ 𝐷 ↦ (𝐴𝑂𝐵)) ∈ V ∧ 𝑍 ∈ V) → ((𝑥 ∈ 𝐷 ↦ (𝐴𝑂𝐵)) supp 𝑍) = ∅)
45	43, 44	sylnbi 333	. . . 4 ⊢ (¬ (𝐷 ∈ V ∧ 𝑍 ∈ V) → ((𝑥 ∈ 𝐷 ↦ (𝐴𝑂𝐵)) supp 𝑍) = ∅)
46		0ss 4350	. . . 4 ⊢ ∅ ⊆ 𝐿
47	45, 46	eqsstrdi 3975	. . 3 ⊢ (¬ (𝐷 ∈ V ∧ 𝑍 ∈ V) → ((𝑥 ∈ 𝐷 ↦ (𝐴𝑂𝐵)) supp 𝑍) ⊆ 𝐿)
48	47	adantl 487	. 2 ⊢ ((𝜑 ∧ ¬ (𝐷 ∈ V ∧ 𝑍 ∈ V)) → ((𝑥 ∈ 𝐷 ↦ (𝐴𝑂𝐵)) supp 𝑍) ⊆ 𝐿)
49	34, 48	pm2.61dan 825	1 ⊢ (𝜑 → ((𝑥 ∈ 𝐷 ↦ (𝐴𝑂𝐵)) supp 𝑍) ⊆ 𝐿)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145   ≠ wne 2956  ∀wral 3077  {crab 3413  Vcvv 3451   ∖ cdif 3896   ⊆ wss 3899  ∅c0 4279  {csn 4584   ↦ cmpt 5186  dom cdm 5651  (class class class)co 7420   supp csupp 8177

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pr 5391  ax-un 7751

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  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-supp 8178

This theorem is used by:  psdmplcl  22483