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

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

Proof of Theorem funcnv3
StepHypRef Expression
1 dfrn2 5869 . . . . . 6 ran 𝐴 = {𝑦 ∣ ∃𝑥 𝑥𝐴𝑦}
21eqabri 2907 . . . . 5 (𝑦 ∈ ran 𝐴 ↔ ∃𝑥 𝑥𝐴𝑦)
32biimpi 219 . . . 4 (𝑦 ∈ ran 𝐴 → ∃𝑥 𝑥𝐴𝑦)
43biantrurd 541 . . 3 (𝑦 ∈ ran 𝐴 → (∃*𝑥 𝑥𝐴𝑦 ↔ (∃𝑥 𝑥𝐴𝑦 ∧ ∃*𝑥 𝑥𝐴𝑦)))
54ralbiia 3109 . 2 (∀𝑦 ∈ ran 𝐴∃*𝑥 𝑥𝐴𝑦 ↔ ∀𝑦 ∈ ran 𝐴(∃𝑥 𝑥𝐴𝑦 ∧ ∃*𝑥 𝑥𝐴𝑦))
6 funcnv 6594 . 2 (Fun 𝐴 ↔ ∀𝑦 ∈ ran 𝐴∃*𝑥 𝑥𝐴𝑦)
7 df-reu 3371 . . . 4 (∃!𝑥 ∈ dom 𝐴 𝑥𝐴𝑦 ↔ ∃!𝑥(𝑥 ∈ dom 𝐴𝑥𝐴𝑦))
8 vex 3461 . . . . . . 7 𝑥 ∈ V
9 vex 3461 . . . . . . 7 𝑦 ∈ V
108, 9breldm 5889 . . . . . 6 (𝑥𝐴𝑦𝑥 ∈ dom 𝐴)
1110pm4.71ri 569 . . . . 5 (𝑥𝐴𝑦 ↔ (𝑥 ∈ dom 𝐴𝑥𝐴𝑦))
1211eubii 2615 . . . 4 (∃!𝑥 𝑥𝐴𝑦 ↔ ∃!𝑥(𝑥 ∈ dom 𝐴𝑥𝐴𝑦))
13 df-eu 2599 . . . 4 (∃!𝑥 𝑥𝐴𝑦 ↔ (∃𝑥 𝑥𝐴𝑦 ∧ ∃*𝑥 𝑥𝐴𝑦))
147, 12, 133bitr2i 302 . . 3 (∃!𝑥 ∈ dom 𝐴 𝑥𝐴𝑦 ↔ (∃𝑥 𝑥𝐴𝑦 ∧ ∃*𝑥 𝑥𝐴𝑦))
1514ralbii 3111 . 2 (∀𝑦 ∈ ran 𝐴∃!𝑥 ∈ dom 𝐴 𝑥𝐴𝑦 ↔ ∀𝑦 ∈ ran 𝐴(∃𝑥 𝑥𝐴𝑦 ∧ ∃*𝑥 𝑥𝐴𝑦))
165, 6, 153bitr4i 306 1 (Fun 𝐴 ↔ ∀𝑦 ∈ ran 𝐴∃!𝑥 ∈ dom 𝐴 𝑥𝐴𝑦)
Colors of variables: wff setvar class
Syntax hints:  wb 209  wa 400  wex 1802  wcel 2145  ∃*wmo 2567  ∃!weu 2598  wral 3079  ∃!wreu 3368   class class class wbr 5105  ccnv 5651  dom cdm 5652  ran crn 5653  Fun wfun 6519
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155  ax-12 2215  ax-ext 2737  ax-sep 5251  ax-pr 5395
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1566  df-fal 1576  df-ex 1803  df-sb 2094  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-ral 3080  df-rex 3090  df-reu 3371  df-rab 3418  df-v 3459  df-dif 3910  df-un 3912  df-in 3914  df-ss 3924  df-nul 4289  df-if 4484  df-sn 4586  df-pr 4588  df-op 4592  df-br 5106  df-opab 5168  df-id 5547  df-xp 5658  df-rel 5659  df-cnv 5660  df-co 5661  df-dm 5662  df-rn 5663  df-fun 6527
This theorem is referenced by:  cantnf2  43914
  Copyright terms: Public domain W3C validator