Theorem ressuppssdif 8127

Description: The support of the restriction of a function is a subset of the support of the function itself. (Contributed by AV, 22-Apr-2019.)

Assertion

Ref	Expression
ressuppssdif	⊢ ((𝐹 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) → (𝐹 supp 𝑍) ⊆ (((𝐹 ↾ 𝐵) supp 𝑍) ∪ (dom 𝐹 ∖ 𝐵)))

Proof of Theorem ressuppssdif

Dummy variables 𝑥 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eldif 3910	. . . . . 6 ⊢ (𝑥 ∈ ({𝑧 ∈ dom 𝐹 ∣ (𝐹 “ {𝑧}) ≠ {𝑍}} ∖ {𝑧 ∈ dom (𝐹 ↾ 𝐵) ∣ ((𝐹 ↾ 𝐵) “ {𝑧}) ≠ {𝑍}}) ↔ (𝑥 ∈ {𝑧 ∈ dom 𝐹 ∣ (𝐹 “ {𝑧}) ≠ {𝑍}} ∧ ¬ 𝑥 ∈ {𝑧 ∈ dom (𝐹 ↾ 𝐵) ∣ ((𝐹 ↾ 𝐵) “ {𝑧}) ≠ {𝑍}}))
2		sneq 4589	. . . . . . . . . 10 ⊢ (𝑧 = 𝑥 → {𝑧} = {𝑥})
3	2	imaeq2d 6018	. . . . . . . . 9 ⊢ (𝑧 = 𝑥 → (𝐹 “ {𝑧}) = (𝐹 “ {𝑥}))
4	3	neeq1d 2990	. . . . . . . 8 ⊢ (𝑧 = 𝑥 → ((𝐹 “ {𝑧}) ≠ {𝑍} ↔ (𝐹 “ {𝑥}) ≠ {𝑍}))
5	4	elrab 3645	. . . . . . 7 ⊢ (𝑥 ∈ {𝑧 ∈ dom 𝐹 ∣ (𝐹 “ {𝑧}) ≠ {𝑍}} ↔ (𝑥 ∈ dom 𝐹 ∧ (𝐹 “ {𝑥}) ≠ {𝑍}))
6		ianor 984	. . . . . . . 8 ⊢ (¬ (𝑥 ∈ dom (𝐹 ↾ 𝐵) ∧ ((𝐹 ↾ 𝐵) “ {𝑥}) ≠ {𝑍}) ↔ (¬ 𝑥 ∈ dom (𝐹 ↾ 𝐵) ∨ ¬ ((𝐹 ↾ 𝐵) “ {𝑥}) ≠ {𝑍}))
7	2	imaeq2d 6018	. . . . . . . . . 10 ⊢ (𝑧 = 𝑥 → ((𝐹 ↾ 𝐵) “ {𝑧}) = ((𝐹 ↾ 𝐵) “ {𝑥}))
8	7	neeq1d 2990	. . . . . . . . 9 ⊢ (𝑧 = 𝑥 → (((𝐹 ↾ 𝐵) “ {𝑧}) ≠ {𝑍} ↔ ((𝐹 ↾ 𝐵) “ {𝑥}) ≠ {𝑍}))
9	8	elrab 3645	. . . . . . . 8 ⊢ (𝑥 ∈ {𝑧 ∈ dom (𝐹 ↾ 𝐵) ∣ ((𝐹 ↾ 𝐵) “ {𝑧}) ≠ {𝑍}} ↔ (𝑥 ∈ dom (𝐹 ↾ 𝐵) ∧ ((𝐹 ↾ 𝐵) “ {𝑥}) ≠ {𝑍}))
10	6, 9	xchnxbir 333	. . . . . . 7 ⊢ (¬ 𝑥 ∈ {𝑧 ∈ dom (𝐹 ↾ 𝐵) ∣ ((𝐹 ↾ 𝐵) “ {𝑧}) ≠ {𝑍}} ↔ (¬ 𝑥 ∈ dom (𝐹 ↾ 𝐵) ∨ ¬ ((𝐹 ↾ 𝐵) “ {𝑥}) ≠ {𝑍}))
11		ianor 984	. . . . . . . . . . 11 ⊢ (¬ (𝑥 ∈ 𝐵 ∧ 𝑥 ∈ dom 𝐹) ↔ (¬ 𝑥 ∈ 𝐵 ∨ ¬ 𝑥 ∈ dom 𝐹))
12		dmres 5970	. . . . . . . . . . . 12 ⊢ dom (𝐹 ↾ 𝐵) = (𝐵 ∩ dom 𝐹)
13	12	elin2 4154	. . . . . . . . . . 11 ⊢ (𝑥 ∈ dom (𝐹 ↾ 𝐵) ↔ (𝑥 ∈ 𝐵 ∧ 𝑥 ∈ dom 𝐹))
14	11, 13	xchnxbir 333	. . . . . . . . . 10 ⊢ (¬ 𝑥 ∈ dom (𝐹 ↾ 𝐵) ↔ (¬ 𝑥 ∈ 𝐵 ∨ ¬ 𝑥 ∈ dom 𝐹))
15		simpl 482	. . . . . . . . . . . . . . 15 ⊢ ((𝑥 ∈ dom 𝐹 ∧ (𝐹 “ {𝑥}) ≠ {𝑍}) → 𝑥 ∈ dom 𝐹)
16	15	anim2i 618	. . . . . . . . . . . . . 14 ⊢ ((¬ 𝑥 ∈ 𝐵 ∧ (𝑥 ∈ dom 𝐹 ∧ (𝐹 “ {𝑥}) ≠ {𝑍})) → (¬ 𝑥 ∈ 𝐵 ∧ 𝑥 ∈ dom 𝐹))
17	16	ancomd 461	. . . . . . . . . . . . 13 ⊢ ((¬ 𝑥 ∈ 𝐵 ∧ (𝑥 ∈ dom 𝐹 ∧ (𝐹 “ {𝑥}) ≠ {𝑍})) → (𝑥 ∈ dom 𝐹 ∧ ¬ 𝑥 ∈ 𝐵))
18		eldif 3910	. . . . . . . . . . . . 13 ⊢ (𝑥 ∈ (dom 𝐹 ∖ 𝐵) ↔ (𝑥 ∈ dom 𝐹 ∧ ¬ 𝑥 ∈ 𝐵))
19	17, 18	sylibr 234	. . . . . . . . . . . 12 ⊢ ((¬ 𝑥 ∈ 𝐵 ∧ (𝑥 ∈ dom 𝐹 ∧ (𝐹 “ {𝑥}) ≠ {𝑍})) → 𝑥 ∈ (dom 𝐹 ∖ 𝐵))
20	19	ex 412	. . . . . . . . . . 11 ⊢ (¬ 𝑥 ∈ 𝐵 → ((𝑥 ∈ dom 𝐹 ∧ (𝐹 “ {𝑥}) ≠ {𝑍}) → 𝑥 ∈ (dom 𝐹 ∖ 𝐵)))
21		pm2.24 124	. . . . . . . . . . . . 13 ⊢ (𝑥 ∈ dom 𝐹 → (¬ 𝑥 ∈ dom 𝐹 → 𝑥 ∈ (dom 𝐹 ∖ 𝐵)))
22	21	adantr 480	. . . . . . . . . . . 12 ⊢ ((𝑥 ∈ dom 𝐹 ∧ (𝐹 “ {𝑥}) ≠ {𝑍}) → (¬ 𝑥 ∈ dom 𝐹 → 𝑥 ∈ (dom 𝐹 ∖ 𝐵)))
23	22	com12 32	. . . . . . . . . . 11 ⊢ (¬ 𝑥 ∈ dom 𝐹 → ((𝑥 ∈ dom 𝐹 ∧ (𝐹 “ {𝑥}) ≠ {𝑍}) → 𝑥 ∈ (dom 𝐹 ∖ 𝐵)))
24	20, 23	jaoi 858	. . . . . . . . . 10 ⊢ ((¬ 𝑥 ∈ 𝐵 ∨ ¬ 𝑥 ∈ dom 𝐹) → ((𝑥 ∈ dom 𝐹 ∧ (𝐹 “ {𝑥}) ≠ {𝑍}) → 𝑥 ∈ (dom 𝐹 ∖ 𝐵)))
25	14, 24	sylbi 217	. . . . . . . . 9 ⊢ (¬ 𝑥 ∈ dom (𝐹 ↾ 𝐵) → ((𝑥 ∈ dom 𝐹 ∧ (𝐹 “ {𝑥}) ≠ {𝑍}) → 𝑥 ∈ (dom 𝐹 ∖ 𝐵)))
26	15	adantl 481	. . . . . . . . . . 11 ⊢ ((¬ ((𝐹 ↾ 𝐵) “ {𝑥}) ≠ {𝑍} ∧ (𝑥 ∈ dom 𝐹 ∧ (𝐹 “ {𝑥}) ≠ {𝑍})) → 𝑥 ∈ dom 𝐹)
27		snssi 4763	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑥 ∈ 𝐵 → {𝑥} ⊆ 𝐵)
28	27	adantl 481	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑥 ∈ dom 𝐹 ∧ 𝑥 ∈ 𝐵) → {𝑥} ⊆ 𝐵)
29		resima2 5974	. . . . . . . . . . . . . . . . . . . 20 ⊢ ({𝑥} ⊆ 𝐵 → ((𝐹 ↾ 𝐵) “ {𝑥}) = (𝐹 “ {𝑥}))
30	28, 29	syl 17	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑥 ∈ dom 𝐹 ∧ 𝑥 ∈ 𝐵) → ((𝐹 ↾ 𝐵) “ {𝑥}) = (𝐹 “ {𝑥}))
31	30	eqcomd 2741	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑥 ∈ dom 𝐹 ∧ 𝑥 ∈ 𝐵) → (𝐹 “ {𝑥}) = ((𝐹 ↾ 𝐵) “ {𝑥}))
32	31	adantr 480	. . . . . . . . . . . . . . . . 17 ⊢ (((𝑥 ∈ dom 𝐹 ∧ 𝑥 ∈ 𝐵) ∧ ((𝐹 ↾ 𝐵) “ {𝑥}) = {𝑍}) → (𝐹 “ {𝑥}) = ((𝐹 ↾ 𝐵) “ {𝑥}))
33		simpr 484	. . . . . . . . . . . . . . . . 17 ⊢ (((𝑥 ∈ dom 𝐹 ∧ 𝑥 ∈ 𝐵) ∧ ((𝐹 ↾ 𝐵) “ {𝑥}) = {𝑍}) → ((𝐹 ↾ 𝐵) “ {𝑥}) = {𝑍})
34	32, 33	eqtrd 2770	. . . . . . . . . . . . . . . 16 ⊢ (((𝑥 ∈ dom 𝐹 ∧ 𝑥 ∈ 𝐵) ∧ ((𝐹 ↾ 𝐵) “ {𝑥}) = {𝑍}) → (𝐹 “ {𝑥}) = {𝑍})
35	34	ex 412	. . . . . . . . . . . . . . 15 ⊢ ((𝑥 ∈ dom 𝐹 ∧ 𝑥 ∈ 𝐵) → (((𝐹 ↾ 𝐵) “ {𝑥}) = {𝑍} → (𝐹 “ {𝑥}) = {𝑍}))
36	35	necon3d 2952	. . . . . . . . . . . . . 14 ⊢ ((𝑥 ∈ dom 𝐹 ∧ 𝑥 ∈ 𝐵) → ((𝐹 “ {𝑥}) ≠ {𝑍} → ((𝐹 ↾ 𝐵) “ {𝑥}) ≠ {𝑍}))
37	36	impancom 451	. . . . . . . . . . . . 13 ⊢ ((𝑥 ∈ dom 𝐹 ∧ (𝐹 “ {𝑥}) ≠ {𝑍}) → (𝑥 ∈ 𝐵 → ((𝐹 ↾ 𝐵) “ {𝑥}) ≠ {𝑍}))
38	37	con3d 152	. . . . . . . . . . . 12 ⊢ ((𝑥 ∈ dom 𝐹 ∧ (𝐹 “ {𝑥}) ≠ {𝑍}) → (¬ ((𝐹 ↾ 𝐵) “ {𝑥}) ≠ {𝑍} → ¬ 𝑥 ∈ 𝐵))
39	38	impcom 407	. . . . . . . . . . 11 ⊢ ((¬ ((𝐹 ↾ 𝐵) “ {𝑥}) ≠ {𝑍} ∧ (𝑥 ∈ dom 𝐹 ∧ (𝐹 “ {𝑥}) ≠ {𝑍})) → ¬ 𝑥 ∈ 𝐵)
40	26, 39	eldifd 3911	. . . . . . . . . 10 ⊢ ((¬ ((𝐹 ↾ 𝐵) “ {𝑥}) ≠ {𝑍} ∧ (𝑥 ∈ dom 𝐹 ∧ (𝐹 “ {𝑥}) ≠ {𝑍})) → 𝑥 ∈ (dom 𝐹 ∖ 𝐵))
41	40	ex 412	. . . . . . . . 9 ⊢ (¬ ((𝐹 ↾ 𝐵) “ {𝑥}) ≠ {𝑍} → ((𝑥 ∈ dom 𝐹 ∧ (𝐹 “ {𝑥}) ≠ {𝑍}) → 𝑥 ∈ (dom 𝐹 ∖ 𝐵)))
42	25, 41	jaoi 858	. . . . . . . 8 ⊢ ((¬ 𝑥 ∈ dom (𝐹 ↾ 𝐵) ∨ ¬ ((𝐹 ↾ 𝐵) “ {𝑥}) ≠ {𝑍}) → ((𝑥 ∈ dom 𝐹 ∧ (𝐹 “ {𝑥}) ≠ {𝑍}) → 𝑥 ∈ (dom 𝐹 ∖ 𝐵)))
43	42	impcom 407	. . . . . . 7 ⊢ (((𝑥 ∈ dom 𝐹 ∧ (𝐹 “ {𝑥}) ≠ {𝑍}) ∧ (¬ 𝑥 ∈ dom (𝐹 ↾ 𝐵) ∨ ¬ ((𝐹 ↾ 𝐵) “ {𝑥}) ≠ {𝑍})) → 𝑥 ∈ (dom 𝐹 ∖ 𝐵))
44	5, 10, 43	syl2anb 599	. . . . . 6 ⊢ ((𝑥 ∈ {𝑧 ∈ dom 𝐹 ∣ (𝐹 “ {𝑧}) ≠ {𝑍}} ∧ ¬ 𝑥 ∈ {𝑧 ∈ dom (𝐹 ↾ 𝐵) ∣ ((𝐹 ↾ 𝐵) “ {𝑧}) ≠ {𝑍}}) → 𝑥 ∈ (dom 𝐹 ∖ 𝐵))
45	1, 44	sylbi 217	. . . . 5 ⊢ (𝑥 ∈ ({𝑧 ∈ dom 𝐹 ∣ (𝐹 “ {𝑧}) ≠ {𝑍}} ∖ {𝑧 ∈ dom (𝐹 ↾ 𝐵) ∣ ((𝐹 ↾ 𝐵) “ {𝑧}) ≠ {𝑍}}) → 𝑥 ∈ (dom 𝐹 ∖ 𝐵))
46	45	a1i 11	. . . 4 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) → (𝑥 ∈ ({𝑧 ∈ dom 𝐹 ∣ (𝐹 “ {𝑧}) ≠ {𝑍}} ∖ {𝑧 ∈ dom (𝐹 ↾ 𝐵) ∣ ((𝐹 ↾ 𝐵) “ {𝑧}) ≠ {𝑍}}) → 𝑥 ∈ (dom 𝐹 ∖ 𝐵)))
47	46	ssrdv 3938	. . 3 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) → ({𝑧 ∈ dom 𝐹 ∣ (𝐹 “ {𝑧}) ≠ {𝑍}} ∖ {𝑧 ∈ dom (𝐹 ↾ 𝐵) ∣ ((𝐹 ↾ 𝐵) “ {𝑧}) ≠ {𝑍}}) ⊆ (dom 𝐹 ∖ 𝐵))
48		ssundif 4439	. . 3 ⊢ ({𝑧 ∈ dom 𝐹 ∣ (𝐹 “ {𝑧}) ≠ {𝑍}} ⊆ ({𝑧 ∈ dom (𝐹 ↾ 𝐵) ∣ ((𝐹 ↾ 𝐵) “ {𝑧}) ≠ {𝑍}} ∪ (dom 𝐹 ∖ 𝐵)) ↔ ({𝑧 ∈ dom 𝐹 ∣ (𝐹 “ {𝑧}) ≠ {𝑍}} ∖ {𝑧 ∈ dom (𝐹 ↾ 𝐵) ∣ ((𝐹 ↾ 𝐵) “ {𝑧}) ≠ {𝑍}}) ⊆ (dom 𝐹 ∖ 𝐵))
49	47, 48	sylibr 234	. 2 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) → {𝑧 ∈ dom 𝐹 ∣ (𝐹 “ {𝑧}) ≠ {𝑍}} ⊆ ({𝑧 ∈ dom (𝐹 ↾ 𝐵) ∣ ((𝐹 ↾ 𝐵) “ {𝑧}) ≠ {𝑍}} ∪ (dom 𝐹 ∖ 𝐵)))
50		suppval 8104	. 2 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) → (𝐹 supp 𝑍) = {𝑧 ∈ dom 𝐹 ∣ (𝐹 “ {𝑧}) ≠ {𝑍}})
51		resexg 5985	. . . 4 ⊢ (𝐹 ∈ 𝑉 → (𝐹 ↾ 𝐵) ∈ V)
52		suppval 8104	. . . 4 ⊢ (((𝐹 ↾ 𝐵) ∈ V ∧ 𝑍 ∈ 𝑊) → ((𝐹 ↾ 𝐵) supp 𝑍) = {𝑧 ∈ dom (𝐹 ↾ 𝐵) ∣ ((𝐹 ↾ 𝐵) “ {𝑧}) ≠ {𝑍}})
53	51, 52	sylan 581	. . 3 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) → ((𝐹 ↾ 𝐵) supp 𝑍) = {𝑧 ∈ dom (𝐹 ↾ 𝐵) ∣ ((𝐹 ↾ 𝐵) “ {𝑧}) ≠ {𝑍}})
54	53	uneq1d 4118	. 2 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) → (((𝐹 ↾ 𝐵) supp 𝑍) ∪ (dom 𝐹 ∖ 𝐵)) = ({𝑧 ∈ dom (𝐹 ↾ 𝐵) ∣ ((𝐹 ↾ 𝐵) “ {𝑧}) ≠ {𝑍}} ∪ (dom 𝐹 ∖ 𝐵)))
55	49, 50, 54	3sstr4d 3988	1 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝑍 ∈ 𝑊) → (𝐹 supp 𝑍) ⊆ (((𝐹 ↾ 𝐵) supp 𝑍) ∪ (dom 𝐹 ∖ 𝐵)))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 395   ∨ wo 848   = wceq 1542   ∈ wcel 2114   ≠ wne 2931  {crab 3398  Vcvv 3439   ∖ cdif 3897   ∪ cun 3898   ⊆ wss 3900  {csn 4579  dom cdm 5623   ↾ cres 5625   “ cima 5626  (class class class)co 7358   supp csupp 8102

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2183  ax-ext 2707  ax-sep 5240  ax-nul 5250  ax-pr 5376  ax-un 7680

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2538  df-eu 2568  df-clab 2714  df-cleq 2727  df-clel 2810  df-nfc 2884  df-ne 2932  df-ral 3051  df-rex 3060  df-rab 3399  df-v 3441  df-sbc 3740  df-dif 3903  df-un 3905  df-in 3907  df-ss 3917  df-nul 4285  df-if 4479  df-pw 4555  df-sn 4580  df-pr 4582  df-op 4586  df-uni 4863  df-br 5098  df-opab 5160  df-id 5518  df-xp 5629  df-rel 5630  df-cnv 5631  df-co 5632  df-dm 5633  df-rn 5634  df-res 5635  df-ima 5636  df-iota 6447  df-fun 6493  df-fv 6499  df-ov 7361  df-oprab 7362  df-mpo 7363  df-supp 8103

This theorem is referenced by:  ressuppfi  9300