Theorem elfvmptrab1 7045

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 2404. Use the weaker elfvmptrab1w 7044 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 4290	. . 3 ⊢ (𝑌 ∈ (𝐹‘𝑋) → (𝐹‘𝑋) ≠ ∅)
2		ndmfv 6940	. . . 4 ⊢ (¬ 𝑋 ∈ dom 𝐹 → (𝐹‘𝑋) = ∅)
3	2	necon1ai 2986	. . 3 ⊢ ((𝐹‘𝑋) ≠ ∅ → 𝑋 ∈ dom 𝐹)
4		elfvmptrab1.f	. . . . . . . 8 ⊢ 𝐹 = (𝑥 ∈ 𝑉 ↦ {𝑦 ∈ ⦋𝑥 / 𝑚⦌𝑀 ∣ 𝜑})
5	4	dmmptss 6255	. . . . . . 7 ⊢ dom 𝐹 ⊆ 𝑉
6	5	sseli 3909	. . . . . 6 ⊢ (𝑋 ∈ dom 𝐹 → 𝑋 ∈ 𝑉)
7		elfvmptrab1.v	. . . . . . 7 ⊢ (𝑋 ∈ 𝑉 → ⦋𝑋 / 𝑚⦌𝑀 ∈ V)
8		rabexg 5303	. . . . . . 7 ⊢ (⦋𝑋 / 𝑚⦌𝑀 ∈ V → {𝑦 ∈ ⦋𝑋 / 𝑚⦌𝑀 ∣ [𝑋 / 𝑥]𝜑} ∈ V)
9	6, 7, 8	3syl 19	. . . . . 6 ⊢ (𝑋 ∈ dom 𝐹 → {𝑦 ∈ ⦋𝑋 / 𝑚⦌𝑀 ∣ [𝑋 / 𝑥]𝜑} ∈ V)
10		nfcv 2926	. . . . . . 7 ⊢ Ⅎ𝑥𝑋
11		nfsbc1v 3762	. . . . . . . 8 ⊢ Ⅎ𝑥[𝑋 / 𝑥]𝜑
12		nfcv 2926	. . . . . . . . 9 ⊢ Ⅎ𝑥𝑀
13	10, 12	nfcsb 3878	. . . . . . . 8 ⊢ Ⅎ𝑥⦋𝑋 / 𝑚⦌𝑀
14	11, 13	nfrabw 3451	. . . . . . 7 ⊢ Ⅎ𝑥{𝑦 ∈ ⦋𝑋 / 𝑚⦌𝑀 ∣ [𝑋 / 𝑥]𝜑}
15		csbeq1 3854	. . . . . . . 8 ⊢ (𝑥 = 𝑋 → ⦋𝑥 / 𝑚⦌𝑀 = ⦋𝑋 / 𝑚⦌𝑀)
16		sbceq1a 3753	. . . . . . . 8 ⊢ (𝑥 = 𝑋 → (𝜑 ↔ [𝑋 / 𝑥]𝜑))
17	15, 16	rabeqbidv 3433	. . . . . . 7 ⊢ (𝑥 = 𝑋 → {𝑦 ∈ ⦋𝑥 / 𝑚⦌𝑀 ∣ 𝜑} = {𝑦 ∈ ⦋𝑋 / 𝑚⦌𝑀 ∣ [𝑋 / 𝑥]𝜑})
18	10, 14, 17, 4	fvmptf 7038	. . . . . 6 ⊢ ((𝑋 ∈ 𝑉 ∧ {𝑦 ∈ ⦋𝑋 / 𝑚⦌𝑀 ∣ [𝑋 / 𝑥]𝜑} ∈ V) → (𝐹‘𝑋) = {𝑦 ∈ ⦋𝑋 / 𝑚⦌𝑀 ∣ [𝑋 / 𝑥]𝜑})
19	6, 9, 18	syl2anc 596	. . . . 5 ⊢ (𝑋 ∈ dom 𝐹 → (𝐹‘𝑋) = {𝑦 ∈ ⦋𝑋 / 𝑚⦌𝑀 ∣ [𝑋 / 𝑥]𝜑})
20	19	eleq2d 2850	. . . 4 ⊢ (𝑋 ∈ dom 𝐹 → (𝑌 ∈ (𝐹‘𝑋) ↔ 𝑌 ∈ {𝑦 ∈ ⦋𝑋 / 𝑚⦌𝑀 ∣ [𝑋 / 𝑥]𝜑}))
21		elrabi 3644	. . . . . 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 2147   ≠ wne 2959  {crab 3416  Vcvv 3454  [wsbc 3742  ⦋csb 3851  ∅c0 4281   ↦ cmpt 5189  dom cdm 5655  ‘cfv 6558

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-13 2404  ax-ext 2735  ax-sep 5252  ax-nul 5263  ax-pr 5395

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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6512  df-fun 6560  df-fv 6566

This theorem is used by: (None)