| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > fndmu | GIF version | ||
| Description: A function has a unique domain. (Contributed by NM, 11-Aug-1994.) |
| Ref | Expression |
|---|---|
| fndmu | ⊢ ((𝐹 Fn 𝐴 ∧ 𝐹 Fn 𝐵) → 𝐴 = 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fndm 5358 | . 2 ⊢ (𝐹 Fn 𝐴 → dom 𝐹 = 𝐴) | |
| 2 | fndm 5358 | . 2 ⊢ (𝐹 Fn 𝐵 → dom 𝐹 = 𝐵) | |
| 3 | 1, 2 | sylan9req 2250 | 1 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐹 Fn 𝐵) → 𝐴 = 𝐵) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1364 dom cdm 4664 Fn wfn 5254 |
| 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-5 1461 ax-gen 1463 ax-4 1524 ax-17 1540 ax-ext 2178 |
| This theorem depends on definitions: df-bi 117 df-cleq 2189 df-fn 5262 |
| This theorem is referenced by: fodmrnu 5491 tfrlemisucaccv 6392 tfr1onlemsucaccv 6408 tfrcllemsucaccv 6421 0fz1 10137 lmodfopnelem1 13956 |
| Copyright terms: Public domain | W3C validator |