Theorem fvelrnb 5528

Description: A member of a function's range is a value of the function. (Contributed by NM, 31-Oct-1995.)

Assertion

Ref	Expression
fvelrnb	⊢ (𝐹 Fn 𝐴 → (𝐵 ∈ ran 𝐹 ↔ ∃𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝐵))

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝑥,𝐹

Proof of Theorem fvelrnb

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-rex 2448	. . . 4 ⊢ (∃𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝐵 ↔ ∃𝑥(𝑥 ∈ 𝐴 ∧ (𝐹‘𝑥) = 𝐵))
2		19.41v 1889	. . . . 5 ⊢ (∃𝑥((𝑥 ∈ 𝐴 ∧ (𝐹‘𝑥) = 𝐵) ∧ 𝐹 Fn 𝐴) ↔ (∃𝑥(𝑥 ∈ 𝐴 ∧ (𝐹‘𝑥) = 𝐵) ∧ 𝐹 Fn 𝐴))
3		simpl 108	. . . . . . . . . 10 ⊢ ((𝑥 ∈ 𝐴 ∧ (𝐹‘𝑥) = 𝐵) → 𝑥 ∈ 𝐴)
4	3	anim1i 338	. . . . . . . . 9 ⊢ (((𝑥 ∈ 𝐴 ∧ (𝐹‘𝑥) = 𝐵) ∧ 𝐹 Fn 𝐴) → (𝑥 ∈ 𝐴 ∧ 𝐹 Fn 𝐴))
5	4	ancomd 265	. . . . . . . 8 ⊢ (((𝑥 ∈ 𝐴 ∧ (𝐹‘𝑥) = 𝐵) ∧ 𝐹 Fn 𝐴) → (𝐹 Fn 𝐴 ∧ 𝑥 ∈ 𝐴))
6		funfvex 5497	. . . . . . . . 9 ⊢ ((Fun 𝐹 ∧ 𝑥 ∈ dom 𝐹) → (𝐹‘𝑥) ∈ V)
7	6	funfni 5282	. . . . . . . 8 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) ∈ V)
8	5, 7	syl 14	. . . . . . 7 ⊢ (((𝑥 ∈ 𝐴 ∧ (𝐹‘𝑥) = 𝐵) ∧ 𝐹 Fn 𝐴) → (𝐹‘𝑥) ∈ V)
9		simpr 109	. . . . . . . . 9 ⊢ ((𝑥 ∈ 𝐴 ∧ (𝐹‘𝑥) = 𝐵) → (𝐹‘𝑥) = 𝐵)
10	9	eleq1d 2233	. . . . . . . 8 ⊢ ((𝑥 ∈ 𝐴 ∧ (𝐹‘𝑥) = 𝐵) → ((𝐹‘𝑥) ∈ V ↔ 𝐵 ∈ V))
11	10	adantr 274	. . . . . . 7 ⊢ (((𝑥 ∈ 𝐴 ∧ (𝐹‘𝑥) = 𝐵) ∧ 𝐹 Fn 𝐴) → ((𝐹‘𝑥) ∈ V ↔ 𝐵 ∈ V))
12	8, 11	mpbid 146	. . . . . 6 ⊢ (((𝑥 ∈ 𝐴 ∧ (𝐹‘𝑥) = 𝐵) ∧ 𝐹 Fn 𝐴) → 𝐵 ∈ V)
13	12	exlimiv 1585	. . . . 5 ⊢ (∃𝑥((𝑥 ∈ 𝐴 ∧ (𝐹‘𝑥) = 𝐵) ∧ 𝐹 Fn 𝐴) → 𝐵 ∈ V)
14	2, 13	sylbir 134	. . . 4 ⊢ ((∃𝑥(𝑥 ∈ 𝐴 ∧ (𝐹‘𝑥) = 𝐵) ∧ 𝐹 Fn 𝐴) → 𝐵 ∈ V)
15	1, 14	sylanb 282	. . 3 ⊢ ((∃𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝐵 ∧ 𝐹 Fn 𝐴) → 𝐵 ∈ V)
16	15	expcom 115	. 2 ⊢ (𝐹 Fn 𝐴 → (∃𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝐵 → 𝐵 ∈ V))
17		fnrnfv 5527	. . . 4 ⊢ (𝐹 Fn 𝐴 → ran 𝐹 = {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥)})
18	17	eleq2d 2234	. . 3 ⊢ (𝐹 Fn 𝐴 → (𝐵 ∈ ran 𝐹 ↔ 𝐵 ∈ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥)}))
19		eqeq1 2171	. . . . . 6 ⊢ (𝑦 = 𝐵 → (𝑦 = (𝐹‘𝑥) ↔ 𝐵 = (𝐹‘𝑥)))
20		eqcom 2166	. . . . . 6 ⊢ (𝐵 = (𝐹‘𝑥) ↔ (𝐹‘𝑥) = 𝐵)
21	19, 20	bitrdi 195	. . . . 5 ⊢ (𝑦 = 𝐵 → (𝑦 = (𝐹‘𝑥) ↔ (𝐹‘𝑥) = 𝐵))
22	21	rexbidv 2465	. . . 4 ⊢ (𝑦 = 𝐵 → (∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥) ↔ ∃𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝐵))
23	22	elab3g 2872	. . 3 ⊢ ((∃𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝐵 → 𝐵 ∈ V) → (𝐵 ∈ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥)} ↔ ∃𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝐵))
24	18, 23	sylan9bbr 459	. 2 ⊢ (((∃𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝐵 → 𝐵 ∈ V) ∧ 𝐹 Fn 𝐴) → (𝐵 ∈ ran 𝐹 ↔ ∃𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝐵))
25	16, 24	mpancom 419	1 ⊢ (𝐹 Fn 𝐴 → (𝐵 ∈ ran 𝐹 ↔ ∃𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝐵))

Syntax hints:   → wi 4   ∧ wa 103   ↔ wb 104   = wceq 1342  ∃wex 1479   ∈ wcel 2135  {cab 2150  ∃wrex 2443  Vcvv 2721  ran crn 4599   Fn wfn 5177  ‘cfv 5182

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 699  ax-5 1434  ax-7 1435  ax-gen 1436  ax-ie1 1480  ax-ie2 1481  ax-8 1491  ax-10 1492  ax-11 1493  ax-i12 1494  ax-bndl 1496  ax-4 1497  ax-17 1513  ax-i9 1517  ax-ial 1521  ax-i5r 1522  ax-14 2138  ax-ext 2146  ax-sep 4094  ax-pow 4147  ax-pr 4181

This theorem depends on definitions:  df-bi 116  df-3an 969  df-tru 1345  df-nf 1448  df-sb 1750  df-eu 2016  df-mo 2017  df-clab 2151  df-cleq 2157  df-clel 2160  df-nfc 2295  df-ral 2447  df-rex 2448  df-v 2723  df-sbc 2947  df-un 3115  df-in 3117  df-ss 3124  df-pw 3555  df-sn 3576  df-pr 3577  df-op 3579  df-uni 3784  df-br 3977  df-opab 4038  df-mpt 4039  df-id 4265  df-xp 4604  df-rel 4605  df-cnv 4606  df-co 4607  df-dm 4608  df-rn 4609  df-iota 5147  df-fun 5184  df-fn 5185  df-fv 5190

This theorem is referenced by:  chfnrn  5590  rexrn  5616  ralrn  5617  elrnrexdmb  5619  ffnfv  5637  fconstfvm  5697  elunirn  5728  isoini  5780  canth  5790  reldm  6146  ordiso2  6991  eldju  7024  ctssdc  7069  uzn0  9472  frec2uzrand  10330  frecuzrdgtcl  10337  frecuzrdgfunlem  10344  uzin2  10915  reeff1o  13235