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

Theorem dffun6f 6530
Description: Definition of function, using bound-variable hypotheses instead of distinct variable conditions. (Contributed by NM, 9-Mar-1995.) (Revised by Mario Carneiro, 15-Oct-2016.)
Hypotheses
Ref Expression
dffun6f.1 𝑥𝐴
dffun6f.2 𝑦𝐴
Assertion
Ref Expression
dffun6f (Fun 𝐴 ↔ (Rel 𝐴 ∧ ∀𝑥∃*𝑦 𝑥𝐴𝑦))
Distinct variable group:   𝑥,𝑦
Allowed substitution hints:   𝐴(𝑥,𝑦)

Proof of Theorem dffun6f
Dummy variables 𝑤 𝑣 𝑢 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 dffun3 6527 . 2 (Fun 𝐴 ↔ (Rel 𝐴 ∧ ∀𝑤𝑢𝑣(𝑤𝐴𝑣𝑣 = 𝑢)))
2 nfcv 2923 . . . . . . 7 𝑦𝑤
3 dffun6f.2 . . . . . . 7 𝑦𝐴
4 nfcv 2923 . . . . . . 7 𝑦𝑣
52, 3, 4nfbr 5144 . . . . . 6 𝑦 𝑤𝐴𝑣
6 nfv 1933 . . . . . 6 𝑣 𝑤𝐴𝑦
7 breq2 5101 . . . . . 6 (𝑣 = 𝑦 → (𝑤𝐴𝑣𝑤𝐴𝑦))
85, 6, 7cbvmow 2629 . . . . 5 (∃*𝑣 𝑤𝐴𝑣 ↔ ∃*𝑦 𝑤𝐴𝑦)
98albii 1838 . . . 4 (∀𝑤∃*𝑣 𝑤𝐴𝑣 ↔ ∀𝑤∃*𝑦 𝑤𝐴𝑦)
10 dfmo 2566 . . . . 5 (∃*𝑣 𝑤𝐴𝑣 ↔ ∃𝑢𝑣(𝑤𝐴𝑣𝑣 = 𝑢))
1110albii 1838 . . . 4 (∀𝑤∃*𝑣 𝑤𝐴𝑣 ↔ ∀𝑤𝑢𝑣(𝑤𝐴𝑣𝑣 = 𝑢))
12 nfcv 2923 . . . . . . 7 𝑥𝑤
13 dffun6f.1 . . . . . . 7 𝑥𝐴
14 nfcv 2923 . . . . . . 7 𝑥𝑦
1512, 13, 14nfbr 5144 . . . . . 6 𝑥 𝑤𝐴𝑦
1615nfmov 2586 . . . . 5 𝑥∃*𝑦 𝑤𝐴𝑦
17 nfv 1933 . . . . 5 𝑤∃*𝑦 𝑥𝐴𝑦
18 breq1 5100 . . . . . 6 (𝑤 = 𝑥 → (𝑤𝐴𝑦𝑥𝐴𝑦))
1918mobidv 2575 . . . . 5 (𝑤 = 𝑥 → (∃*𝑦 𝑤𝐴𝑦 ↔ ∃*𝑦 𝑥𝐴𝑦))
2016, 17, 19cbvalv1 2371 . . . 4 (∀𝑤∃*𝑦 𝑤𝐴𝑦 ↔ ∀𝑥∃*𝑦 𝑥𝐴𝑦)
219, 11, 203bitr3ri 304 . . 3 (∀𝑥∃*𝑦 𝑥𝐴𝑦 ↔ ∀𝑤𝑢𝑣(𝑤𝐴𝑣𝑣 = 𝑢))
2221anbi2i 632 . 2 ((Rel 𝐴 ∧ ∀𝑥∃*𝑦 𝑥𝐴𝑦) ↔ (Rel 𝐴 ∧ ∀𝑤𝑢𝑣(𝑤𝐴𝑣𝑣 = 𝑢)))
231, 22bitr4i 280 1 (Fun 𝐴 ↔ (Rel 𝐴 ∧ ∀𝑥∃*𝑦 𝑥𝐴𝑦))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 399  wal 1557  wex 1798  ∃*wmo 2563  wnfc 2908   class class class wbr 5097  Rel wrel 5648  Fun wfun 6509
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-sep 5243  ax-pr 5387
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-nf 1803  df-sb 2090  df-mo 2565  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ral 3076  df-rex 3086  df-rab 3414  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4284  df-if 4478  df-sn 4580  df-pr 4582  df-op 4586  df-br 5098  df-opab 5160  df-id 5538  df-xp 5649  df-rel 5650  df-cnv 5651  df-co 5652  df-fun 6517
This theorem is referenced by:  funopab  6550  funcnvmpt  6971  dffun3f  50263
  Copyright terms: Public domain W3C validator