| 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 5366 | . . . 4 ⊢ (Fun 𝐹 → ∃*𝑦 𝐵𝐹𝑦) | |
| 2 | 1 | adantr 276 | . . 3 ⊢ ((Fun 𝐹 ∧ 𝐵 ∈ dom 𝐹) → ∃*𝑦 𝐵𝐹𝑦) |
| 3 | eldmg 4950 | . . . . . 6 ⊢ (𝐵 ∈ dom 𝐹 → (𝐵 ∈ dom 𝐹 ↔ ∃𝑦 𝐵𝐹𝑦)) | |
| 4 | 3 | ibi 176 | . . . . 5 ⊢ (𝐵 ∈ dom 𝐹 → ∃𝑦 𝐵𝐹𝑦) |
| 5 | 4 | adantl 277 | . . . 4 ⊢ ((Fun 𝐹 ∧ 𝐵 ∈ dom 𝐹) → ∃𝑦 𝐵𝐹𝑦) |
| 6 | exmoeu2 2129 | . . . 4 ⊢ (∃𝑦 𝐵𝐹𝑦 → (∃*𝑦 𝐵𝐹𝑦 ↔ ∃!𝑦 𝐵𝐹𝑦)) | |
| 7 | 5, 6 | syl 14 | . . 3 ⊢ ((Fun 𝐹 ∧ 𝐵 ∈ dom 𝐹) → (∃*𝑦 𝐵𝐹𝑦 ↔ ∃!𝑦 𝐵𝐹𝑦)) |
| 8 | 2, 7 | mpbid 147 | . 2 ⊢ ((Fun 𝐹 ∧ 𝐵 ∈ dom 𝐹) → ∃!𝑦 𝐵𝐹𝑦) |
| 9 | 8 | funfni 5457 | 1 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → ∃!𝑦 𝐵𝐹𝑦) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 ∃wex 1541 ∃!weu 2080 ∃*wmo 2081 ∈ wcel 2203 class class class wbr 4108 dom cdm 4748 Fun wfun 5345 Fn wfn 5346 |
| 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 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-14 2206 ax-ext 2214 ax-sep 4227 ax-pow 4286 ax-pr 4321 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-nf 1510 df-sb 1812 df-eu 2083 df-mo 2084 df-clab 2219 df-cleq 2225 df-clel 2228 df-nfc 2373 df-ral 2525 df-rex 2526 df-v 2814 df-un 3214 df-in 3216 df-ss 3223 df-pw 3670 df-sn 3694 df-pr 3695 df-op 3697 df-br 4109 df-opab 4171 df-id 4413 df-xp 4754 df-rel 4755 df-cnv 4756 df-co 4757 df-dm 4758 df-fun 5353 df-fn 5354 |
| This theorem is referenced by: fneu2 5462 fnbrfvb 5714 mapsnd 6922 mapsn 6924 |
| Copyright terms: Public domain | W3C validator |