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

Theorem funcnv3 6580
Description: A condition showing a class is single-rooted. (See funcnv 6579). (Contributed by NM, 26-May-2006.)
Assertion
Ref Expression
funcnv3 (Fun 𝐴 ↔ ∀𝑦 ∈ ran 𝐴∃!𝑥 ∈ dom 𝐴 𝑥𝐴𝑦)
Distinct variable group:   𝑥,𝑦,𝐴

Proof of Theorem funcnv3
StepHypRef Expression
1 dfrn2 5857 . . . . . 6 ran 𝐴 = {𝑦 ∣ ∃𝑥 𝑥𝐴𝑦}
21eqabri 2898 . . . . 5 (𝑦 ∈ ran 𝐴 ↔ ∃𝑥 𝑥𝐴𝑦)
32biimpi 218 . . . 4 (𝑦 ∈ ran 𝐴 → ∃𝑥 𝑥𝐴𝑦)
43biantrurd 539 . . 3 (𝑦 ∈ ran 𝐴 → (∃*𝑥 𝑥𝐴𝑦 ↔ (∃𝑥 𝑥𝐴𝑦 ∧ ∃*𝑥 𝑥𝐴𝑦)))
54ralbiia 3100 . 2 (∀𝑦 ∈ ran 𝐴∃*𝑥 𝑥𝐴𝑦 ↔ ∀𝑦 ∈ ran 𝐴(∃𝑥 𝑥𝐴𝑦 ∧ ∃*𝑥 𝑥𝐴𝑦))
6 funcnv 6579 . 2 (Fun 𝐴 ↔ ∀𝑦 ∈ ran 𝐴∃*𝑥 𝑥𝐴𝑦)
7 df-reu 3362 . . . 4 (∃!𝑥 ∈ dom 𝐴 𝑥𝐴𝑦 ↔ ∃!𝑥(𝑥 ∈ dom 𝐴𝑥𝐴𝑦))
8 vex 3452 . . . . . . 7 𝑥 ∈ V
9 vex 3452 . . . . . . 7 𝑦 ∈ V
108, 9breldm 5877 . . . . . 6 (𝑥𝐴𝑦𝑥 ∈ dom 𝐴)
1110pm4.71ri 567 . . . . 5 (𝑥𝐴𝑦 ↔ (𝑥 ∈ dom 𝐴𝑥𝐴𝑦))
1211eubii 2606 . . . 4 (∃!𝑥 𝑥𝐴𝑦 ↔ ∃!𝑥(𝑥 ∈ dom 𝐴𝑥𝐴𝑦))
13 df-eu 2590 . . . 4 (∃!𝑥 𝑥𝐴𝑦 ↔ (∃𝑥 𝑥𝐴𝑦 ∧ ∃*𝑥 𝑥𝐴𝑦))
147, 12, 133bitr2i 301 . . 3 (∃!𝑥 ∈ dom 𝐴 𝑥𝐴𝑦 ↔ (∃𝑥 𝑥𝐴𝑦 ∧ ∃*𝑥 𝑥𝐴𝑦))
1514ralbii 3102 . 2 (∀𝑦 ∈ ran 𝐴∃!𝑥 ∈ dom 𝐴 𝑥𝐴𝑦 ↔ ∀𝑦 ∈ ran 𝐴(∃𝑥 𝑥𝐴𝑦 ∧ ∃*𝑥 𝑥𝐴𝑦))
165, 6, 153bitr4i 305 1 (Fun 𝐴 ↔ ∀𝑦 ∈ ran 𝐴∃!𝑥 ∈ dom 𝐴 𝑥𝐴𝑦)
Colors of variables: wff setvar class
Syntax hints:  wb 208  wa 398  wex 1793  wcel 2136  ∃*wmo 2558  ∃!weu 2589  wral 3070  ∃!wreu 3359   class class class wbr 5094  ccnv 5639  dom cdm 5640  ran crn 5641  Fun wfun 6504
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1809  ax-4 1823  ax-5 1924  ax-6 1981  ax-7 2022  ax-8 2138  ax-9 2146  ax-12 2206  ax-ext 2728  ax-sep 5240  ax-pr 5384
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 857  df-3an 1097  df-tru 1557  df-fal 1567  df-ex 1794  df-sb 2085  df-mo 2560  df-eu 2590  df-clab 2735  df-cleq 2748  df-clel 2831  df-ral 3071  df-rex 3081  df-reu 3362  df-rab 3409  df-v 3450  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4281  df-if 4475  df-sn 4577  df-pr 4579  df-op 4583  df-br 5095  df-opab 5157  df-id 5535  df-xp 5646  df-rel 5647  df-cnv 5648  df-co 5649  df-dm 5650  df-rn 5651  df-fun 6512
This theorem is referenced by:  cantnf2  43850
  Copyright terms: Public domain W3C validator