Theorem elrnmpt1 5948

Description: Elementhood in an image set. (Contributed by Mario Carneiro, 31-Aug-2015.)

Hypothesis

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

Assertion

Ref	Expression
elrnmpt1	⊢ ((𝑥 ∈ 𝐴 ∧ 𝐵 ∈ 𝑉) → 𝐵 ∈ ran 𝐹)

Proof of Theorem elrnmpt1

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

Step	Hyp	Ref	Expression
1		vex 3458	. . . 4 ⊢ 𝑥 ∈ V
2		id 23	. . . . . . 7 ⊢ (𝑥 = 𝑧 → 𝑥 = 𝑧)
3		csbeq1a 3865	. . . . . . 7 ⊢ (𝑥 = 𝑧 → 𝐴 = ⦋𝑧 / 𝑥⦌𝐴)
4	2, 3	eleq12d 2858	. . . . . 6 ⊢ (𝑥 = 𝑧 → (𝑥 ∈ 𝐴 ↔ 𝑧 ∈ ⦋𝑧 / 𝑥⦌𝐴))
5		csbeq1a 3865	. . . . . . 7 ⊢ (𝑥 = 𝑧 → 𝐵 = ⦋𝑧 / 𝑥⦌𝐵)
6	5	biantrud 541	. . . . . 6 ⊢ (𝑥 = 𝑧 → (𝑧 ∈ ⦋𝑧 / 𝑥⦌𝐴 ↔ (𝑧 ∈ ⦋𝑧 / 𝑥⦌𝐴 ∧ 𝐵 = ⦋𝑧 / 𝑥⦌𝐵)))
7	4, 6	bitr2d 283	. . . . 5 ⊢ (𝑥 = 𝑧 → ((𝑧 ∈ ⦋𝑧 / 𝑥⦌𝐴 ∧ 𝐵 = ⦋𝑧 / 𝑥⦌𝐵) ↔ 𝑥 ∈ 𝐴))
8	7	equcoms 2055	. . . 4 ⊢ (𝑧 = 𝑥 → ((𝑧 ∈ ⦋𝑧 / 𝑥⦌𝐴 ∧ 𝐵 = ⦋𝑧 / 𝑥⦌𝐵) ↔ 𝑥 ∈ 𝐴))
9	1, 8	spcev 3564	. . 3 ⊢ (𝑥 ∈ 𝐴 → ∃𝑧(𝑧 ∈ ⦋𝑧 / 𝑥⦌𝐴 ∧ 𝐵 = ⦋𝑧 / 𝑥⦌𝐵))
10		df-rex 3091	. . . . . 6 ⊢ (∃𝑥 ∈ 𝐴 𝑦 = 𝐵 ↔ ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵))
11		nfv 1949	. . . . . . 7 ⊢ Ⅎ𝑧(𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵)
12		nfcsb1v 3875	. . . . . . . . 9 ⊢ Ⅎ𝑥⦋𝑧 / 𝑥⦌𝐴
13	12	nfcri 2918	. . . . . . . 8 ⊢ Ⅎ𝑥 𝑧 ∈ ⦋𝑧 / 𝑥⦌𝐴
14		nfcsb1v 3875	. . . . . . . . 9 ⊢ Ⅎ𝑥⦋𝑧 / 𝑥⦌𝐵
15	14	nfeq2 2943	. . . . . . . 8 ⊢ Ⅎ𝑥 𝑦 = ⦋𝑧 / 𝑥⦌𝐵
16	13, 15	nfan 1934	. . . . . . 7 ⊢ Ⅎ𝑥(𝑧 ∈ ⦋𝑧 / 𝑥⦌𝐴 ∧ 𝑦 = ⦋𝑧 / 𝑥⦌𝐵)
17	5	eqeq2d 2774	. . . . . . . 8 ⊢ (𝑥 = 𝑧 → (𝑦 = 𝐵 ↔ 𝑦 = ⦋𝑧 / 𝑥⦌𝐵))
18	4, 17	anbi12d 644	. . . . . . 7 ⊢ (𝑥 = 𝑧 → ((𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵) ↔ (𝑧 ∈ ⦋𝑧 / 𝑥⦌𝐴 ∧ 𝑦 = ⦋𝑧 / 𝑥⦌𝐵)))
19	11, 16, 18	cbvexv1 2375	. . . . . 6 ⊢ (∃𝑥(𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵) ↔ ∃𝑧(𝑧 ∈ ⦋𝑧 / 𝑥⦌𝐴 ∧ 𝑦 = ⦋𝑧 / 𝑥⦌𝐵))
20	10, 19	bitri 278	. . . . 5 ⊢ (∃𝑥 ∈ 𝐴 𝑦 = 𝐵 ↔ ∃𝑧(𝑧 ∈ ⦋𝑧 / 𝑥⦌𝐴 ∧ 𝑦 = ⦋𝑧 / 𝑥⦌𝐵))
21		eqeq1 2767	. . . . . . 7 ⊢ (𝑦 = 𝐵 → (𝑦 = ⦋𝑧 / 𝑥⦌𝐵 ↔ 𝐵 = ⦋𝑧 / 𝑥⦌𝐵))
22	21	anbi2d 642	. . . . . 6 ⊢ (𝑦 = 𝐵 → ((𝑧 ∈ ⦋𝑧 / 𝑥⦌𝐴 ∧ 𝑦 = ⦋𝑧 / 𝑥⦌𝐵) ↔ (𝑧 ∈ ⦋𝑧 / 𝑥⦌𝐴 ∧ 𝐵 = ⦋𝑧 / 𝑥⦌𝐵)))
23	22	exbidv 1956	. . . . 5 ⊢ (𝑦 = 𝐵 → (∃𝑧(𝑧 ∈ ⦋𝑧 / 𝑥⦌𝐴 ∧ 𝑦 = ⦋𝑧 / 𝑥⦌𝐵) ↔ ∃𝑧(𝑧 ∈ ⦋𝑧 / 𝑥⦌𝐴 ∧ 𝐵 = ⦋𝑧 / 𝑥⦌𝐵)))
24	20, 23	bitrid 286	. . . 4 ⊢ (𝑦 = 𝐵 → (∃𝑥 ∈ 𝐴 𝑦 = 𝐵 ↔ ∃𝑧(𝑧 ∈ ⦋𝑧 / 𝑥⦌𝐴 ∧ 𝐵 = ⦋𝑧 / 𝑥⦌𝐵)))
25		rnmpt.1	. . . . 5 ⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐵)
26	25	rnmpt 5945	. . . 4 ⊢ ran 𝐹 = {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵}
27	24, 26	elab2g 3637	. . 3 ⊢ (𝐵 ∈ 𝑉 → (𝐵 ∈ ran 𝐹 ↔ ∃𝑧(𝑧 ∈ ⦋𝑧 / 𝑥⦌𝐴 ∧ 𝐵 = ⦋𝑧 / 𝑥⦌𝐵)))
28	9, 27	imbitrrid 249	. 2 ⊢ (𝐵 ∈ 𝑉 → (𝑥 ∈ 𝐴 → 𝐵 ∈ ran 𝐹))
29	28	impcom 413	1 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝐵 ∈ 𝑉) → 𝐵 ∈ ran 𝐹)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570  ∃wex 1812   ∈ wcel 2147  ∃wrex 3090  ⦋csb 3851   ↦ cmpt 5189  ran crn 5656

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-ext 2735  ax-sep 5252  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-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  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-sn 4589  df-pr 4591  df-op 4839  df-br 5107  df-opab 5171  df-mpt 5190  df-cnv 5663  df-dm 5665  df-rn 5666

This theorem is used by:  elrnmpt1d  5952  fliftel1  7338  minveclem4  25780  minvecolem4  31509  rexunirn  33157  esum2d  34792  exrecfnlem  38493  totbndbnd  38914  rrnequiv  38960  suprnmpt  46392  disjf1o  46409  disjinfi  46410  choicefi  46417  suprubrnmpt  46468  supxrleubrnmpt  46619  suprleubrnmpt  46635  infrnmptle  46636  infxrunb3rnmpt  46641  supminfrnmpt  46658  infxrgelbrnmpt  46667  fourierdlem31  47351  ioorrnopnlem  47517  sge0supre  47602  sge0gerp  47608  sge0iunmpt  47631  sge0rernmpt  47635  sge0reuz  47660  meadjiunlem  47678  iunhoiioolem  47888  vonioolem1  47893  smfpimcclem  48020