![]() |
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 5148 | . . . 4 ⊢ (Fun 𝐹 → Rel 𝐹) | |
2 | releldm 4782 | . . . 4 ⊢ ((Rel 𝐹 ∧ 𝐴𝐹𝐵) → 𝐴 ∈ dom 𝐹) | |
3 | 1, 2 | sylan 281 | . . 3 ⊢ ((Fun 𝐹 ∧ 𝐴𝐹𝐵) → 𝐴 ∈ dom 𝐹) |
4 | eldmg 4742 | . . . 4 ⊢ (𝐴 ∈ dom 𝐹 → (𝐴 ∈ dom 𝐹 ↔ ∃𝑦 𝐴𝐹𝑦)) | |
5 | 4 | ibi 175 | . . 3 ⊢ (𝐴 ∈ dom 𝐹 → ∃𝑦 𝐴𝐹𝑦) |
6 | 3, 5 | syl 14 | . 2 ⊢ ((Fun 𝐹 ∧ 𝐴𝐹𝐵) → ∃𝑦 𝐴𝐹𝑦) |
7 | funmo 5146 | . . . 4 ⊢ (Fun 𝐹 → ∃*𝑦 𝐴𝐹𝑦) | |
8 | 7 | adantr 274 | . . 3 ⊢ ((Fun 𝐹 ∧ 𝐴𝐹𝐵) → ∃*𝑦 𝐴𝐹𝑦) |
9 | df-mo 2004 | . . 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 1469 ∈ wcel 1481 ∃!weu 2000 ∃*wmo 2001 class class class wbr 3937 dom cdm 4547 Rel wrel 4552 Fun wfun 5125 |
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 1424 ax-7 1425 ax-gen 1426 ax-ie1 1470 ax-ie2 1471 ax-8 1483 ax-10 1484 ax-11 1485 ax-i12 1486 ax-bndl 1487 ax-4 1488 ax-14 1493 ax-17 1507 ax-i9 1511 ax-ial 1515 ax-i5r 1516 ax-ext 2122 ax-sep 4054 ax-pow 4106 ax-pr 4139 |
This theorem depends on definitions: df-bi 116 df-3an 965 df-tru 1335 df-nf 1438 df-sb 1737 df-eu 2003 df-mo 2004 df-clab 2127 df-cleq 2133 df-clel 2136 df-nfc 2271 df-ral 2422 df-rex 2423 df-v 2691 df-un 3080 df-in 3082 df-ss 3089 df-pw 3517 df-sn 3538 df-pr 3539 df-op 3541 df-br 3938 df-opab 3998 df-id 4223 df-xp 4553 df-rel 4554 df-cnv 4555 df-co 4556 df-dm 4557 df-fun 5133 |
This theorem is referenced by: funeu2 5157 funbrfv 5468 |
Copyright terms: Public domain | W3C validator |