![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > dffun7 | Structured version Visualization version GIF version |
Description: Alternate definition of a function. One possibility for the definition of a function in [Enderton] p. 42. (Enderton's definition is ambiguous because "there is only one" could mean either "there is at most one" or "there is exactly one". However, dffun8 6596 shows that it does not matter which meaning we pick.) (Contributed by NM, 4-Nov-2002.) |
Ref | Expression |
---|---|
dffun7 | ⊢ (Fun 𝐴 ↔ (Rel 𝐴 ∧ ∀𝑥 ∈ dom 𝐴∃*𝑦 𝑥𝐴𝑦)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | dffun6 6576 | . 2 ⊢ (Fun 𝐴 ↔ (Rel 𝐴 ∧ ∀𝑥∃*𝑦 𝑥𝐴𝑦)) | |
2 | moabs 2541 | . . . . . 6 ⊢ (∃*𝑦 𝑥𝐴𝑦 ↔ (∃𝑦 𝑥𝐴𝑦 → ∃*𝑦 𝑥𝐴𝑦)) | |
3 | vex 3482 | . . . . . . . 8 ⊢ 𝑥 ∈ V | |
4 | 3 | eldm 5914 | . . . . . . 7 ⊢ (𝑥 ∈ dom 𝐴 ↔ ∃𝑦 𝑥𝐴𝑦) |
5 | 4 | imbi1i 349 | . . . . . 6 ⊢ ((𝑥 ∈ dom 𝐴 → ∃*𝑦 𝑥𝐴𝑦) ↔ (∃𝑦 𝑥𝐴𝑦 → ∃*𝑦 𝑥𝐴𝑦)) |
6 | 2, 5 | bitr4i 278 | . . . . 5 ⊢ (∃*𝑦 𝑥𝐴𝑦 ↔ (𝑥 ∈ dom 𝐴 → ∃*𝑦 𝑥𝐴𝑦)) |
7 | 6 | albii 1816 | . . . 4 ⊢ (∀𝑥∃*𝑦 𝑥𝐴𝑦 ↔ ∀𝑥(𝑥 ∈ dom 𝐴 → ∃*𝑦 𝑥𝐴𝑦)) |
8 | df-ral 3060 | . . . 4 ⊢ (∀𝑥 ∈ dom 𝐴∃*𝑦 𝑥𝐴𝑦 ↔ ∀𝑥(𝑥 ∈ dom 𝐴 → ∃*𝑦 𝑥𝐴𝑦)) | |
9 | 7, 8 | bitr4i 278 | . . 3 ⊢ (∀𝑥∃*𝑦 𝑥𝐴𝑦 ↔ ∀𝑥 ∈ dom 𝐴∃*𝑦 𝑥𝐴𝑦) |
10 | 9 | anbi2i 623 | . 2 ⊢ ((Rel 𝐴 ∧ ∀𝑥∃*𝑦 𝑥𝐴𝑦) ↔ (Rel 𝐴 ∧ ∀𝑥 ∈ dom 𝐴∃*𝑦 𝑥𝐴𝑦)) |
11 | 1, 10 | bitri 275 | 1 ⊢ (Fun 𝐴 ↔ (Rel 𝐴 ∧ ∀𝑥 ∈ dom 𝐴∃*𝑦 𝑥𝐴𝑦)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∀wal 1535 ∃wex 1776 ∈ wcel 2106 ∃*wmo 2536 ∀wral 3059 class class class wbr 5148 dom cdm 5689 Rel wrel 5694 Fun wfun 6557 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1908 ax-6 1965 ax-7 2005 ax-8 2108 ax-9 2116 ax-ext 2706 ax-sep 5302 ax-nul 5312 ax-pr 5438 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1540 df-fal 1550 df-ex 1777 df-sb 2063 df-mo 2538 df-clab 2713 df-cleq 2727 df-clel 2814 df-ral 3060 df-rex 3069 df-rab 3434 df-v 3480 df-dif 3966 df-un 3968 df-ss 3980 df-nul 4340 df-if 4532 df-sn 4632 df-pr 4634 df-op 4638 df-br 5149 df-opab 5211 df-id 5583 df-xp 5695 df-rel 5696 df-cnv 5697 df-co 5698 df-dm 5699 df-fun 6565 |
This theorem is referenced by: dffun8 6596 dffun9 6597 brdom5 10567 imasaddfnlem 17575 imasvscafn 17584 funressnfv 46993 |
Copyright terms: Public domain | W3C validator |