ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  dffun6f GIF version

Theorem dffun6f 5390
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 dffun2 5387 . 2 (Fun 𝐴 ↔ (Rel 𝐴 ∧ ∀𝑤𝑣𝑢((𝑤𝐴𝑣𝑤𝐴𝑢) → 𝑣 = 𝑢)))
2 nfcv 2392 . . . . . . 7 𝑦𝑤
3 dffun6f.2 . . . . . . 7 𝑦𝐴
4 nfcv 2392 . . . . . . 7 𝑦𝑣
52, 3, 4nfbr 4177 . . . . . 6 𝑦 𝑤𝐴𝑣
6 nfv 1581 . . . . . 6 𝑣 𝑤𝐴𝑦
7 breq2 4134 . . . . . 6 (𝑣 = 𝑦 → (𝑤𝐴𝑣𝑤𝐴𝑦))
85, 6, 7cbvmo 2126 . . . . 5 (∃*𝑣 𝑤𝐴𝑣 ↔ ∃*𝑦 𝑤𝐴𝑦)
98albii 1523 . . . 4 (∀𝑤∃*𝑣 𝑤𝐴𝑣 ↔ ∀𝑤∃*𝑦 𝑤𝐴𝑦)
10 breq2 4134 . . . . . 6 (𝑣 = 𝑢 → (𝑤𝐴𝑣𝑤𝐴𝑢))
1110mo4 2148 . . . . 5 (∃*𝑣 𝑤𝐴𝑣 ↔ ∀𝑣𝑢((𝑤𝐴𝑣𝑤𝐴𝑢) → 𝑣 = 𝑢))
1211albii 1523 . . . 4 (∀𝑤∃*𝑣 𝑤𝐴𝑣 ↔ ∀𝑤𝑣𝑢((𝑤𝐴𝑣𝑤𝐴𝑢) → 𝑣 = 𝑢))
13 nfcv 2392 . . . . . . 7 𝑥𝑤
14 dffun6f.1 . . . . . . 7 𝑥𝐴
15 nfcv 2392 . . . . . . 7 𝑥𝑦
1613, 14, 15nfbr 4177 . . . . . 6 𝑥 𝑤𝐴𝑦
1716nfmo 2106 . . . . 5 𝑥∃*𝑦 𝑤𝐴𝑦
18 nfv 1581 . . . . 5 𝑤∃*𝑦 𝑥𝐴𝑦
19 breq1 4133 . . . . . 6 (𝑤 = 𝑥 → (𝑤𝐴𝑦𝑥𝐴𝑦))
2019mobidv 2122 . . . . 5 (𝑤 = 𝑥 → (∃*𝑦 𝑤𝐴𝑦 ↔ ∃*𝑦 𝑥𝐴𝑦))
2117, 18, 20cbval 1807 . . . 4 (∀𝑤∃*𝑦 𝑤𝐴𝑦 ↔ ∀𝑥∃*𝑦 𝑥𝐴𝑦)
229, 12, 213bitr3ri 211 . . 3 (∀𝑥∃*𝑦 𝑥𝐴𝑦 ↔ ∀𝑤𝑣𝑢((𝑤𝐴𝑣𝑤𝐴𝑢) → 𝑣 = 𝑢))
2322anbi2i 461 . 2 ((Rel 𝐴 ∧ ∀𝑥∃*𝑦 𝑥𝐴𝑦) ↔ (Rel 𝐴 ∧ ∀𝑤𝑣𝑢((𝑤𝐴𝑣𝑤𝐴𝑢) → 𝑣 = 𝑢)))
241, 23bitr4i 187 1 (Fun 𝐴 ↔ (Rel 𝐴 ∧ ∀𝑥∃*𝑦 𝑥𝐴𝑦))
Colors of variables:    wff set class
This proof depends on syntax axioms:  wi 4  wa 104  wb 105  wal 1400  ∃*wmo 2087  wnfc 2379   class class class wbr 4130  Rel wrel 4779  Fun wfun 5371
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-v 2823  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-br 4131  df-opab 4193  df-id 4438  df-cnv 4782  df-co 4783  df-fun 5379
This theorem is used by:  dffun6  5391  dffun4f  5393  funopab  5412
  Copyright terms: Public domain W3C validator