Theorem extmptsuppeq 8118

Description: The support of an extended function is the same as the original. (Contributed by Mario Carneiro, 25-May-2015.) (Revised by AV, 30-Jun-2019.)

Hypotheses

Ref	Expression
extmptsuppeq.b	⊢ (𝜑 → 𝐵 ∈ 𝑊)
extmptsuppeq.a	⊢ (𝜑 → 𝐴 ⊆ 𝐵)
extmptsuppeq.z	⊢ ((𝜑 ∧ 𝑛 ∈ (𝐵 ∖ 𝐴)) → 𝑋 = 𝑍)

Assertion

Ref	Expression
extmptsuppeq	⊢ (𝜑 → ((𝑛 ∈ 𝐴 ↦ 𝑋) supp 𝑍) = ((𝑛 ∈ 𝐵 ↦ 𝑋) supp 𝑍))

Distinct variable groups:   𝐴,𝑛   𝐵,𝑛   𝑛,𝑍   𝜑,𝑛

Allowed substitution hints:   𝑊(𝑛)   𝑋(𝑛)

Proof of Theorem extmptsuppeq

Step	Hyp	Ref	Expression
1		extmptsuppeq.a	. . . . . . . . 9 ⊢ (𝜑 → 𝐴 ⊆ 𝐵)
2	1	adantl 481	. . . . . . . 8 ⊢ ((𝑍 ∈ V ∧ 𝜑) → 𝐴 ⊆ 𝐵)
3	2	sseld 3933	. . . . . . 7 ⊢ ((𝑍 ∈ V ∧ 𝜑) → (𝑛 ∈ 𝐴 → 𝑛 ∈ 𝐵))
4	3	anim1d 611	. . . . . 6 ⊢ ((𝑍 ∈ V ∧ 𝜑) → ((𝑛 ∈ 𝐴 ∧ 𝑋 ∈ (V ∖ {𝑍})) → (𝑛 ∈ 𝐵 ∧ 𝑋 ∈ (V ∖ {𝑍}))))
5		eldif 3912	. . . . . . . . . . . . 13 ⊢ (𝑛 ∈ (𝐵 ∖ 𝐴) ↔ (𝑛 ∈ 𝐵 ∧ ¬ 𝑛 ∈ 𝐴))
6		extmptsuppeq.z	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑛 ∈ (𝐵 ∖ 𝐴)) → 𝑋 = 𝑍)
7	6	adantll 714	. . . . . . . . . . . . 13 ⊢ (((𝑍 ∈ V ∧ 𝜑) ∧ 𝑛 ∈ (𝐵 ∖ 𝐴)) → 𝑋 = 𝑍)
8	5, 7	sylan2br 595	. . . . . . . . . . . 12 ⊢ (((𝑍 ∈ V ∧ 𝜑) ∧ (𝑛 ∈ 𝐵 ∧ ¬ 𝑛 ∈ 𝐴)) → 𝑋 = 𝑍)
9	8	expr 456	. . . . . . . . . . 11 ⊢ (((𝑍 ∈ V ∧ 𝜑) ∧ 𝑛 ∈ 𝐵) → (¬ 𝑛 ∈ 𝐴 → 𝑋 = 𝑍))
10		elsn2g 4617	. . . . . . . . . . . . 13 ⊢ (𝑍 ∈ V → (𝑋 ∈ {𝑍} ↔ 𝑋 = 𝑍))
11		elndif 4083	. . . . . . . . . . . . 13 ⊢ (𝑋 ∈ {𝑍} → ¬ 𝑋 ∈ (V ∖ {𝑍}))
12	10, 11	biimtrrdi 254	. . . . . . . . . . . 12 ⊢ (𝑍 ∈ V → (𝑋 = 𝑍 → ¬ 𝑋 ∈ (V ∖ {𝑍})))
13	12	ad2antrr 726	. . . . . . . . . . 11 ⊢ (((𝑍 ∈ V ∧ 𝜑) ∧ 𝑛 ∈ 𝐵) → (𝑋 = 𝑍 → ¬ 𝑋 ∈ (V ∖ {𝑍})))
14	9, 13	syld 47	. . . . . . . . . 10 ⊢ (((𝑍 ∈ V ∧ 𝜑) ∧ 𝑛 ∈ 𝐵) → (¬ 𝑛 ∈ 𝐴 → ¬ 𝑋 ∈ (V ∖ {𝑍})))
15	14	con4d 115	. . . . . . . . 9 ⊢ (((𝑍 ∈ V ∧ 𝜑) ∧ 𝑛 ∈ 𝐵) → (𝑋 ∈ (V ∖ {𝑍}) → 𝑛 ∈ 𝐴))
16	15	impr 454	. . . . . . . 8 ⊢ (((𝑍 ∈ V ∧ 𝜑) ∧ (𝑛 ∈ 𝐵 ∧ 𝑋 ∈ (V ∖ {𝑍}))) → 𝑛 ∈ 𝐴)
17		simprr 772	. . . . . . . 8 ⊢ (((𝑍 ∈ V ∧ 𝜑) ∧ (𝑛 ∈ 𝐵 ∧ 𝑋 ∈ (V ∖ {𝑍}))) → 𝑋 ∈ (V ∖ {𝑍}))
18	16, 17	jca 511	. . . . . . 7 ⊢ (((𝑍 ∈ V ∧ 𝜑) ∧ (𝑛 ∈ 𝐵 ∧ 𝑋 ∈ (V ∖ {𝑍}))) → (𝑛 ∈ 𝐴 ∧ 𝑋 ∈ (V ∖ {𝑍})))
19	18	ex 412	. . . . . 6 ⊢ ((𝑍 ∈ V ∧ 𝜑) → ((𝑛 ∈ 𝐵 ∧ 𝑋 ∈ (V ∖ {𝑍})) → (𝑛 ∈ 𝐴 ∧ 𝑋 ∈ (V ∖ {𝑍}))))
20	4, 19	impbid 212	. . . . 5 ⊢ ((𝑍 ∈ V ∧ 𝜑) → ((𝑛 ∈ 𝐴 ∧ 𝑋 ∈ (V ∖ {𝑍})) ↔ (𝑛 ∈ 𝐵 ∧ 𝑋 ∈ (V ∖ {𝑍}))))
21	20	rabbidva2 3397	. . . 4 ⊢ ((𝑍 ∈ V ∧ 𝜑) → {𝑛 ∈ 𝐴 ∣ 𝑋 ∈ (V ∖ {𝑍})} = {𝑛 ∈ 𝐵 ∣ 𝑋 ∈ (V ∖ {𝑍})})
22		eqid 2731	. . . . 5 ⊢ (𝑛 ∈ 𝐴 ↦ 𝑋) = (𝑛 ∈ 𝐴 ↦ 𝑋)
23		extmptsuppeq.b	. . . . . . 7 ⊢ (𝜑 → 𝐵 ∈ 𝑊)
24	23, 1	ssexd 5262	. . . . . 6 ⊢ (𝜑 → 𝐴 ∈ V)
25	24	adantl 481	. . . . 5 ⊢ ((𝑍 ∈ V ∧ 𝜑) → 𝐴 ∈ V)
26		simpl 482	. . . . 5 ⊢ ((𝑍 ∈ V ∧ 𝜑) → 𝑍 ∈ V)
27	22, 25, 26	mptsuppdifd 8116	. . . 4 ⊢ ((𝑍 ∈ V ∧ 𝜑) → ((𝑛 ∈ 𝐴 ↦ 𝑋) supp 𝑍) = {𝑛 ∈ 𝐴 ∣ 𝑋 ∈ (V ∖ {𝑍})})
28		eqid 2731	. . . . 5 ⊢ (𝑛 ∈ 𝐵 ↦ 𝑋) = (𝑛 ∈ 𝐵 ↦ 𝑋)
29	23	adantl 481	. . . . 5 ⊢ ((𝑍 ∈ V ∧ 𝜑) → 𝐵 ∈ 𝑊)
30	28, 29, 26	mptsuppdifd 8116	. . . 4 ⊢ ((𝑍 ∈ V ∧ 𝜑) → ((𝑛 ∈ 𝐵 ↦ 𝑋) supp 𝑍) = {𝑛 ∈ 𝐵 ∣ 𝑋 ∈ (V ∖ {𝑍})})
31	21, 27, 30	3eqtr4d 2776	. . 3 ⊢ ((𝑍 ∈ V ∧ 𝜑) → ((𝑛 ∈ 𝐴 ↦ 𝑋) supp 𝑍) = ((𝑛 ∈ 𝐵 ↦ 𝑋) supp 𝑍))
32	31	ex 412	. 2 ⊢ (𝑍 ∈ V → (𝜑 → ((𝑛 ∈ 𝐴 ↦ 𝑋) supp 𝑍) = ((𝑛 ∈ 𝐵 ↦ 𝑋) supp 𝑍)))
33		simpr 484	. . . . 5 ⊢ (((𝑛 ∈ 𝐴 ↦ 𝑋) ∈ V ∧ 𝑍 ∈ V) → 𝑍 ∈ V)
34		supp0prc 8093	. . . . 5 ⊢ (¬ ((𝑛 ∈ 𝐴 ↦ 𝑋) ∈ V ∧ 𝑍 ∈ V) → ((𝑛 ∈ 𝐴 ↦ 𝑋) supp 𝑍) = ∅)
35	33, 34	nsyl5 159	. . . 4 ⊢ (¬ 𝑍 ∈ V → ((𝑛 ∈ 𝐴 ↦ 𝑋) supp 𝑍) = ∅)
36		simpr 484	. . . . 5 ⊢ (((𝑛 ∈ 𝐵 ↦ 𝑋) ∈ V ∧ 𝑍 ∈ V) → 𝑍 ∈ V)
37		supp0prc 8093	. . . . 5 ⊢ (¬ ((𝑛 ∈ 𝐵 ↦ 𝑋) ∈ V ∧ 𝑍 ∈ V) → ((𝑛 ∈ 𝐵 ↦ 𝑋) supp 𝑍) = ∅)
38	36, 37	nsyl5 159	. . . 4 ⊢ (¬ 𝑍 ∈ V → ((𝑛 ∈ 𝐵 ↦ 𝑋) supp 𝑍) = ∅)
39	35, 38	eqtr4d 2769	. . 3 ⊢ (¬ 𝑍 ∈ V → ((𝑛 ∈ 𝐴 ↦ 𝑋) supp 𝑍) = ((𝑛 ∈ 𝐵 ↦ 𝑋) supp 𝑍))
40	39	a1d 25	. 2 ⊢ (¬ 𝑍 ∈ V → (𝜑 → ((𝑛 ∈ 𝐴 ↦ 𝑋) supp 𝑍) = ((𝑛 ∈ 𝐵 ↦ 𝑋) supp 𝑍)))
41	32, 40	pm2.61i 182	1 ⊢ (𝜑 → ((𝑛 ∈ 𝐴 ↦ 𝑋) supp 𝑍) = ((𝑛 ∈ 𝐵 ↦ 𝑋) supp 𝑍))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 395   = wceq 1541   ∈ wcel 2111  {crab 3395  Vcvv 3436   ∖ cdif 3899   ⊆ wss 3902  ∅c0 4283  {csn 4576   ↦ cmpt 5172  (class class class)co 7346   supp csupp 8090

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-10 2144  ax-11 2160  ax-12 2180  ax-ext 2703  ax-rep 5217  ax-sep 5234  ax-nul 5244  ax-pr 5370  ax-un 7668

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2535  df-eu 2564  df-clab 2710  df-cleq 2723  df-clel 2806  df-nfc 2881  df-ne 2929  df-ral 3048  df-rex 3057  df-reu 3347  df-rab 3396  df-v 3438  df-sbc 3742  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4284  df-if 4476  df-pw 4552  df-sn 4577  df-pr 4579  df-op 4583  df-uni 4860  df-iun 4943  df-br 5092  df-opab 5154  df-mpt 5173  df-id 5511  df-xp 5622  df-rel 5623  df-cnv 5624  df-co 5625  df-dm 5626  df-rn 5627  df-res 5628  df-ima 5629  df-iota 6437  df-fun 6483  df-fn 6484  df-f 6485  df-f1 6486  df-fo 6487  df-f1o 6488  df-fv 6489  df-ov 7349  df-oprab 7350  df-mpo 7351  df-supp 8091

This theorem is referenced by:  cantnfrescl  9566  cantnfres  9567