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 5192 | . 2 ⊢ (Fun 𝐴 ↔ (Rel 𝐴 ∧ ∀𝑤∀𝑣∀𝑢((𝑤𝐴𝑣 ∧ 𝑤𝐴𝑢) → 𝑣 = 𝑢))) | |
2 | nfcv 2306 | . . . . . . 7 ⊢ Ⅎ𝑦𝑤 | |
3 | dffun6f.2 | . . . . . . 7 ⊢ Ⅎ𝑦𝐴 | |
4 | nfcv 2306 | . . . . . . 7 ⊢ Ⅎ𝑦𝑣 | |
5 | 2, 3, 4 | nfbr 4022 | . . . . . 6 ⊢ Ⅎ𝑦 𝑤𝐴𝑣 |
6 | nfv 1515 | . . . . . 6 ⊢ Ⅎ𝑣 𝑤𝐴𝑦 | |
7 | breq2 3980 | . . . . . 6 ⊢ (𝑣 = 𝑦 → (𝑤𝐴𝑣 ↔ 𝑤𝐴𝑦)) | |
8 | 5, 6, 7 | cbvmo 2053 | . . . . 5 ⊢ (∃*𝑣 𝑤𝐴𝑣 ↔ ∃*𝑦 𝑤𝐴𝑦) |
9 | 8 | albii 1457 | . . . 4 ⊢ (∀𝑤∃*𝑣 𝑤𝐴𝑣 ↔ ∀𝑤∃*𝑦 𝑤𝐴𝑦) |
10 | breq2 3980 | . . . . . 6 ⊢ (𝑣 = 𝑢 → (𝑤𝐴𝑣 ↔ 𝑤𝐴𝑢)) | |
11 | 10 | mo4 2074 | . . . . 5 ⊢ (∃*𝑣 𝑤𝐴𝑣 ↔ ∀𝑣∀𝑢((𝑤𝐴𝑣 ∧ 𝑤𝐴𝑢) → 𝑣 = 𝑢)) |
12 | 11 | albii 1457 | . . . 4 ⊢ (∀𝑤∃*𝑣 𝑤𝐴𝑣 ↔ ∀𝑤∀𝑣∀𝑢((𝑤𝐴𝑣 ∧ 𝑤𝐴𝑢) → 𝑣 = 𝑢)) |
13 | nfcv 2306 | . . . . . . 7 ⊢ Ⅎ𝑥𝑤 | |
14 | dffun6f.1 | . . . . . . 7 ⊢ Ⅎ𝑥𝐴 | |
15 | nfcv 2306 | . . . . . . 7 ⊢ Ⅎ𝑥𝑦 | |
16 | 13, 14, 15 | nfbr 4022 | . . . . . 6 ⊢ Ⅎ𝑥 𝑤𝐴𝑦 |
17 | 16 | nfmo 2033 | . . . . 5 ⊢ Ⅎ𝑥∃*𝑦 𝑤𝐴𝑦 |
18 | nfv 1515 | . . . . 5 ⊢ Ⅎ𝑤∃*𝑦 𝑥𝐴𝑦 | |
19 | breq1 3979 | . . . . . 6 ⊢ (𝑤 = 𝑥 → (𝑤𝐴𝑦 ↔ 𝑥𝐴𝑦)) | |
20 | 19 | mobidv 2049 | . . . . 5 ⊢ (𝑤 = 𝑥 → (∃*𝑦 𝑤𝐴𝑦 ↔ ∃*𝑦 𝑥𝐴𝑦)) |
21 | 17, 18, 20 | cbval 1741 | . . . 4 ⊢ (∀𝑤∃*𝑦 𝑤𝐴𝑦 ↔ ∀𝑥∃*𝑦 𝑥𝐴𝑦) |
22 | 9, 12, 21 | 3bitr3ri 210 | . . 3 ⊢ (∀𝑥∃*𝑦 𝑥𝐴𝑦 ↔ ∀𝑤∀𝑣∀𝑢((𝑤𝐴𝑣 ∧ 𝑤𝐴𝑢) → 𝑣 = 𝑢)) |
23 | 22 | anbi2i 453 | . 2 ⊢ ((Rel 𝐴 ∧ ∀𝑥∃*𝑦 𝑥𝐴𝑦) ↔ (Rel 𝐴 ∧ ∀𝑤∀𝑣∀𝑢((𝑤𝐴𝑣 ∧ 𝑤𝐴𝑢) → 𝑣 = 𝑢))) |
24 | 1, 23 | bitr4i 186 | 1 ⊢ (Fun 𝐴 ↔ (Rel 𝐴 ∧ ∀𝑥∃*𝑦 𝑥𝐴𝑦)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ↔ wb 104 ∀wal 1340 ∃*wmo 2014 Ⅎwnfc 2293 class class class wbr 3976 Rel wrel 4603 Fun wfun 5176 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-io 699 ax-5 1434 ax-7 1435 ax-gen 1436 ax-ie1 1480 ax-ie2 1481 ax-8 1491 ax-10 1492 ax-11 1493 ax-i12 1494 ax-bndl 1496 ax-4 1497 ax-17 1513 ax-i9 1517 ax-ial 1521 ax-i5r 1522 ax-14 2138 ax-ext 2146 ax-sep 4094 ax-pow 4147 ax-pr 4181 |
This theorem depends on definitions: df-bi 116 df-3an 969 df-tru 1345 df-nf 1448 df-sb 1750 df-eu 2016 df-mo 2017 df-clab 2151 df-cleq 2157 df-clel 2160 df-nfc 2295 df-ral 2447 df-v 2723 df-un 3115 df-in 3117 df-ss 3124 df-pw 3555 df-sn 3576 df-pr 3577 df-op 3579 df-br 3977 df-opab 4038 df-id 4265 df-cnv 4606 df-co 4607 df-fun 5184 |
This theorem is referenced by: dffun6 5196 dffun4f 5198 funopab 5217 |
Copyright terms: Public domain | W3C validator |