MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  elrnmpt1 Structured version   Visualization version   GIF version

Theorem elrnmpt1 5953
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.
StepHypRef Expression
1 vex 3457 . . . 4 𝑥 ∈ V
2 id 23 . . . . . . 7 (𝑥 = 𝑧 → 𝑥 = 𝑧)
3 csbeq1a 3864 . . . . . . 7 (𝑥 = 𝑧 → 𝐴 = ⦋𝑧 / 𝑥⦌𝐴)
42, 3eleq12d 2861 . . . . . 6 (𝑥 = 𝑧 → (𝑥 ∈ 𝐴 ↔ 𝑧 ∈ ⦋𝑧 / 𝑥⦌𝐴))
5 csbeq1a 3864 . . . . . . 7 (𝑥 = 𝑧 → 𝐵 = ⦋𝑧 / 𝑥⦌𝐵)
65biantrud 541 . . . . . 6 (𝑥 = 𝑧 → (𝑧 ∈ ⦋𝑧 / 𝑥⦌𝐴 ↔ (𝑧 ∈ ⦋𝑧 / 𝑥⦌𝐴 ∧ 𝐵 = ⦋𝑧 / 𝑥⦌𝐵)))
74, 6bitr2d 283 . . . . 5 (𝑥 = 𝑧 → ((𝑧 ∈ ⦋𝑧 / 𝑥⦌𝐴 ∧ 𝐵 = ⦋𝑧 / 𝑥⦌𝐵) ↔ 𝑥 ∈ 𝐴))
87equcoms 2057 . . . 4 (𝑧 = 𝑥 → ((𝑧 ∈ ⦋𝑧 / 𝑥⦌𝐴 ∧ 𝐵 = ⦋𝑧 / 𝑥⦌𝐵) ↔ 𝑥 ∈ 𝐴))
91, 8spcev 3563 . . 3 (𝑥 ∈ 𝐴 → ∃𝑧(𝑧 ∈ ⦋𝑧 / 𝑥⦌𝐴 ∧ 𝐵 = ⦋𝑧 / 𝑥⦌𝐵))
10 df-rex 3094 . . . . . 6 (∃𝑥 ∈ 𝐴 𝑦 = 𝐵 ↔ ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵))
11 nfv 1951 . . . . . . 7 Ⅎ𝑧(𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵)
12 nfcsb1v 3874 . . . . . . . . 9 Ⅎ𝑥⦋𝑧 / 𝑥⦌𝐴
1312nfcri 2921 . . . . . . . 8 Ⅎ𝑥 𝑧 ∈ ⦋𝑧 / 𝑥⦌𝐴
14 nfcsb1v 3874 . . . . . . . . 9 Ⅎ𝑥⦋𝑧 / 𝑥⦌𝐵
1514nfeq2 2946 . . . . . . . 8 Ⅎ𝑥 𝑦 = ⦋𝑧 / 𝑥⦌𝐵
1613, 15nfan 1936 . . . . . . 7 Ⅎ𝑥(𝑧 ∈ ⦋𝑧 / 𝑥⦌𝐴 ∧ 𝑦 = ⦋𝑧 / 𝑥⦌𝐵)
175eqeq2d 2777 . . . . . . . 8 (𝑥 = 𝑧 → (𝑦 = 𝐵 ↔ 𝑦 = ⦋𝑧 / 𝑥⦌𝐵))
184, 17anbi12d 644 . . . . . . 7 (𝑥 = 𝑧 → ((𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵) ↔ (𝑧 ∈ ⦋𝑧 / 𝑥⦌𝐴 ∧ 𝑦 = ⦋𝑧 / 𝑥⦌𝐵)))
1911, 16, 18cbvexv1 2378 . . . . . 6 (∃𝑥(𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵) ↔ ∃𝑧(𝑧 ∈ ⦋𝑧 / 𝑥⦌𝐴 ∧ 𝑦 = ⦋𝑧 / 𝑥⦌𝐵))
2010, 19bitri 278 . . . . 5 (∃𝑥 ∈ 𝐴 𝑦 = 𝐵 ↔ ∃𝑧(𝑧 ∈ ⦋𝑧 / 𝑥⦌𝐴 ∧ 𝑦 = ⦋𝑧 / 𝑥⦌𝐵))
21 eqeq1 2770 . . . . . . 7 (𝑦 = 𝐵 → (𝑦 = ⦋𝑧 / 𝑥⦌𝐵 ↔ 𝐵 = ⦋𝑧 / 𝑥⦌𝐵))
2221anbi2d 642 . . . . . 6 (𝑦 = 𝐵 → ((𝑧 ∈ ⦋𝑧 / 𝑥⦌𝐴 ∧ 𝑦 = ⦋𝑧 / 𝑥⦌𝐵) ↔ (𝑧 ∈ ⦋𝑧 / 𝑥⦌𝐴 ∧ 𝐵 = ⦋𝑧 / 𝑥⦌𝐵)))
2322exbidv 1958 . . . . 5 (𝑦 = 𝐵 → (∃𝑧(𝑧 ∈ ⦋𝑧 / 𝑥⦌𝐴 ∧ 𝑦 = ⦋𝑧 / 𝑥⦌𝐵) ↔ ∃𝑧(𝑧 ∈ ⦋𝑧 / 𝑥⦌𝐴 ∧ 𝐵 = ⦋𝑧 / 𝑥⦌𝐵)))
2420, 23bitrid 286 . . . 4 (𝑦 = 𝐵 → (∃𝑥 ∈ 𝐴 𝑦 = 𝐵 ↔ ∃𝑧(𝑧 ∈ ⦋𝑧 / 𝑥⦌𝐴 ∧ 𝐵 = ⦋𝑧 / 𝑥⦌𝐵)))
25 rnmpt.1 . . . . 5 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐵)
2625rnmpt 5950 . . . 4 ran 𝐹 = {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵}
2724, 26elab2g 3636 . . 3 (𝐵 ∈ 𝑉 → (𝐵 ∈ ran 𝐹 ↔ ∃𝑧(𝑧 ∈ ⦋𝑧 / 𝑥⦌𝐴 ∧ 𝐵 = ⦋𝑧 / 𝑥⦌𝐵)))
289, 27imbitrrid 249 . 2 (𝐵 ∈ 𝑉 → (𝑥 ∈ 𝐴 → 𝐵 ∈ ran 𝐹))
2928impcom 413 1 ((𝑥 ∈ 𝐴 ∧ 𝐵 ∈ 𝑉) → 𝐵 ∈ ran 𝐹)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1572  ∃wex 1814   ∈ wcel 2150  ∃wrex 3093  ⦋csb 3850   ↦ cmpt 5191  ran crn 5658
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-10 2183  ax-11 2200  ax-12 2219  ax-ext 2738  ax-sep 5254  ax-pr 5397
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1106  df-tru 1575  df-fal 1585  df-ex 1815  df-nf 1819  df-sb 2104  df-clab 2745  df-cleq 2758  df-clel 2842  df-nfc 2916  df-rex 3094  df-rab 3416  df-v 3455  df-sbc 3742  df-csb 3851  df-ss 3900  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-sn 4588  df-pr 4590  df-op 4840  df-br 5108  df-opab 5173  df-mpt 5192  df-cnv 5665  df-dm 5667  df-rn 5668
This theorem is used by:  elrnmpt1d  5957  fliftel1  7348  minveclem4  25810  minvecolem4  31541  rexunirn  33189  esum2d  34837  exrecfnlem  38572  totbndbnd  38991  rrnequiv  39037  suprnmpt  46522  disjf1o  46539  disjinfi  46540  choicefi  46547  suprubrnmpt  46598  supxrleubrnmpt  46749  suprleubrnmpt  46765  infrnmptle  46766  infxrunb3rnmpt  46771  supminfrnmpt  46788  infxrgelbrnmpt  46797  fourierdlem31  47481  ioorrnopnlem  47647  sge0supre  47732  sge0gerp  47738  sge0iunmpt  47761  sge0rernmpt  47765  sge0reuz  47790  meadjiunlem  47808  iunhoiioolem  48018  vonioolem1  48023  smfpimcclem  48150
  Copyright terms: Public domain W3C validator