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

Theorem rnmpo 5987
Description: The range of an operation given by the maps-to notation. (Contributed by FL, 20-Jun-2011.)
Hypothesis
Ref Expression
rngop.1 𝐹 = (𝑥𝐴, 𝑦𝐵𝐶)
Assertion
Ref Expression
rnmpo ran 𝐹 = {𝑧 ∣ ∃𝑥𝐴𝑦𝐵 𝑧 = 𝐶}
Distinct variable groups:   𝑦,𝑧,𝐴   𝑧,𝐵   𝑧,𝐶   𝑧,𝐹   𝑥,𝑦,𝑧
Allowed substitution hints:   𝐴(𝑥)   𝐵(𝑥,𝑦)   𝐶(𝑥,𝑦)   𝐹(𝑥,𝑦)

Proof of Theorem rnmpo
StepHypRef Expression
1 rngop.1 . . . 4 𝐹 = (𝑥𝐴, 𝑦𝐵𝐶)
2 df-mpo 5882 . . . 4 (𝑥𝐴, 𝑦𝐵𝐶) = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝐴𝑦𝐵) ∧ 𝑧 = 𝐶)}
31, 2eqtri 2198 . . 3 𝐹 = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝐴𝑦𝐵) ∧ 𝑧 = 𝐶)}
43rneqi 4857 . 2 ran 𝐹 = ran {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝐴𝑦𝐵) ∧ 𝑧 = 𝐶)}
5 rnoprab2 5961 . 2 ran {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝐴𝑦𝐵) ∧ 𝑧 = 𝐶)} = {𝑧 ∣ ∃𝑥𝐴𝑦𝐵 𝑧 = 𝐶}
64, 5eqtri 2198 1 ran 𝐹 = {𝑧 ∣ ∃𝑥𝐴𝑦𝐵 𝑧 = 𝐶}
Colors of variables: wff set class
Syntax hints:  wa 104   = wceq 1353  wcel 2148  {cab 2163  wrex 2456  ran crn 4629  {coprab 5878  cmpo 5879
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 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-14 2151  ax-ext 2159  ax-sep 4123  ax-pow 4176  ax-pr 4211
This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-rex 2461  df-v 2741  df-un 3135  df-in 3137  df-ss 3144  df-pw 3579  df-sn 3600  df-pr 3601  df-op 3603  df-br 4006  df-opab 4067  df-cnv 4636  df-dm 4638  df-rn 4639  df-oprab 5881  df-mpo 5882
This theorem is referenced by:  elrnmpog  5989  elrnmpo  5990  ralrnmpo  5991  rexrnmpo  5992  mpoexw  6216  txuni2  13841  txbas  13843  txrest  13861
  Copyright terms: Public domain W3C validator