Theorem suppofssd 8195

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 7445	. . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥𝑋𝑦) ∈ V)
2		suppofssd.3	. . 3 ⊢ (𝜑 → 𝐹:𝐴⟶𝐵)
3		suppofssd.4	. . 3 ⊢ (𝜑 → 𝐺:𝐴⟶𝐵)
4		suppofssd.1	. . 3 ⊢ (𝜑 → 𝐴 ∈ 𝑉)
5		inidm 4179	. . 3 ⊢ (𝐴 ∩ 𝐴) = 𝐴
6	1, 2, 3, 4, 4, 5	off 7692	. 2 ⊢ (𝜑 → (𝐹 ∘f 𝑋𝐺):𝐴⟶V)
7		eldif 3915	. . . 4 ⊢ (𝑘 ∈ (𝐴 ∖ ((𝐹 supp 𝑍) ∪ (𝐺 supp 𝑍))) ↔ (𝑘 ∈ 𝐴 ∧ ¬ 𝑘 ∈ ((𝐹 supp 𝑍) ∪ (𝐺 supp 𝑍))))
8		ioran 999	. . . . . 6 ⊢ (¬ (𝑘 ∈ (𝐹 supp 𝑍) ∨ 𝑘 ∈ (𝐺 supp 𝑍)) ↔ (¬ 𝑘 ∈ (𝐹 supp 𝑍) ∧ ¬ 𝑘 ∈ (𝐺 supp 𝑍)))
9		elun 4107	. . . . . 6 ⊢ (𝑘 ∈ ((𝐹 supp 𝑍) ∪ (𝐺 supp 𝑍)) ↔ (𝑘 ∈ (𝐹 supp 𝑍) ∨ 𝑘 ∈ (𝐺 supp 𝑍)))
10	8, 9	xchnxbir 336	. . . . 5 ⊢ (¬ 𝑘 ∈ ((𝐹 supp 𝑍) ∪ (𝐺 supp 𝑍)) ↔ (¬ 𝑘 ∈ (𝐹 supp 𝑍) ∧ ¬ 𝑘 ∈ (𝐺 supp 𝑍)))
11	10	anbi2i 634	. . . 4 ⊢ ((𝑘 ∈ 𝐴 ∧ ¬ 𝑘 ∈ ((𝐹 supp 𝑍) ∪ (𝐺 supp 𝑍))) ↔ (𝑘 ∈ 𝐴 ∧ (¬ 𝑘 ∈ (𝐹 supp 𝑍) ∧ ¬ 𝑘 ∈ (𝐺 supp 𝑍))))
12	7, 11	bitri 278	. . 3 ⊢ (𝑘 ∈ (𝐴 ∖ ((𝐹 supp 𝑍) ∪ (𝐺 supp 𝑍))) ↔ (𝑘 ∈ 𝐴 ∧ (¬ 𝑘 ∈ (𝐹 supp 𝑍) ∧ ¬ 𝑘 ∈ (𝐺 supp 𝑍))))
13	2	ffnd 6706	. . . . . . . . . 10 ⊢ (𝜑 → 𝐹 Fn 𝐴)
14		suppofssd.2	. . . . . . . . . 10 ⊢ (𝜑 → 𝑍 ∈ 𝐵)
15		elsuppfn 8162	. . . . . . . . . 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 6706	. . . . . . . . . 10 ⊢ (𝜑 → 𝐺 Fn 𝐴)
20		elsuppfn 8162	. . . . . . . . . 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 620	. . . . . 6 ⊢ (𝜑 → ((¬ 𝑘 ∈ (𝐹 supp 𝑍) ∧ ¬ 𝑘 ∈ (𝐺 supp 𝑍)) → (¬ (𝑘 ∈ 𝐴 ∧ (𝐹‘𝑘) ≠ 𝑍) ∧ ¬ (𝑘 ∈ 𝐴 ∧ (𝐺‘𝑘) ≠ 𝑍))))
25	24	anim2d 623	. . . . 5 ⊢ (𝜑 → ((𝑘 ∈ 𝐴 ∧ (¬ 𝑘 ∈ (𝐹 supp 𝑍) ∧ ¬ 𝑘 ∈ (𝐺 supp 𝑍))) → (𝑘 ∈ 𝐴 ∧ (¬ (𝑘 ∈ 𝐴 ∧ (𝐹‘𝑘) ≠ 𝑍) ∧ ¬ (𝑘 ∈ 𝐴 ∧ (𝐺‘𝑘) ≠ 𝑍)))))
26	25	imp 411	. . . 4 ⊢ ((𝜑 ∧ (𝑘 ∈ 𝐴 ∧ (¬ 𝑘 ∈ (𝐹 supp 𝑍) ∧ ¬ 𝑘 ∈ (𝐺 supp 𝑍)))) → (𝑘 ∈ 𝐴 ∧ (¬ (𝑘 ∈ 𝐴 ∧ (𝐹‘𝑘) ≠ 𝑍) ∧ ¬ (𝑘 ∈ 𝐴 ∧ (𝐺‘𝑘) ≠ 𝑍))))
27		pm3.2 474	. . . . . . . 8 ⊢ (𝑘 ∈ 𝐴 → ((𝐹‘𝑘) ≠ 𝑍 → (𝑘 ∈ 𝐴 ∧ (𝐹‘𝑘) ≠ 𝑍)))
28	27	necon1bd 2976	. . . . . . 7 ⊢ (𝑘 ∈ 𝐴 → (¬ (𝑘 ∈ 𝐴 ∧ (𝐹‘𝑘) ≠ 𝑍) → (𝐹‘𝑘) = 𝑍))
29		pm3.2 474	. . . . . . . 8 ⊢ (𝑘 ∈ 𝐴 → ((𝐺‘𝑘) ≠ 𝑍 → (𝑘 ∈ 𝐴 ∧ (𝐺‘𝑘) ≠ 𝑍)))
30	29	necon1bd 2976	. . . . . . 7 ⊢ (𝑘 ∈ 𝐴 → (¬ (𝑘 ∈ 𝐴 ∧ (𝐺‘𝑘) ≠ 𝑍) → (𝐺‘𝑘) = 𝑍))
31	28, 30	anim12d 620	. . . . . 6 ⊢ (𝑘 ∈ 𝐴 → ((¬ (𝑘 ∈ 𝐴 ∧ (𝐹‘𝑘) ≠ 𝑍) ∧ ¬ (𝑘 ∈ 𝐴 ∧ (𝐺‘𝑘) ≠ 𝑍)) → ((𝐹‘𝑘) = 𝑍 ∧ (𝐺‘𝑘) = 𝑍)))
32	31	imdistani 578	. . . . 5 ⊢ ((𝑘 ∈ 𝐴 ∧ (¬ (𝑘 ∈ 𝐴 ∧ (𝐹‘𝑘) ≠ 𝑍) ∧ ¬ (𝑘 ∈ 𝐴 ∧ (𝐺‘𝑘) ≠ 𝑍))) → (𝑘 ∈ 𝐴 ∧ ((𝐹‘𝑘) = 𝑍 ∧ (𝐺‘𝑘) = 𝑍)))
33	13	adantr 485	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑘 ∈ 𝐴 ∧ ((𝐹‘𝑘) = 𝑍 ∧ (𝐺‘𝑘) = 𝑍))) → 𝐹 Fn 𝐴)
34	19	adantr 485	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑘 ∈ 𝐴 ∧ ((𝐹‘𝑘) = 𝑍 ∧ (𝐺‘𝑘) = 𝑍))) → 𝐺 Fn 𝐴)
35	4	adantr 485	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑘 ∈ 𝐴 ∧ ((𝐹‘𝑘) = 𝑍 ∧ (𝐺‘𝑘) = 𝑍))) → 𝐴 ∈ 𝑉)
36		simprl 782	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑘 ∈ 𝐴 ∧ ((𝐹‘𝑘) = 𝑍 ∧ (𝐺‘𝑘) = 𝑍))) → 𝑘 ∈ 𝐴)
37		fnfvof 7691	. . . . . . 7 ⊢ (((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) ∧ (𝐴 ∈ 𝑉 ∧ 𝑘 ∈ 𝐴)) → ((𝐹 ∘f 𝑋𝐺)‘𝑘) = ((𝐹‘𝑘)𝑋(𝐺‘𝑘)))
38	33, 34, 35, 36, 37	syl22anc 851	. . . . . 6 ⊢ ((𝜑 ∧ (𝑘 ∈ 𝐴 ∧ ((𝐹‘𝑘) = 𝑍 ∧ (𝐺‘𝑘) = 𝑍))) → ((𝐹 ∘f 𝑋𝐺)‘𝑘) = ((𝐹‘𝑘)𝑋(𝐺‘𝑘)))
39		oveq12 7419	. . . . . . 7 ⊢ (((𝐹‘𝑘) = 𝑍 ∧ (𝐺‘𝑘) = 𝑍) → ((𝐹‘𝑘)𝑋(𝐺‘𝑘)) = (𝑍𝑋𝑍))
40	39	ad2antll 741	. . . . . 6 ⊢ ((𝜑 ∧ (𝑘 ∈ 𝐴 ∧ ((𝐹‘𝑘) = 𝑍 ∧ (𝐺‘𝑘) = 𝑍))) → ((𝐹‘𝑘)𝑋(𝐺‘𝑘)) = (𝑍𝑋𝑍))
41		suppofssd.5	. . . . . . 7 ⊢ (𝜑 → (𝑍𝑋𝑍) = 𝑍)
42	41	adantr 485	. . . . . 6 ⊢ ((𝜑 ∧ (𝑘 ∈ 𝐴 ∧ ((𝐹‘𝑘) = 𝑍 ∧ (𝐺‘𝑘) = 𝑍))) → (𝑍𝑋𝑍) = 𝑍)
43	38, 40, 42	3eqtrd 2802	. . . . 5 ⊢ ((𝜑 ∧ (𝑘 ∈ 𝐴 ∧ ((𝐹‘𝑘) = 𝑍 ∧ (𝐺‘𝑘) = 𝑍))) → ((𝐹 ∘f 𝑋𝐺)‘𝑘) = 𝑍)
44	32, 43	sylan2 604	. . . 4 ⊢ ((𝜑 ∧ (𝑘 ∈ 𝐴 ∧ (¬ (𝑘 ∈ 𝐴 ∧ (𝐹‘𝑘) ≠ 𝑍) ∧ ¬ (𝑘 ∈ 𝐴 ∧ (𝐺‘𝑘) ≠ 𝑍)))) → ((𝐹 ∘f 𝑋𝐺)‘𝑘) = 𝑍)
45	26, 44	syldan 602	. . 3 ⊢ ((𝜑 ∧ (𝑘 ∈ 𝐴 ∧ (¬ 𝑘 ∈ (𝐹 supp 𝑍) ∧ ¬ 𝑘 ∈ (𝐺 supp 𝑍)))) → ((𝐹 ∘f 𝑋𝐺)‘𝑘) = 𝑍)
46	12, 45	sylan2b 605	. 2 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝐴 ∖ ((𝐹 supp 𝑍) ∪ (𝐺 supp 𝑍)))) → ((𝐹 ∘f 𝑋𝐺)‘𝑘) = 𝑍)
47	6, 46	suppss 8186	1 ⊢ (𝜑 → ((𝐹 ∘f 𝑋𝐺) supp 𝑍) ⊆ ((𝐹 supp 𝑍) ∪ (𝐺 supp 𝑍)))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 400   ∨ wo 860   = wceq 1570   ∈ wcel 2143   ≠ wne 2958  Vcvv 3455   ∖ cdif 3902   ∪ cun 3903   ⊆ wss 3905   Fn wfn 6531  ⟶wf 6532  ‘cfv 6536  (class class class)co 7410   ∘_f cof 7672   supp csupp 8152

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-rep 5238  ax-sep 5257  ax-nul 5269  ax-pr 5404  ax-un 7732

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-iun 4958  df-br 5110  df-opab 5174  df-mpt 5193  df-id 5556  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-ov 7413  df-oprab 7414  df-mpo 7415  df-of 7674  df-supp 8153

This theorem is used by:  psrbagaddcl  22083  mhpmulcl  22321  mhpaddcl  22323  naddcnff  44117