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

Theorem dffun6f 6540
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 6537 . 2 (Fun 𝐴 ↔ (Rel 𝐴 ∧ ∀𝑤𝑢𝑣(𝑤𝐴𝑣𝑣 = 𝑢)))
2 nfcv 2927 . . . . . . 7 𝑦𝑤
3 dffun6f.2 . . . . . . 7 𝑦𝐴
4 nfcv 2927 . . . . . . 7 𝑦𝑣
52, 3, 4nfbr 5151 . . . . . 6 𝑦 𝑤𝐴𝑣
6 nfv 1937 . . . . . 6 𝑣 𝑤𝐴𝑦
7 breq2 5108 . . . . . 6 (𝑣 = 𝑦 → (𝑤𝐴𝑣𝑤𝐴𝑦))
85, 6, 7cbvmow 2633 . . . . 5 (∃*𝑣 𝑤𝐴𝑣 ↔ ∃*𝑦 𝑤𝐴𝑦)
98albii 1842 . . . 4 (∀𝑤∃*𝑣 𝑤𝐴𝑣 ↔ ∀𝑤∃*𝑦 𝑤𝐴𝑦)
10 dfmo 2570 . . . . 5 (∃*𝑣 𝑤𝐴𝑣 ↔ ∃𝑢𝑣(𝑤𝐴𝑣𝑣 = 𝑢))
1110albii 1842 . . . 4 (∀𝑤∃*𝑣 𝑤𝐴𝑣 ↔ ∀𝑤𝑢𝑣(𝑤𝐴𝑣𝑣 = 𝑢))
12 nfcv 2927 . . . . . . 7 𝑥𝑤
13 dffun6f.1 . . . . . . 7 𝑥𝐴
14 nfcv 2927 . . . . . . 7 𝑥𝑦
1512, 13, 14nfbr 5151 . . . . . 6 𝑥 𝑤𝐴𝑦
1615nfmov 2590 . . . . 5 𝑥∃*𝑦 𝑤𝐴𝑦
17 nfv 1937 . . . . 5 𝑤∃*𝑦 𝑥𝐴𝑦
18 breq1 5107 . . . . . 6 (𝑤 = 𝑥 → (𝑤𝐴𝑦𝑥𝐴𝑦))
1918mobidv 2579 . . . . 5 (𝑤 = 𝑥 → (∃*𝑦 𝑤𝐴𝑦 ↔ ∃*𝑦 𝑥𝐴𝑦))
2016, 17, 19cbvalv1 2375 . . . 4 (∀𝑤∃*𝑦 𝑤𝐴𝑦 ↔ ∀𝑥∃*𝑦 𝑥𝐴𝑦)
219, 11, 203bitr3ri 305 . . 3 (∀𝑥∃*𝑦 𝑥𝐴𝑦 ↔ ∀𝑤𝑢𝑣(𝑤𝐴𝑣𝑣 = 𝑢))
2221anbi2i 634 . 2 ((Rel 𝐴 ∧ ∀𝑥∃*𝑦 𝑥𝐴𝑦) ↔ (Rel 𝐴 ∧ ∀𝑤𝑢𝑣(𝑤𝐴𝑣𝑣 = 𝑢)))
231, 22bitr4i 281 1 (Fun 𝐴 ↔ (Rel 𝐴 ∧ ∀𝑥∃*𝑦 𝑥𝐴𝑦))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 400  wal 1561  wex 1802  ∃*wmo 2567  wnfc 2912   class class class wbr 5104  Rel wrel 5656  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-10 2178  ax-11 2194  ax-12 2215  ax-ext 2737  ax-sep 5250  ax-pr 5394
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-nf 1807  df-sb 2094  df-mo 2569  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ral 3080  df-rex 3090  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 5105  df-opab 5167  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-fun 6527
This theorem is referenced by:  funopab  6560  funcnvmpt  6981  dffun3f  50312
  Copyright terms: Public domain W3C validator