ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  elrnmptg GIF version

Theorem elrnmptg 4856
Description: Membership in the range of a function. (Contributed by NM, 27-Aug-2007.) (Revised by Mario Carneiro, 31-Aug-2015.)
Hypothesis
Ref Expression
rnmpt.1 𝐹 = (𝑥𝐴𝐵)
Assertion
Ref Expression
elrnmptg (∀𝑥𝐴 𝐵𝑉 → (𝐶 ∈ ran 𝐹 ↔ ∃𝑥𝐴 𝐶 = 𝐵))
Distinct variable group:   𝑥,𝐶
Allowed substitution hints:   𝐴(𝑥)   𝐵(𝑥)   𝐹(𝑥)   𝑉(𝑥)

Proof of Theorem elrnmptg
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 rnmpt.1 . . . 4 𝐹 = (𝑥𝐴𝐵)
21rnmpt 4852 . . 3 ran 𝐹 = {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝐵}
32eleq2i 2233 . 2 (𝐶 ∈ ran 𝐹𝐶 ∈ {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝐵})
4 r19.29 2603 . . . . 5 ((∀𝑥𝐴 𝐵𝑉 ∧ ∃𝑥𝐴 𝐶 = 𝐵) → ∃𝑥𝐴 (𝐵𝑉𝐶 = 𝐵))
5 eleq1 2229 . . . . . . . 8 (𝐶 = 𝐵 → (𝐶𝑉𝐵𝑉))
65biimparc 297 . . . . . . 7 ((𝐵𝑉𝐶 = 𝐵) → 𝐶𝑉)
7 elex 2737 . . . . . . 7 (𝐶𝑉𝐶 ∈ V)
86, 7syl 14 . . . . . 6 ((𝐵𝑉𝐶 = 𝐵) → 𝐶 ∈ V)
98rexlimivw 2579 . . . . 5 (∃𝑥𝐴 (𝐵𝑉𝐶 = 𝐵) → 𝐶 ∈ V)
104, 9syl 14 . . . 4 ((∀𝑥𝐴 𝐵𝑉 ∧ ∃𝑥𝐴 𝐶 = 𝐵) → 𝐶 ∈ V)
1110ex 114 . . 3 (∀𝑥𝐴 𝐵𝑉 → (∃𝑥𝐴 𝐶 = 𝐵𝐶 ∈ V))
12 eqeq1 2172 . . . . 5 (𝑦 = 𝐶 → (𝑦 = 𝐵𝐶 = 𝐵))
1312rexbidv 2467 . . . 4 (𝑦 = 𝐶 → (∃𝑥𝐴 𝑦 = 𝐵 ↔ ∃𝑥𝐴 𝐶 = 𝐵))
1413elab3g 2877 . . 3 ((∃𝑥𝐴 𝐶 = 𝐵𝐶 ∈ V) → (𝐶 ∈ {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝐵} ↔ ∃𝑥𝐴 𝐶 = 𝐵))
1511, 14syl 14 . 2 (∀𝑥𝐴 𝐵𝑉 → (𝐶 ∈ {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝐵} ↔ ∃𝑥𝐴 𝐶 = 𝐵))
163, 15syl5bb 191 1 (∀𝑥𝐴 𝐵𝑉 → (𝐶 ∈ ran 𝐹 ↔ ∃𝑥𝐴 𝐶 = 𝐵))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 103  wb 104   = wceq 1343  wcel 2136  {cab 2151  wral 2444  wrex 2445  Vcvv 2726  cmpt 4043  ran crn 4605
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 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-14 2139  ax-ext 2147  ax-sep 4100  ax-pow 4153  ax-pr 4187
This theorem depends on definitions:  df-bi 116  df-3an 970  df-tru 1346  df-nf 1449  df-sb 1751  df-eu 2017  df-mo 2018  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-ral 2449  df-rex 2450  df-v 2728  df-un 3120  df-in 3122  df-ss 3129  df-pw 3561  df-sn 3582  df-pr 3583  df-op 3585  df-br 3983  df-opab 4044  df-mpt 4045  df-cnv 4612  df-dm 4614  df-rn 4615
This theorem is referenced by:  elrnmpti  4857  fliftel  5761  2sqlem1  13590
  Copyright terms: Public domain W3C validator