| 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 5460 | . 2 ⊢ (𝐹 Fn 𝐴 → dom 𝐹 = 𝐴) | |
| 2 | fndm 5460 | . 2 ⊢ (𝐹 Fn 𝐵 → dom 𝐹 = 𝐵) | |
| 3 | 1, 2 | sylan9req 2288 | 1 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐹 Fn 𝐵) → 𝐴 = 𝐵) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1398 dom cdm 4754 Fn wfn 5352 |
| 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 1496 ax-gen 1498 ax-4 1559 ax-17 1575 ax-ext 2216 |
| This theorem depends on definitions: df-bi 117 df-cleq 2227 df-fn 5360 |
| This theorem is referenced by: fodmrnu 5603 tfrlemisucaccv 6569 tfr1onlemsucaccv 6585 tfrcllemsucaccv 6598 0fz1 10399 lmodfopnelem1 14598 |
| Copyright terms: Public domain | W3C validator |