Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > funeu | GIF version |
Description: There is exactly one value of a function. (Contributed by NM, 22-Apr-2004.) (Proof shortened by Andrew Salmon, 17-Sep-2011.) |
Ref | Expression |
---|---|
funeu | ⊢ ((Fun 𝐹 ∧ 𝐴𝐹𝐵) → ∃!𝑦 𝐴𝐹𝑦) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | funrel 5140 | . . . 4 ⊢ (Fun 𝐹 → Rel 𝐹) | |
2 | releldm 4774 | . . . 4 ⊢ ((Rel 𝐹 ∧ 𝐴𝐹𝐵) → 𝐴 ∈ dom 𝐹) | |
3 | 1, 2 | sylan 281 | . . 3 ⊢ ((Fun 𝐹 ∧ 𝐴𝐹𝐵) → 𝐴 ∈ dom 𝐹) |
4 | eldmg 4734 | . . . 4 ⊢ (𝐴 ∈ dom 𝐹 → (𝐴 ∈ dom 𝐹 ↔ ∃𝑦 𝐴𝐹𝑦)) | |
5 | 4 | ibi 175 | . . 3 ⊢ (𝐴 ∈ dom 𝐹 → ∃𝑦 𝐴𝐹𝑦) |
6 | 3, 5 | syl 14 | . 2 ⊢ ((Fun 𝐹 ∧ 𝐴𝐹𝐵) → ∃𝑦 𝐴𝐹𝑦) |
7 | funmo 5138 | . . . 4 ⊢ (Fun 𝐹 → ∃*𝑦 𝐴𝐹𝑦) | |
8 | 7 | adantr 274 | . . 3 ⊢ ((Fun 𝐹 ∧ 𝐴𝐹𝐵) → ∃*𝑦 𝐴𝐹𝑦) |
9 | df-mo 2003 | . . 3 ⊢ (∃*𝑦 𝐴𝐹𝑦 ↔ (∃𝑦 𝐴𝐹𝑦 → ∃!𝑦 𝐴𝐹𝑦)) | |
10 | 8, 9 | sylib 121 | . 2 ⊢ ((Fun 𝐹 ∧ 𝐴𝐹𝐵) → (∃𝑦 𝐴𝐹𝑦 → ∃!𝑦 𝐴𝐹𝑦)) |
11 | 6, 10 | mpd 13 | 1 ⊢ ((Fun 𝐹 ∧ 𝐴𝐹𝐵) → ∃!𝑦 𝐴𝐹𝑦) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ∃wex 1468 ∈ wcel 1480 ∃!weu 1999 ∃*wmo 2000 class class class wbr 3929 dom cdm 4539 Rel wrel 4544 Fun wfun 5117 |
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 698 ax-5 1423 ax-7 1424 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-8 1482 ax-10 1483 ax-11 1484 ax-i12 1485 ax-bndl 1486 ax-4 1487 ax-14 1492 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2121 ax-sep 4046 ax-pow 4098 ax-pr 4131 |
This theorem depends on definitions: df-bi 116 df-3an 964 df-tru 1334 df-nf 1437 df-sb 1736 df-eu 2002 df-mo 2003 df-clab 2126 df-cleq 2132 df-clel 2135 df-nfc 2270 df-ral 2421 df-rex 2422 df-v 2688 df-un 3075 df-in 3077 df-ss 3084 df-pw 3512 df-sn 3533 df-pr 3534 df-op 3536 df-br 3930 df-opab 3990 df-id 4215 df-xp 4545 df-rel 4546 df-cnv 4547 df-co 4548 df-dm 4549 df-fun 5125 |
This theorem is referenced by: funeu2 5149 funbrfv 5460 |
Copyright terms: Public domain | W3C validator |