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

Theorem rnopab 4795
 Description: The range of a class of ordered pairs. (Contributed by NM, 14-Aug-1995.) (Revised by Mario Carneiro, 4-Dec-2016.)
Assertion
Ref Expression
rnopab ran {⟨𝑥, 𝑦⟩ ∣ 𝜑} = {𝑦 ∣ ∃𝑥𝜑}
Distinct variable group:   𝑥,𝑦
Allowed substitution hints:   𝜑(𝑥,𝑦)

Proof of Theorem rnopab
StepHypRef Expression
1 nfopab1 4006 . . 3 𝑥{⟨𝑥, 𝑦⟩ ∣ 𝜑}
2 nfopab2 4007 . . 3 𝑦{⟨𝑥, 𝑦⟩ ∣ 𝜑}
31, 2dfrnf 4789 . 2 ran {⟨𝑥, 𝑦⟩ ∣ 𝜑} = {𝑦 ∣ ∃𝑥 𝑥{⟨𝑥, 𝑦⟩ ∣ 𝜑}𝑦}
4 df-br 3939 . . . . 5 (𝑥{⟨𝑥, 𝑦⟩ ∣ 𝜑}𝑦 ↔ ⟨𝑥, 𝑦⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑})
5 opabid 4188 . . . . 5 (⟨𝑥, 𝑦⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑} ↔ 𝜑)
64, 5bitri 183 . . . 4 (𝑥{⟨𝑥, 𝑦⟩ ∣ 𝜑}𝑦𝜑)
76exbii 1585 . . 3 (∃𝑥 𝑥{⟨𝑥, 𝑦⟩ ∣ 𝜑}𝑦 ↔ ∃𝑥𝜑)
87abbii 2256 . 2 {𝑦 ∣ ∃𝑥 𝑥{⟨𝑥, 𝑦⟩ ∣ 𝜑}𝑦} = {𝑦 ∣ ∃𝑥𝜑}
93, 8eqtri 2161 1 ran {⟨𝑥, 𝑦⟩ ∣ 𝜑} = {𝑦 ∣ ∃𝑥𝜑}
 Colors of variables: wff set class Syntax hints:   = wceq 1332  ∃wex 1469   ∈ wcel 1481  {cab 2126  ⟨cop 3536   class class class wbr 3938  {copab 3997  ran crn 4549 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 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-10 1484  ax-11 1485  ax-i12 1486  ax-bndl 1487  ax-4 1488  ax-14 1493  ax-17 1507  ax-i9 1511  ax-ial 1515  ax-i5r 1516  ax-ext 2122  ax-sep 4055  ax-pow 4107  ax-pr 4140 This theorem depends on definitions:  df-bi 116  df-3an 965  df-tru 1335  df-nf 1438  df-sb 1737  df-eu 2003  df-mo 2004  df-clab 2127  df-cleq 2133  df-clel 2136  df-nfc 2271  df-v 2692  df-un 3081  df-in 3083  df-ss 3090  df-pw 3518  df-sn 3539  df-pr 3540  df-op 3542  df-br 3939  df-opab 3999  df-cnv 4556  df-dm 4558  df-rn 4559 This theorem is referenced by:  rnmpt  4796  mptpreima  5041  rnoprab  5863
 Copyright terms: Public domain W3C validator