| 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 5329 | . . . 4 ⊢ (Fun 𝐹 → ∃*𝑦 𝐵𝐹𝑦) | |
| 2 | 1 | adantr 276 | . . 3 ⊢ ((Fun 𝐹 ∧ 𝐵 ∈ dom 𝐹) → ∃*𝑦 𝐵𝐹𝑦) |
| 3 | eldmg 4915 | . . . . . 6 ⊢ (𝐵 ∈ dom 𝐹 → (𝐵 ∈ dom 𝐹 ↔ ∃𝑦 𝐵𝐹𝑦)) | |
| 4 | 3 | ibi 176 | . . . . 5 ⊢ (𝐵 ∈ dom 𝐹 → ∃𝑦 𝐵𝐹𝑦) |
| 5 | 4 | adantl 277 | . . . 4 ⊢ ((Fun 𝐹 ∧ 𝐵 ∈ dom 𝐹) → ∃𝑦 𝐵𝐹𝑦) |
| 6 | exmoeu2 2126 | . . . 4 ⊢ (∃𝑦 𝐵𝐹𝑦 → (∃*𝑦 𝐵𝐹𝑦 ↔ ∃!𝑦 𝐵𝐹𝑦)) | |
| 7 | 5, 6 | syl 14 | . . 3 ⊢ ((Fun 𝐹 ∧ 𝐵 ∈ dom 𝐹) → (∃*𝑦 𝐵𝐹𝑦 ↔ ∃!𝑦 𝐵𝐹𝑦)) |
| 8 | 2, 7 | mpbid 147 | . 2 ⊢ ((Fun 𝐹 ∧ 𝐵 ∈ dom 𝐹) → ∃!𝑦 𝐵𝐹𝑦) |
| 9 | 8 | funfni 5419 | 1 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → ∃!𝑦 𝐵𝐹𝑦) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 ∃wex 1538 ∃!weu 2077 ∃*wmo 2078 ∈ wcel 2200 class class class wbr 4082 dom cdm 4716 Fun wfun 5308 Fn wfn 5309 |
| 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 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-14 2203 ax-ext 2211 ax-sep 4201 ax-pow 4257 ax-pr 4292 |
| This theorem depends on definitions: df-bi 117 df-3an 1004 df-tru 1398 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ral 2513 df-rex 2514 df-v 2801 df-un 3201 df-in 3203 df-ss 3210 df-pw 3651 df-sn 3672 df-pr 3673 df-op 3675 df-br 4083 df-opab 4145 df-id 4381 df-xp 4722 df-rel 4723 df-cnv 4724 df-co 4725 df-dm 4726 df-fun 5316 df-fn 5317 |
| This theorem is referenced by: fneu2 5424 fnbrfvb 5666 mapsn 6827 |
| Copyright terms: Public domain | W3C validator |