![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > dffun6f | GIF version |
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.) |
Ref | Expression |
---|---|
dffun6f.1 | ⊢ Ⅎ𝑥𝐴 |
dffun6f.2 | ⊢ Ⅎ𝑦𝐴 |
Ref | Expression |
---|---|
dffun6f | ⊢ (Fun 𝐴 ↔ (Rel 𝐴 ∧ ∀𝑥∃*𝑦 𝑥𝐴𝑦)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | dffun2 5256 | . 2 ⊢ (Fun 𝐴 ↔ (Rel 𝐴 ∧ ∀𝑤∀𝑣∀𝑢((𝑤𝐴𝑣 ∧ 𝑤𝐴𝑢) → 𝑣 = 𝑢))) | |
2 | nfcv 2336 | . . . . . . 7 ⊢ Ⅎ𝑦𝑤 | |
3 | dffun6f.2 | . . . . . . 7 ⊢ Ⅎ𝑦𝐴 | |
4 | nfcv 2336 | . . . . . . 7 ⊢ Ⅎ𝑦𝑣 | |
5 | 2, 3, 4 | nfbr 4075 | . . . . . 6 ⊢ Ⅎ𝑦 𝑤𝐴𝑣 |
6 | nfv 1539 | . . . . . 6 ⊢ Ⅎ𝑣 𝑤𝐴𝑦 | |
7 | breq2 4033 | . . . . . 6 ⊢ (𝑣 = 𝑦 → (𝑤𝐴𝑣 ↔ 𝑤𝐴𝑦)) | |
8 | 5, 6, 7 | cbvmo 2082 | . . . . 5 ⊢ (∃*𝑣 𝑤𝐴𝑣 ↔ ∃*𝑦 𝑤𝐴𝑦) |
9 | 8 | albii 1481 | . . . 4 ⊢ (∀𝑤∃*𝑣 𝑤𝐴𝑣 ↔ ∀𝑤∃*𝑦 𝑤𝐴𝑦) |
10 | breq2 4033 | . . . . . 6 ⊢ (𝑣 = 𝑢 → (𝑤𝐴𝑣 ↔ 𝑤𝐴𝑢)) | |
11 | 10 | mo4 2103 | . . . . 5 ⊢ (∃*𝑣 𝑤𝐴𝑣 ↔ ∀𝑣∀𝑢((𝑤𝐴𝑣 ∧ 𝑤𝐴𝑢) → 𝑣 = 𝑢)) |
12 | 11 | albii 1481 | . . . 4 ⊢ (∀𝑤∃*𝑣 𝑤𝐴𝑣 ↔ ∀𝑤∀𝑣∀𝑢((𝑤𝐴𝑣 ∧ 𝑤𝐴𝑢) → 𝑣 = 𝑢)) |
13 | nfcv 2336 | . . . . . . 7 ⊢ Ⅎ𝑥𝑤 | |
14 | dffun6f.1 | . . . . . . 7 ⊢ Ⅎ𝑥𝐴 | |
15 | nfcv 2336 | . . . . . . 7 ⊢ Ⅎ𝑥𝑦 | |
16 | 13, 14, 15 | nfbr 4075 | . . . . . 6 ⊢ Ⅎ𝑥 𝑤𝐴𝑦 |
17 | 16 | nfmo 2062 | . . . . 5 ⊢ Ⅎ𝑥∃*𝑦 𝑤𝐴𝑦 |
18 | nfv 1539 | . . . . 5 ⊢ Ⅎ𝑤∃*𝑦 𝑥𝐴𝑦 | |
19 | breq1 4032 | . . . . . 6 ⊢ (𝑤 = 𝑥 → (𝑤𝐴𝑦 ↔ 𝑥𝐴𝑦)) | |
20 | 19 | mobidv 2078 | . . . . 5 ⊢ (𝑤 = 𝑥 → (∃*𝑦 𝑤𝐴𝑦 ↔ ∃*𝑦 𝑥𝐴𝑦)) |
21 | 17, 18, 20 | cbval 1765 | . . . 4 ⊢ (∀𝑤∃*𝑦 𝑤𝐴𝑦 ↔ ∀𝑥∃*𝑦 𝑥𝐴𝑦) |
22 | 9, 12, 21 | 3bitr3ri 211 | . . 3 ⊢ (∀𝑥∃*𝑦 𝑥𝐴𝑦 ↔ ∀𝑤∀𝑣∀𝑢((𝑤𝐴𝑣 ∧ 𝑤𝐴𝑢) → 𝑣 = 𝑢)) |
23 | 22 | anbi2i 457 | . 2 ⊢ ((Rel 𝐴 ∧ ∀𝑥∃*𝑦 𝑥𝐴𝑦) ↔ (Rel 𝐴 ∧ ∀𝑤∀𝑣∀𝑢((𝑤𝐴𝑣 ∧ 𝑤𝐴𝑢) → 𝑣 = 𝑢))) |
24 | 1, 23 | bitr4i 187 | 1 ⊢ (Fun 𝐴 ↔ (Rel 𝐴 ∧ ∀𝑥∃*𝑦 𝑥𝐴𝑦)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 ∀wal 1362 ∃*wmo 2043 Ⅎwnfc 2323 class class class wbr 4029 Rel wrel 4660 Fun wfun 5240 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 710 ax-5 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-14 2167 ax-ext 2175 ax-sep 4147 ax-pow 4203 ax-pr 4238 |
This theorem depends on definitions: df-bi 117 df-3an 982 df-tru 1367 df-nf 1472 df-sb 1774 df-eu 2045 df-mo 2046 df-clab 2180 df-cleq 2186 df-clel 2189 df-nfc 2325 df-ral 2477 df-v 2762 df-un 3157 df-in 3159 df-ss 3166 df-pw 3603 df-sn 3624 df-pr 3625 df-op 3627 df-br 4030 df-opab 4091 df-id 4322 df-cnv 4663 df-co 4664 df-fun 5248 |
This theorem is referenced by: dffun6 5260 dffun4f 5262 funopab 5281 |
Copyright terms: Public domain | W3C validator |