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

Theorem elrnmpt1 4758
 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 2661 . . . 4 𝑥 ∈ V
2 id 19 . . . . . . 7 (𝑥 = 𝑧𝑥 = 𝑧)
3 csbeq1a 2981 . . . . . . 7 (𝑥 = 𝑧𝐴 = 𝑧 / 𝑥𝐴)
42, 3eleq12d 2186 . . . . . 6 (𝑥 = 𝑧 → (𝑥𝐴𝑧𝑧 / 𝑥𝐴))
5 csbeq1a 2981 . . . . . . 7 (𝑥 = 𝑧𝐵 = 𝑧 / 𝑥𝐵)
65biantrud 300 . . . . . 6 (𝑥 = 𝑧 → (𝑧𝑧 / 𝑥𝐴 ↔ (𝑧𝑧 / 𝑥𝐴𝐵 = 𝑧 / 𝑥𝐵)))
74, 6bitr2d 188 . . . . 5 (𝑥 = 𝑧 → ((𝑧𝑧 / 𝑥𝐴𝐵 = 𝑧 / 𝑥𝐵) ↔ 𝑥𝐴))
87equcoms 1667 . . . 4 (𝑧 = 𝑥 → ((𝑧𝑧 / 𝑥𝐴𝐵 = 𝑧 / 𝑥𝐵) ↔ 𝑥𝐴))
91, 8spcev 2752 . . 3 (𝑥𝐴 → ∃𝑧(𝑧𝑧 / 𝑥𝐴𝐵 = 𝑧 / 𝑥𝐵))
10 df-rex 2397 . . . . . 6 (∃𝑥𝐴 𝑦 = 𝐵 ↔ ∃𝑥(𝑥𝐴𝑦 = 𝐵))
11 nfv 1491 . . . . . . 7 𝑧(𝑥𝐴𝑦 = 𝐵)
12 nfcsb1v 3003 . . . . . . . . 9 𝑥𝑧 / 𝑥𝐴
1312nfcri 2250 . . . . . . . 8 𝑥 𝑧𝑧 / 𝑥𝐴
14 nfcsb1v 3003 . . . . . . . . 9 𝑥𝑧 / 𝑥𝐵
1514nfeq2 2268 . . . . . . . 8 𝑥 𝑦 = 𝑧 / 𝑥𝐵
1613, 15nfan 1527 . . . . . . 7 𝑥(𝑧𝑧 / 𝑥𝐴𝑦 = 𝑧 / 𝑥𝐵)
175eqeq2d 2127 . . . . . . . 8 (𝑥 = 𝑧 → (𝑦 = 𝐵𝑦 = 𝑧 / 𝑥𝐵))
184, 17anbi12d 462 . . . . . . 7 (𝑥 = 𝑧 → ((𝑥𝐴𝑦 = 𝐵) ↔ (𝑧𝑧 / 𝑥𝐴𝑦 = 𝑧 / 𝑥𝐵)))
1911, 16, 18cbvex 1712 . . . . . 6 (∃𝑥(𝑥𝐴𝑦 = 𝐵) ↔ ∃𝑧(𝑧𝑧 / 𝑥𝐴𝑦 = 𝑧 / 𝑥𝐵))
2010, 19bitri 183 . . . . 5 (∃𝑥𝐴 𝑦 = 𝐵 ↔ ∃𝑧(𝑧𝑧 / 𝑥𝐴𝑦 = 𝑧 / 𝑥𝐵))
21 eqeq1 2122 . . . . . . 7 (𝑦 = 𝐵 → (𝑦 = 𝑧 / 𝑥𝐵𝐵 = 𝑧 / 𝑥𝐵))
2221anbi2d 457 . . . . . 6 (𝑦 = 𝐵 → ((𝑧𝑧 / 𝑥𝐴𝑦 = 𝑧 / 𝑥𝐵) ↔ (𝑧𝑧 / 𝑥𝐴𝐵 = 𝑧 / 𝑥𝐵)))
2322exbidv 1779 . . . . 5 (𝑦 = 𝐵 → (∃𝑧(𝑧𝑧 / 𝑥𝐴𝑦 = 𝑧 / 𝑥𝐵) ↔ ∃𝑧(𝑧𝑧 / 𝑥𝐴𝐵 = 𝑧 / 𝑥𝐵)))
2420, 23syl5bb 191 . . . 4 (𝑦 = 𝐵 → (∃𝑥𝐴 𝑦 = 𝐵 ↔ ∃𝑧(𝑧𝑧 / 𝑥𝐴𝐵 = 𝑧 / 𝑥𝐵)))
25 rnmpt.1 . . . . 5 𝐹 = (𝑥𝐴𝐵)
2625rnmpt 4755 . . . 4 ran 𝐹 = {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝐵}
2724, 26elab2g 2802 . . 3 (𝐵𝑉 → (𝐵 ∈ ran 𝐹 ↔ ∃𝑧(𝑧𝑧 / 𝑥𝐴𝐵 = 𝑧 / 𝑥𝐵)))
289, 27syl5ibr 155 . 2 (𝐵𝑉 → (𝑥𝐴𝐵 ∈ ran 𝐹))
2928impcom 124 1 ((𝑥𝐴𝐵𝑉) → 𝐵 ∈ ran 𝐹)
 Colors of variables: wff set class Syntax hints:   → wi 4   ∧ wa 103   ↔ wb 104   = wceq 1314  ∃wex 1451   ∈ wcel 1463  ∃wrex 2392  ⦋csb 2973   ↦ cmpt 3957  ran crn 4508 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 681  ax-5 1406  ax-7 1407  ax-gen 1408  ax-ie1 1452  ax-ie2 1453  ax-8 1465  ax-10 1466  ax-11 1467  ax-i12 1468  ax-bndl 1469  ax-4 1470  ax-14 1475  ax-17 1489  ax-i9 1493  ax-ial 1497  ax-i5r 1498  ax-ext 2097  ax-sep 4014  ax-pow 4066  ax-pr 4099 This theorem depends on definitions:  df-bi 116  df-3an 947  df-tru 1317  df-nf 1420  df-sb 1719  df-eu 1978  df-mo 1979  df-clab 2102  df-cleq 2108  df-clel 2111  df-nfc 2245  df-rex 2397  df-v 2660  df-sbc 2881  df-csb 2974  df-un 3043  df-in 3045  df-ss 3052  df-pw 3480  df-sn 3501  df-pr 3502  df-op 3504  df-br 3898  df-opab 3958  df-mpt 3959  df-cnv 4515  df-dm 4517  df-rn 4518 This theorem is referenced by:  fliftel1  5661
 Copyright terms: Public domain W3C validator