Theorem fvmptss 6960

Description: If all the values of the mapping are subsets of a class 𝐶, then so is any evaluation of the mapping, even if 𝐷 is not in the base set 𝐴. (Contributed by Mario Carneiro, 13-Feb-2015.)

Hypothesis

Ref	Expression
mptrcl.1	⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐵)

Assertion

Ref	Expression
fvmptss	⊢ (∀𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶 → (𝐹‘𝐷) ⊆ 𝐶)

Distinct variable groups:   𝑥,𝐴   𝑥,𝐶

Allowed substitution hints:   𝐵(𝑥)   𝐷(𝑥)   𝐹(𝑥)

Proof of Theorem fvmptss

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		mptrcl.1	. . . . 5 ⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐵)
2	1	dmmptss 6193	. . . 4 ⊢ dom 𝐹 ⊆ 𝐴
3	2	sseli 3940	. . 3 ⊢ (𝐷 ∈ dom 𝐹 → 𝐷 ∈ 𝐴)
4		fveq2 6842	. . . . . . 7 ⊢ (𝑦 = 𝐷 → (𝐹‘𝑦) = (𝐹‘𝐷))
5	4	sseq1d 3975	. . . . . 6 ⊢ (𝑦 = 𝐷 → ((𝐹‘𝑦) ⊆ 𝐶 ↔ (𝐹‘𝐷) ⊆ 𝐶))
6	5	imbi2d 340	. . . . 5 ⊢ (𝑦 = 𝐷 → ((∀𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶 → (𝐹‘𝑦) ⊆ 𝐶) ↔ (∀𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶 → (𝐹‘𝐷) ⊆ 𝐶)))
7		nfcv 2907	. . . . . 6 ⊢ Ⅎ𝑥𝑦
8		nfra1 3267	. . . . . . 7 ⊢ Ⅎ𝑥∀𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶
9		nfmpt1 5213	. . . . . . . . . 10 ⊢ Ⅎ𝑥(𝑥 ∈ 𝐴 ↦ 𝐵)
10	1, 9	nfcxfr 2905	. . . . . . . . 9 ⊢ Ⅎ𝑥𝐹
11	10, 7	nffv 6852	. . . . . . . 8 ⊢ Ⅎ𝑥(𝐹‘𝑦)
12		nfcv 2907	. . . . . . . 8 ⊢ Ⅎ𝑥𝐶
13	11, 12	nfss 3936	. . . . . . 7 ⊢ Ⅎ𝑥(𝐹‘𝑦) ⊆ 𝐶
14	8, 13	nfim 1899	. . . . . 6 ⊢ Ⅎ𝑥(∀𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶 → (𝐹‘𝑦) ⊆ 𝐶)
15		fveq2 6842	. . . . . . . 8 ⊢ (𝑥 = 𝑦 → (𝐹‘𝑥) = (𝐹‘𝑦))
16	15	sseq1d 3975	. . . . . . 7 ⊢ (𝑥 = 𝑦 → ((𝐹‘𝑥) ⊆ 𝐶 ↔ (𝐹‘𝑦) ⊆ 𝐶))
17	16	imbi2d 340	. . . . . 6 ⊢ (𝑥 = 𝑦 → ((∀𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶 → (𝐹‘𝑥) ⊆ 𝐶) ↔ (∀𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶 → (𝐹‘𝑦) ⊆ 𝐶)))
18	1	dmmpt 6192	. . . . . . . . . . 11 ⊢ dom 𝐹 = {𝑥 ∈ 𝐴 ∣ 𝐵 ∈ V}
19	18	reqabi 3429	. . . . . . . . . 10 ⊢ (𝑥 ∈ dom 𝐹 ↔ (𝑥 ∈ 𝐴 ∧ 𝐵 ∈ V))
20	1	fvmpt2 6959	. . . . . . . . . . 11 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝐵 ∈ V) → (𝐹‘𝑥) = 𝐵)
21		eqimss 4000	. . . . . . . . . . 11 ⊢ ((𝐹‘𝑥) = 𝐵 → (𝐹‘𝑥) ⊆ 𝐵)
22	20, 21	syl 17	. . . . . . . . . 10 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝐵 ∈ V) → (𝐹‘𝑥) ⊆ 𝐵)
23	19, 22	sylbi 216	. . . . . . . . 9 ⊢ (𝑥 ∈ dom 𝐹 → (𝐹‘𝑥) ⊆ 𝐵)
24		ndmfv 6877	. . . . . . . . . 10 ⊢ (¬ 𝑥 ∈ dom 𝐹 → (𝐹‘𝑥) = ∅)
25		0ss 4356	. . . . . . . . . 10 ⊢ ∅ ⊆ 𝐵
26	24, 25	eqsstrdi 3998	. . . . . . . . 9 ⊢ (¬ 𝑥 ∈ dom 𝐹 → (𝐹‘𝑥) ⊆ 𝐵)
27	23, 26	pm2.61i 182	. . . . . . . 8 ⊢ (𝐹‘𝑥) ⊆ 𝐵
28		rsp 3230	. . . . . . . . 9 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶 → (𝑥 ∈ 𝐴 → 𝐵 ⊆ 𝐶))
29	28	impcom 408	. . . . . . . 8 ⊢ ((𝑥 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶) → 𝐵 ⊆ 𝐶)
30	27, 29	sstrid 3955	. . . . . . 7 ⊢ ((𝑥 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶) → (𝐹‘𝑥) ⊆ 𝐶)
31	30	ex 413	. . . . . 6 ⊢ (𝑥 ∈ 𝐴 → (∀𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶 → (𝐹‘𝑥) ⊆ 𝐶))
32	7, 14, 17, 31	vtoclgaf 3533	. . . . 5 ⊢ (𝑦 ∈ 𝐴 → (∀𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶 → (𝐹‘𝑦) ⊆ 𝐶))
33	6, 32	vtoclga 3534	. . . 4 ⊢ (𝐷 ∈ 𝐴 → (∀𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶 → (𝐹‘𝐷) ⊆ 𝐶))
34	33	impcom 408	. . 3 ⊢ ((∀𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶 ∧ 𝐷 ∈ 𝐴) → (𝐹‘𝐷) ⊆ 𝐶)
35	3, 34	sylan2 593	. 2 ⊢ ((∀𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶 ∧ 𝐷 ∈ dom 𝐹) → (𝐹‘𝐷) ⊆ 𝐶)
36		ndmfv 6877	. . . 4 ⊢ (¬ 𝐷 ∈ dom 𝐹 → (𝐹‘𝐷) = ∅)
37	36	adantl 482	. . 3 ⊢ ((∀𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶 ∧ ¬ 𝐷 ∈ dom 𝐹) → (𝐹‘𝐷) = ∅)
38		0ss 4356	. . 3 ⊢ ∅ ⊆ 𝐶
39	37, 38	eqsstrdi 3998	. 2 ⊢ ((∀𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶 ∧ ¬ 𝐷 ∈ dom 𝐹) → (𝐹‘𝐷) ⊆ 𝐶)
40	35, 39	pm2.61dan 811	1 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶 → (𝐹‘𝐷) ⊆ 𝐶)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 396   = wceq 1541   ∈ wcel 2106  ∀wral 3064  Vcvv 3445   ⊆ wss 3910  ∅c0 4282   ↦ cmpt 5188  dom cdm 5633  ‘cfv 6496

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 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2707  ax-sep 5256  ax-nul 5263  ax-pr 5384

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2538  df-eu 2567  df-clab 2714  df-cleq 2728  df-clel 2814  df-nfc 2889  df-ral 3065  df-rex 3074  df-rab 3408  df-v 3447  df-sbc 3740  df-csb 3856  df-dif 3913  df-un 3915  df-in 3917  df-ss 3927  df-nul 4283  df-if 4487  df-sn 4587  df-pr 4589  df-op 4593  df-uni 4866  df-br 5106  df-opab 5168  df-mpt 5189  df-id 5531  df-xp 5639  df-rel 5640  df-cnv 5641  df-co 5642  df-dm 5643  df-rn 5644  df-res 5645  df-ima 5646  df-iota 6448  df-fun 6498  df-fv 6504

This theorem is referenced by:  relmptopab  7603  ovmptss  8025