Theorem suppofssd 8220

Description: Condition for the support of a function operation to be a subset of the union of the supports of the left and right function terms. (Contributed by Steven Nguyen, 28-Aug-2023.)

Hypotheses

Ref	Expression
suppofssd.1	⊢ (𝜑 → 𝐴 ∈ 𝑉)
suppofssd.2	⊢ (𝜑 → 𝑍 ∈ 𝐵)
suppofssd.3	⊢ (𝜑 → 𝐹:𝐴⟶𝐵)
suppofssd.4	⊢ (𝜑 → 𝐺:𝐴⟶𝐵)
suppofssd.5	⊢ (𝜑 → (𝑍𝑋𝑍) = 𝑍)

Assertion

Ref	Expression
suppofssd	⊢ (𝜑 → ((𝐹 ∘f 𝑋𝐺) supp 𝑍) ⊆ ((𝐹 supp 𝑍) ∪ (𝐺 supp 𝑍)))

Proof of Theorem suppofssd

Dummy variables 𝑥 𝑦 𝑘 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ovexd 7455	. . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥𝑋𝑦) ∈ V)
2		suppofssd.3	. . 3 ⊢ (𝜑 → 𝐹:𝐴⟶𝐵)
3		suppofssd.4	. . 3 ⊢ (𝜑 → 𝐺:𝐴⟶𝐵)
4		suppofssd.1	. . 3 ⊢ (𝜑 → 𝐴 ∈ 𝑉)
5		inidm 4172	. . 3 ⊢ (𝐴 ∩ 𝐴) = 𝐴
6	1, 2, 3, 4, 4, 5	off 7711	. 2 ⊢ (𝜑 → (𝐹 ∘f 𝑋𝐺):𝐴⟶V)
7		eldif 3909	. . . 4 ⊢ (𝑘 ∈ (𝐴 ∖ ((𝐹 supp 𝑍) ∪ (𝐺 supp 𝑍))) ↔ (𝑘 ∈ 𝐴 ∧ ¬ 𝑘 ∈ ((𝐹 supp 𝑍) ∪ (𝐺 supp 𝑍))))
8		ioran 999	. . . . . 6 ⊢ (¬ (𝑘 ∈ (𝐹 supp 𝑍) ∨ 𝑘 ∈ (𝐺 supp 𝑍)) ↔ (¬ 𝑘 ∈ (𝐹 supp 𝑍) ∧ ¬ 𝑘 ∈ (𝐺 supp 𝑍)))
9		elun 4100	. . . . . 6 ⊢ (𝑘 ∈ ((𝐹 supp 𝑍) ∪ (𝐺 supp 𝑍)) ↔ (𝑘 ∈ (𝐹 supp 𝑍) ∨ 𝑘 ∈ (𝐺 supp 𝑍)))
10	8, 9	xchnxbir 336	. . . . 5 ⊢ (¬ 𝑘 ∈ ((𝐹 supp 𝑍) ∪ (𝐺 supp 𝑍)) ↔ (¬ 𝑘 ∈ (𝐹 supp 𝑍) ∧ ¬ 𝑘 ∈ (𝐺 supp 𝑍)))
11	10	anbi2i 635	. . . 4 ⊢ ((𝑘 ∈ 𝐴 ∧ ¬ 𝑘 ∈ ((𝐹 supp 𝑍) ∪ (𝐺 supp 𝑍))) ↔ (𝑘 ∈ 𝐴 ∧ (¬ 𝑘 ∈ (𝐹 supp 𝑍) ∧ ¬ 𝑘 ∈ (𝐺 supp 𝑍))))
12	7, 11	bitri 278	. . 3 ⊢ (𝑘 ∈ (𝐴 ∖ ((𝐹 supp 𝑍) ∪ (𝐺 supp 𝑍))) ↔ (𝑘 ∈ 𝐴 ∧ (¬ 𝑘 ∈ (𝐹 supp 𝑍) ∧ ¬ 𝑘 ∈ (𝐺 supp 𝑍))))
13	2	ffnd 6710	. . . . . . . . . 10 ⊢ (𝜑 → 𝐹 Fn 𝐴)
14		suppofssd.2	. . . . . . . . . 10 ⊢ (𝜑 → 𝑍 ∈ 𝐵)
15		elsuppfn 8187	. . . . . . . . . 10 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝑉 ∧ 𝑍 ∈ 𝐵) → (𝑘 ∈ (𝐹 supp 𝑍) ↔ (𝑘 ∈ 𝐴 ∧ (𝐹‘𝑘) ≠ 𝑍)))
16	13, 4, 14, 15	syl3anc 1398	. . . . . . . . 9 ⊢ (𝜑 → (𝑘 ∈ (𝐹 supp 𝑍) ↔ (𝑘 ∈ 𝐴 ∧ (𝐹‘𝑘) ≠ 𝑍)))
17	16	notbid 321	. . . . . . . 8 ⊢ (𝜑 → (¬ 𝑘 ∈ (𝐹 supp 𝑍) ↔ ¬ (𝑘 ∈ 𝐴 ∧ (𝐹‘𝑘) ≠ 𝑍)))
18	17	biimpd 232	. . . . . . 7 ⊢ (𝜑 → (¬ 𝑘 ∈ (𝐹 supp 𝑍) → ¬ (𝑘 ∈ 𝐴 ∧ (𝐹‘𝑘) ≠ 𝑍)))
19	3	ffnd 6710	. . . . . . . . . 10 ⊢ (𝜑 → 𝐺 Fn 𝐴)
20		elsuppfn 8187	. . . . . . . . . 10 ⊢ ((𝐺 Fn 𝐴 ∧ 𝐴 ∈ 𝑉 ∧ 𝑍 ∈ 𝐵) → (𝑘 ∈ (𝐺 supp 𝑍) ↔ (𝑘 ∈ 𝐴 ∧ (𝐺‘𝑘) ≠ 𝑍)))
21	19, 4, 14, 20	syl3anc 1398	. . . . . . . . 9 ⊢ (𝜑 → (𝑘 ∈ (𝐺 supp 𝑍) ↔ (𝑘 ∈ 𝐴 ∧ (𝐺‘𝑘) ≠ 𝑍)))
22	21	notbid 321	. . . . . . . 8 ⊢ (𝜑 → (¬ 𝑘 ∈ (𝐺 supp 𝑍) ↔ ¬ (𝑘 ∈ 𝐴 ∧ (𝐺‘𝑘) ≠ 𝑍)))
23	22	biimpd 232	. . . . . . 7 ⊢ (𝜑 → (¬ 𝑘 ∈ (𝐺 supp 𝑍) → ¬ (𝑘 ∈ 𝐴 ∧ (𝐺‘𝑘) ≠ 𝑍)))
24	18, 23	anim12d 621	. . . . . 6 ⊢ (𝜑 → ((¬ 𝑘 ∈ (𝐹 supp 𝑍) ∧ ¬ 𝑘 ∈ (𝐺 supp 𝑍)) → (¬ (𝑘 ∈ 𝐴 ∧ (𝐹‘𝑘) ≠ 𝑍) ∧ ¬ (𝑘 ∈ 𝐴 ∧ (𝐺‘𝑘) ≠ 𝑍))))
25	24	anim2d 624	. . . . 5 ⊢ (𝜑 → ((𝑘 ∈ 𝐴 ∧ (¬ 𝑘 ∈ (𝐹 supp 𝑍) ∧ ¬ 𝑘 ∈ (𝐺 supp 𝑍))) → (𝑘 ∈ 𝐴 ∧ (¬ (𝑘 ∈ 𝐴 ∧ (𝐹‘𝑘) ≠ 𝑍) ∧ ¬ (𝑘 ∈ 𝐴 ∧ (𝐺‘𝑘) ≠ 𝑍)))))
26	25	imp 412	. . . 4 ⊢ ((𝜑 ∧ (𝑘 ∈ 𝐴 ∧ (¬ 𝑘 ∈ (𝐹 supp 𝑍) ∧ ¬ 𝑘 ∈ (𝐺 supp 𝑍)))) → (𝑘 ∈ 𝐴 ∧ (¬ (𝑘 ∈ 𝐴 ∧ (𝐹‘𝑘) ≠ 𝑍) ∧ ¬ (𝑘 ∈ 𝐴 ∧ (𝐺‘𝑘) ≠ 𝑍))))
27		pm3.2 475	. . . . . . . 8 ⊢ (𝑘 ∈ 𝐴 → ((𝐹‘𝑘) ≠ 𝑍 → (𝑘 ∈ 𝐴 ∧ (𝐹‘𝑘) ≠ 𝑍)))
28	27	necon1bd 2974	. . . . . . 7 ⊢ (𝑘 ∈ 𝐴 → (¬ (𝑘 ∈ 𝐴 ∧ (𝐹‘𝑘) ≠ 𝑍) → (𝐹‘𝑘) = 𝑍))
29		pm3.2 475	. . . . . . . 8 ⊢ (𝑘 ∈ 𝐴 → ((𝐺‘𝑘) ≠ 𝑍 → (𝑘 ∈ 𝐴 ∧ (𝐺‘𝑘) ≠ 𝑍)))
30	29	necon1bd 2974	. . . . . . 7 ⊢ (𝑘 ∈ 𝐴 → (¬ (𝑘 ∈ 𝐴 ∧ (𝐺‘𝑘) ≠ 𝑍) → (𝐺‘𝑘) = 𝑍))
31	28, 30	anim12d 621	. . . . . 6 ⊢ (𝑘 ∈ 𝐴 → ((¬ (𝑘 ∈ 𝐴 ∧ (𝐹‘𝑘) ≠ 𝑍) ∧ ¬ (𝑘 ∈ 𝐴 ∧ (𝐺‘𝑘) ≠ 𝑍)) → ((𝐹‘𝑘) = 𝑍 ∧ (𝐺‘𝑘) = 𝑍)))
32	31	imdistani 579	. . . . 5 ⊢ ((𝑘 ∈ 𝐴 ∧ (¬ (𝑘 ∈ 𝐴 ∧ (𝐹‘𝑘) ≠ 𝑍) ∧ ¬ (𝑘 ∈ 𝐴 ∧ (𝐺‘𝑘) ≠ 𝑍))) → (𝑘 ∈ 𝐴 ∧ ((𝐹‘𝑘) = 𝑍 ∧ (𝐺‘𝑘) = 𝑍)))
33	13	adantr 486	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑘 ∈ 𝐴 ∧ ((𝐹‘𝑘) = 𝑍 ∧ (𝐺‘𝑘) = 𝑍))) → 𝐹 Fn 𝐴)
34	19	adantr 486	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑘 ∈ 𝐴 ∧ ((𝐹‘𝑘) = 𝑍 ∧ (𝐺‘𝑘) = 𝑍))) → 𝐺 Fn 𝐴)
35	4	adantr 486	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑘 ∈ 𝐴 ∧ ((𝐹‘𝑘) = 𝑍 ∧ (𝐺‘𝑘) = 𝑍))) → 𝐴 ∈ 𝑉)
36		simprl 783	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑘 ∈ 𝐴 ∧ ((𝐹‘𝑘) = 𝑍 ∧ (𝐺‘𝑘) = 𝑍))) → 𝑘 ∈ 𝐴)
37		fnfvof 7710	. . . . . . 7 ⊢ (((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) ∧ (𝐴 ∈ 𝑉 ∧ 𝑘 ∈ 𝐴)) → ((𝐹 ∘f 𝑋𝐺)‘𝑘) = ((𝐹‘𝑘)𝑋(𝐺‘𝑘)))
38	33, 34, 35, 36, 37	syl22anc 852	. . . . . 6 ⊢ ((𝜑 ∧ (𝑘 ∈ 𝐴 ∧ ((𝐹‘𝑘) = 𝑍 ∧ (𝐺‘𝑘) = 𝑍))) → ((𝐹 ∘f 𝑋𝐺)‘𝑘) = ((𝐹‘𝑘)𝑋(𝐺‘𝑘)))
39		oveq12 7429	. . . . . . 7 ⊢ (((𝐹‘𝑘) = 𝑍 ∧ (𝐺‘𝑘) = 𝑍) → ((𝐹‘𝑘)𝑋(𝐺‘𝑘)) = (𝑍𝑋𝑍))
40	39	ad2antll 742	. . . . . 6 ⊢ ((𝜑 ∧ (𝑘 ∈ 𝐴 ∧ ((𝐹‘𝑘) = 𝑍 ∧ (𝐺‘𝑘) = 𝑍))) → ((𝐹‘𝑘)𝑋(𝐺‘𝑘)) = (𝑍𝑋𝑍))
41		suppofssd.5	. . . . . . 7 ⊢ (𝜑 → (𝑍𝑋𝑍) = 𝑍)
42	41	adantr 486	. . . . . 6 ⊢ ((𝜑 ∧ (𝑘 ∈ 𝐴 ∧ ((𝐹‘𝑘) = 𝑍 ∧ (𝐺‘𝑘) = 𝑍))) → (𝑍𝑋𝑍) = 𝑍)
43	38, 40, 42	3eqtrd 2800	. . . . 5 ⊢ ((𝜑 ∧ (𝑘 ∈ 𝐴 ∧ ((𝐹‘𝑘) = 𝑍 ∧ (𝐺‘𝑘) = 𝑍))) → ((𝐹 ∘f 𝑋𝐺)‘𝑘) = 𝑍)
44	32, 43	sylan2 605	. . . 4 ⊢ ((𝜑 ∧ (𝑘 ∈ 𝐴 ∧ (¬ (𝑘 ∈ 𝐴 ∧ (𝐹‘𝑘) ≠ 𝑍) ∧ ¬ (𝑘 ∈ 𝐴 ∧ (𝐺‘𝑘) ≠ 𝑍)))) → ((𝐹 ∘f 𝑋𝐺)‘𝑘) = 𝑍)
45	26, 44	syldan 603	. . 3 ⊢ ((𝜑 ∧ (𝑘 ∈ 𝐴 ∧ (¬ 𝑘 ∈ (𝐹 supp 𝑍) ∧ ¬ 𝑘 ∈ (𝐺 supp 𝑍)))) → ((𝐹 ∘f 𝑋𝐺)‘𝑘) = 𝑍)
46	12, 45	sylan2b 606	. 2 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝐴 ∖ ((𝐹 supp 𝑍) ∪ (𝐺 supp 𝑍)))) → ((𝐹 ∘f 𝑋𝐺)‘𝑘) = 𝑍)
47	6, 46	suppss 8211	1 ⊢ (𝜑 → ((𝐹 ∘f 𝑋𝐺) supp 𝑍) ⊆ ((𝐹 supp 𝑍) ∪ (𝐺 supp 𝑍)))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∨ wo 861   = wceq 1570   ∈ wcel 2145   ≠ wne 2956  Vcvv 3451   ∖ cdif 3896   ∪ cun 3897   ⊆ wss 3899   Fn wfn 6533  ⟶wf 6534  ‘cfv 6538  (class class class)co 7420   ∘_f cof 7691   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-of 7693  df-supp 8178

This theorem is used by:  psrbagaddcl  22232  mhpmulcl  22470  mhpaddcl  22472  naddcnff  44363