| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > fneu | 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 |
|---|---|
| fneu | ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → ∃!𝑦 𝐵𝐹𝑦) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | funmo 5390 | . . . 4 ⊢ (Fun 𝐹 → ∃*𝑦 𝐵𝐹𝑦) | |
| 2 | 1 | adantr 276 | . . 3 ⊢ ((Fun 𝐹 ∧ 𝐵 ∈ dom 𝐹) → ∃*𝑦 𝐵𝐹𝑦) |
| 3 | eldmg 4974 | . . . . . 6 ⊢ (𝐵 ∈ dom 𝐹 → (𝐵 ∈ dom 𝐹 ↔ ∃𝑦 𝐵𝐹𝑦)) | |
| 4 | 3 | ibi 176 | . . . . 5 ⊢ (𝐵 ∈ dom 𝐹 → ∃𝑦 𝐵𝐹𝑦) |
| 5 | 4 | adantl 277 | . . . 4 ⊢ ((Fun 𝐹 ∧ 𝐵 ∈ dom 𝐹) → ∃𝑦 𝐵𝐹𝑦) |
| 6 | exmoeu2 2135 | . . . 4 ⊢ (∃𝑦 𝐵𝐹𝑦 → (∃*𝑦 𝐵𝐹𝑦 ↔ ∃!𝑦 𝐵𝐹𝑦)) | |
| 7 | 5, 6 | syl 14 | . . 3 ⊢ ((Fun 𝐹 ∧ 𝐵 ∈ dom 𝐹) → (∃*𝑦 𝐵𝐹𝑦 ↔ ∃!𝑦 𝐵𝐹𝑦)) |
| 8 | 2, 7 | mpbid 147 | . 2 ⊢ ((Fun 𝐹 ∧ 𝐵 ∈ dom 𝐹) → ∃!𝑦 𝐵𝐹𝑦) |
| 9 | 8 | funfni 5481 | 1 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → ∃!𝑦 𝐵𝐹𝑦) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 ∃wex 1545 ∃!weu 2086 ∃*wmo 2087 ∈ wcel 2209 class class class wbr 4128 dom cdm 4772 Fun wfun 5369 Fn wfn 5370 |
| 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 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-sep 4247 ax-pow 4309 ax-pr 4344 |
| This theorem depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ral 2533 df-rex 2534 df-v 2823 df-un 3224 df-in 3226 df-ss 3233 df-pw 3690 df-sn 3714 df-pr 3715 df-op 3717 df-br 4129 df-opab 4191 df-id 4436 df-xp 4778 df-rel 4779 df-cnv 4780 df-co 4781 df-dm 4782 df-fun 5377 df-fn 5378 |
| This theorem is referenced by: fneu2 5486 fnbrfvb 5738 mapsnd 6964 mapsn 6966 |
| Copyright terms: Public domain | W3C validator |