Users' Mathboxes Mathbox for Glauco Siliprandi < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  elrnmpt1sf Structured version   Visualization version   GIF version

Theorem elrnmpt1sf 38371
Description: Elementhood in an image set. Same as elrnmpt1s 5294, but using bound-variable hypotheses instead of distinct variable conditions. (Contributed by Glauco Siliprandi, 17-Aug-2020.)
Hypotheses
Ref Expression
elrnmpt1sf.1 𝑥𝐶
elrnmpt1sf.2 𝐹 = (𝑥𝐴𝐵)
elrnmpt1sf.3 (𝑥 = 𝐷𝐵 = 𝐶)
Assertion
Ref Expression
elrnmpt1sf ((𝐷𝐴𝐶𝑉) → 𝐶 ∈ ran 𝐹)
Distinct variable groups:   𝑥,𝐴   𝑥,𝐷
Allowed substitution hints:   𝐵(𝑥)   𝐶(𝑥)   𝐹(𝑥)   𝑉(𝑥)

Proof of Theorem elrnmpt1sf
StepHypRef Expression
1 eqid 2610 . . 3 𝐶 = 𝐶
21nfth 1718 . . . 4 𝑥 𝐶 = 𝐶
3 elrnmpt1sf.3 . . . . 5 (𝑥 = 𝐷𝐵 = 𝐶)
43eqeq2d 2620 . . . 4 (𝑥 = 𝐷 → (𝐶 = 𝐵𝐶 = 𝐶))
52, 4rspce 3277 . . 3 ((𝐷𝐴𝐶 = 𝐶) → ∃𝑥𝐴 𝐶 = 𝐵)
61, 5mpan2 703 . 2 (𝐷𝐴 → ∃𝑥𝐴 𝐶 = 𝐵)
7 elrnmpt1sf.1 . . . 4 𝑥𝐶
8 elrnmpt1sf.2 . . . 4 𝐹 = (𝑥𝐴𝐵)
97, 8elrnmptf 38362 . . 3 (𝐶𝑉 → (𝐶 ∈ ran 𝐹 ↔ ∃𝑥𝐴 𝐶 = 𝐵))
109biimparc 503 . 2 ((∃𝑥𝐴 𝐶 = 𝐵𝐶𝑉) → 𝐶 ∈ ran 𝐹)
116, 10sylan 487 1 ((𝐷𝐴𝐶𝑉) → 𝐶 ∈ ran 𝐹)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 383   = wceq 1475  wcel 1977  wnfc 2738  wrex 2897  cmpt 4643  ran crn 5039
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-sep 4709  ax-nul 4717  ax-pr 4833
This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-rex 2902  df-rab 2905  df-v 3175  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-sn 4126  df-pr 4128  df-op 4132  df-br 4584  df-opab 4644  df-mpt 4645  df-cnv 5046  df-dm 5048  df-rn 5049
This theorem is referenced by:  sge0f1o  39275
  Copyright terms: Public domain W3C validator