Theorem elfvmptrab1 7010

Description: Implications for the value of a function defined by the maps-to notation with a class abstraction as a result having an element. Here, the base set of the class abstraction depends on the argument of the function. Usage of this theorem is discouraged because it depends on ax-13 2401. Use the weaker elfvmptrab1w 7009 when possible. (Contributed by Alexander van der Vekens, 15-Jul-2018.) (New usage is discouraged.)

Hypotheses

Ref	Expression
elfvmptrab1.f	⊢ 𝐹 = (𝑥 ∈ 𝑉 ↦ {𝑦 ∈ ⦋𝑥 / 𝑚⦌𝑀 ∣ 𝜑})
elfvmptrab1.v	⊢ (𝑋 ∈ 𝑉 → ⦋𝑋 / 𝑚⦌𝑀 ∈ V)

Assertion

Ref	Expression
elfvmptrab1	⊢ (𝑌 ∈ (𝐹‘𝑋) → (𝑋 ∈ 𝑉 ∧ 𝑌 ∈ ⦋𝑋 / 𝑚⦌𝑀))

Distinct variable groups:   𝑥,𝑀,𝑦   𝑥,𝑉   𝑥,𝑋,𝑦   𝑦,𝑌   𝑦,𝑚

Allowed substitution hints:   𝜑(𝑥, 𝑦, 𝑚)   𝐹(𝑥, 𝑦, 𝑚)   𝑀(𝑚)   𝑉(𝑦, 𝑚)   𝑋(𝑚)   𝑌(𝑥, 𝑚)

Proof of Theorem elfvmptrab1

Step	Hyp	Ref	Expression
1		ne0i 4286	. . 3 ⊢ (𝑌 ∈ (𝐹‘𝑋) → (𝐹‘𝑋) ≠ ∅)
2		ndmfv 6905	. . . 4 ⊢ (¬ 𝑋 ∈ dom 𝐹 → (𝐹‘𝑋) = ∅)
3	2	necon1ai 2982	. . 3 ⊢ ((𝐹‘𝑋) ≠ ∅ → 𝑋 ∈ dom 𝐹)
4		elfvmptrab1.f	. . . . . . . 8 ⊢ 𝐹 = (𝑥 ∈ 𝑉 ↦ {𝑦 ∈ ⦋𝑥 / 𝑚⦌𝑀 ∣ 𝜑})
5	4	dmmptss 6231	. . . . . . 7 ⊢ dom 𝐹 ⊆ 𝑉
6	5	sseli 3926	. . . . . 6 ⊢ (𝑋 ∈ dom 𝐹 → 𝑋 ∈ 𝑉)
7		elfvmptrab1.v	. . . . . . 7 ⊢ (𝑋 ∈ 𝑉 → ⦋𝑋 / 𝑚⦌𝑀 ∈ V)
8		rabexg 5298	. . . . . . 7 ⊢ (⦋𝑋 / 𝑚⦌𝑀 ∈ V → {𝑦 ∈ ⦋𝑋 / 𝑚⦌𝑀 ∣ [𝑋 / 𝑥]𝜑} ∈ V)
9	6, 7, 8	3syl 19	. . . . . 6 ⊢ (𝑋 ∈ dom 𝐹 → {𝑦 ∈ ⦋𝑋 / 𝑚⦌𝑀 ∣ [𝑋 / 𝑥]𝜑} ∈ V)
10		nfcv 2922	. . . . . . 7 ⊢ Ⅎ𝑥𝑋
11		nfsbc1v 3758	. . . . . . . 8 ⊢ Ⅎ𝑥[𝑋 / 𝑥]𝜑
12		nfcv 2922	. . . . . . . . 9 ⊢ Ⅎ𝑥𝑀
13	10, 12	nfcsb 3873	. . . . . . . 8 ⊢ Ⅎ𝑥⦋𝑋 / 𝑚⦌𝑀
14	11, 13	nfrabw 3447	. . . . . . 7 ⊢ Ⅎ𝑥{𝑦 ∈ ⦋𝑋 / 𝑚⦌𝑀 ∣ [𝑋 / 𝑥]𝜑}
15		csbeq1 3849	. . . . . . . 8 ⊢ (𝑥 = 𝑋 → ⦋𝑥 / 𝑚⦌𝑀 = ⦋𝑋 / 𝑚⦌𝑀)
16		sbceq1a 3749	. . . . . . . 8 ⊢ (𝑥 = 𝑋 → (𝜑 ↔ [𝑋 / 𝑥]𝜑))
17	15, 16	rabeqbidv 3429	. . . . . . 7 ⊢ (𝑥 = 𝑋 → {𝑦 ∈ ⦋𝑥 / 𝑚⦌𝑀 ∣ 𝜑} = {𝑦 ∈ ⦋𝑋 / 𝑚⦌𝑀 ∣ [𝑋 / 𝑥]𝜑})
18	10, 14, 17, 4	fvmptf 7003	. . . . . 6 ⊢ ((𝑋 ∈ 𝑉 ∧ {𝑦 ∈ ⦋𝑋 / 𝑚⦌𝑀 ∣ [𝑋 / 𝑥]𝜑} ∈ V) → (𝐹‘𝑋) = {𝑦 ∈ ⦋𝑋 / 𝑚⦌𝑀 ∣ [𝑋 / 𝑥]𝜑})
19	6, 9, 18	syl2anc 596	. . . . 5 ⊢ (𝑋 ∈ dom 𝐹 → (𝐹‘𝑋) = {𝑦 ∈ ⦋𝑋 / 𝑚⦌𝑀 ∣ [𝑋 / 𝑥]𝜑})
20	19	eleq2d 2846	. . . 4 ⊢ (𝑋 ∈ dom 𝐹 → (𝑌 ∈ (𝐹‘𝑋) ↔ 𝑌 ∈ {𝑦 ∈ ⦋𝑋 / 𝑚⦌𝑀 ∣ [𝑋 / 𝑥]𝜑}))
21		elrabi 3640	. . . . . 6 ⊢ (𝑌 ∈ {𝑦 ∈ ⦋𝑋 / 𝑚⦌𝑀 ∣ [𝑋 / 𝑥]𝜑} → 𝑌 ∈ ⦋𝑋 / 𝑚⦌𝑀)
22	6, 21	anim12i 625	. . . . 5 ⊢ ((𝑋 ∈ dom 𝐹 ∧ 𝑌 ∈ {𝑦 ∈ ⦋𝑋 / 𝑚⦌𝑀 ∣ [𝑋 / 𝑥]𝜑}) → (𝑋 ∈ 𝑉 ∧ 𝑌 ∈ ⦋𝑋 / 𝑚⦌𝑀))
23	22	ex 418	. . . 4 ⊢ (𝑋 ∈ dom 𝐹 → (𝑌 ∈ {𝑦 ∈ ⦋𝑋 / 𝑚⦌𝑀 ∣ [𝑋 / 𝑥]𝜑} → (𝑋 ∈ 𝑉 ∧ 𝑌 ∈ ⦋𝑋 / 𝑚⦌𝑀)))
24	20, 23	sylbid 243	. . 3 ⊢ (𝑋 ∈ dom 𝐹 → (𝑌 ∈ (𝐹‘𝑋) → (𝑋 ∈ 𝑉 ∧ 𝑌 ∈ ⦋𝑋 / 𝑚⦌𝑀)))
25	1, 3, 24	3syl 19	. 2 ⊢ (𝑌 ∈ (𝐹‘𝑋) → (𝑌 ∈ (𝐹‘𝑋) → (𝑋 ∈ 𝑉 ∧ 𝑌 ∈ ⦋𝑋 / 𝑚⦌𝑀)))
26	25	pm2.43i 53	1 ⊢ (𝑌 ∈ (𝐹‘𝑋) → (𝑋 ∈ 𝑉 ∧ 𝑌 ∈ ⦋𝑋 / 𝑚⦌𝑀))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145   ≠ wne 2955  {crab 3412  Vcvv 3450  [wsbc 3738  ⦋csb 3846  ∅c0 4278   ↦ cmpt 5185  dom cdm 5647  ‘cfv 6527

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-13 2401  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5390

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 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5542  df-xp 5653  df-rel 5654  df-cnv 5655  df-co 5656  df-dm 5657  df-rn 5658  df-res 5659  df-ima 5660  df-iota 6483  df-fun 6529  df-fv 6535

This theorem is used by: (None)