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

Theorem elrnmptg 4949
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 4945 . . 3 ran 𝐹 = {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝐵}
32eleq2i 2274 . 2 (𝐶 ∈ ran 𝐹𝐶 ∈ {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝐵})
4 r19.29 2645 . . . . 5 ((∀𝑥𝐴 𝐵𝑉 ∧ ∃𝑥𝐴 𝐶 = 𝐵) → ∃𝑥𝐴 (𝐵𝑉𝐶 = 𝐵))
5 eleq1 2270 . . . . . . . 8 (𝐶 = 𝐵 → (𝐶𝑉𝐵𝑉))
65biimparc 299 . . . . . . 7 ((𝐵𝑉𝐶 = 𝐵) → 𝐶𝑉)
7 elex 2788 . . . . . . 7 (𝐶𝑉𝐶 ∈ V)
86, 7syl 14 . . . . . 6 ((𝐵𝑉𝐶 = 𝐵) → 𝐶 ∈ V)
98rexlimivw 2621 . . . . 5 (∃𝑥𝐴 (𝐵𝑉𝐶 = 𝐵) → 𝐶 ∈ V)
104, 9syl 14 . . . 4 ((∀𝑥𝐴 𝐵𝑉 ∧ ∃𝑥𝐴 𝐶 = 𝐵) → 𝐶 ∈ V)
1110ex 115 . . 3 (∀𝑥𝐴 𝐵𝑉 → (∃𝑥𝐴 𝐶 = 𝐵𝐶 ∈ V))
12 eqeq1 2214 . . . . 5 (𝑦 = 𝐶 → (𝑦 = 𝐵𝐶 = 𝐵))
1312rexbidv 2509 . . . 4 (𝑦 = 𝐶 → (∃𝑥𝐴 𝑦 = 𝐵 ↔ ∃𝑥𝐴 𝐶 = 𝐵))
1413elab3g 2931 . . 3 ((∃𝑥𝐴 𝐶 = 𝐵𝐶 ∈ V) → (𝐶 ∈ {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝐵} ↔ ∃𝑥𝐴 𝐶 = 𝐵))
1511, 14syl 14 . 2 (∀𝑥𝐴 𝐵𝑉 → (𝐶 ∈ {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝐵} ↔ ∃𝑥𝐴 𝐶 = 𝐵))
163, 15bitrid 192 1 (∀𝑥𝐴 𝐵𝑉 → (𝐶 ∈ ran 𝐹 ↔ ∃𝑥𝐴 𝐶 = 𝐵))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105   = wceq 1373  wcel 2178  {cab 2193  wral 2486  wrex 2487  Vcvv 2776  cmpt 4121  ran crn 4694
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-14 2181  ax-ext 2189  ax-sep 4178  ax-pow 4234  ax-pr 4269
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2194  df-cleq 2200  df-clel 2203  df-nfc 2339  df-ral 2491  df-rex 2492  df-v 2778  df-un 3178  df-in 3180  df-ss 3187  df-pw 3628  df-sn 3649  df-pr 3650  df-op 3652  df-br 4060  df-opab 4122  df-mpt 4123  df-cnv 4701  df-dm 4703  df-rn 4704
This theorem is referenced by:  elrnmpti  4950  fliftel  5885  2sqlem1  15706
  Copyright terms: Public domain W3C validator