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

Theorem dffun6f 6055
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 6052 . 2 (Fun 𝐴 ↔ (Rel 𝐴 ∧ ∀𝑤𝑢𝑣(𝑤𝐴𝑣𝑣 = 𝑢)))
2 nfcv 2894 . . . . . . 7 𝑦𝑤
3 dffun6f.2 . . . . . . 7 𝑦𝐴
4 nfcv 2894 . . . . . . 7 𝑦𝑣
52, 3, 4nfbr 4843 . . . . . 6 𝑦 𝑤𝐴𝑣
6 nfv 1984 . . . . . 6 𝑣 𝑤𝐴𝑦
7 breq2 4800 . . . . . 6 (𝑣 = 𝑦 → (𝑤𝐴𝑣𝑤𝐴𝑦))
85, 6, 7cbvmo 2636 . . . . 5 (∃*𝑣 𝑤𝐴𝑣 ↔ ∃*𝑦 𝑤𝐴𝑦)
98albii 1888 . . . 4 (∀𝑤∃*𝑣 𝑤𝐴𝑣 ↔ ∀𝑤∃*𝑦 𝑤𝐴𝑦)
10 mo2v 2606 . . . . 5 (∃*𝑣 𝑤𝐴𝑣 ↔ ∃𝑢𝑣(𝑤𝐴𝑣𝑣 = 𝑢))
1110albii 1888 . . . 4 (∀𝑤∃*𝑣 𝑤𝐴𝑣 ↔ ∀𝑤𝑢𝑣(𝑤𝐴𝑣𝑣 = 𝑢))
12 nfcv 2894 . . . . . . 7 𝑥𝑤
13 dffun6f.1 . . . . . . 7 𝑥𝐴
14 nfcv 2894 . . . . . . 7 𝑥𝑦
1512, 13, 14nfbr 4843 . . . . . 6 𝑥 𝑤𝐴𝑦
1615nfmo 2616 . . . . 5 𝑥∃*𝑦 𝑤𝐴𝑦
17 nfv 1984 . . . . 5 𝑤∃*𝑦 𝑥𝐴𝑦
18 breq1 4799 . . . . . 6 (𝑤 = 𝑥 → (𝑤𝐴𝑦𝑥𝐴𝑦))
1918mobidv 2620 . . . . 5 (𝑤 = 𝑥 → (∃*𝑦 𝑤𝐴𝑦 ↔ ∃*𝑦 𝑥𝐴𝑦))
2016, 17, 19cbval 2408 . . . 4 (∀𝑤∃*𝑦 𝑤𝐴𝑦 ↔ ∀𝑥∃*𝑦 𝑥𝐴𝑦)
219, 11, 203bitr3ri 291 . . 3 (∀𝑥∃*𝑦 𝑥𝐴𝑦 ↔ ∀𝑤𝑢𝑣(𝑤𝐴𝑣𝑣 = 𝑢))
2221anbi2i 732 . 2 ((Rel 𝐴 ∧ ∀𝑥∃*𝑦 𝑥𝐴𝑦) ↔ (Rel 𝐴 ∧ ∀𝑤𝑢𝑣(𝑤𝐴𝑣𝑣 = 𝑢)))
231, 22bitr4i 267 1 (Fun 𝐴 ↔ (Rel 𝐴 ∧ ∀𝑥∃*𝑦 𝑥𝐴𝑦))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 196  wa 383  wal 1622  wex 1845  ∃*wmo 2600  wnfc 2881   class class class wbr 4796  Rel wrel 5263  Fun wfun 6035
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1863  ax-4 1878  ax-5 1980  ax-6 2046  ax-7 2082  ax-9 2140  ax-10 2160  ax-11 2175  ax-12 2188  ax-13 2383  ax-ext 2732  ax-sep 4925  ax-nul 4933  ax-pr 5047
This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3an 1074  df-tru 1627  df-ex 1846  df-nf 1851  df-sb 2039  df-eu 2603  df-mo 2604  df-clab 2739  df-cleq 2745  df-clel 2748  df-nfc 2883  df-ral 3047  df-rab 3051  df-v 3334  df-dif 3710  df-un 3712  df-in 3714  df-ss 3721  df-nul 4051  df-if 4223  df-sn 4314  df-pr 4316  df-op 4320  df-br 4797  df-opab 4857  df-id 5166  df-cnv 5266  df-co 5267  df-fun 6043
This theorem is referenced by:  dffun6  6056  funopab  6076  funcnvmptOLD  29768  funcnvmpt  29769  dffun3f  42931
  Copyright terms: Public domain W3C validator