Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > fndmu | Structured version Visualization version 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 5904 | . 2 ⊢ (𝐹 Fn 𝐴 → dom 𝐹 = 𝐴) | |
2 | fndm 5904 | . 2 ⊢ (𝐹 Fn 𝐵 → dom 𝐹 = 𝐵) | |
3 | 1, 2 | sylan9req 2665 | 1 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐹 Fn 𝐵) → 𝐴 = 𝐵) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 383 = wceq 1475 dom cdm 5038 Fn wfn 5799 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-ext 2590 |
This theorem depends on definitions: df-bi 196 df-an 385 df-cleq 2603 df-fn 5807 |
This theorem is referenced by: fodmrnu 6036 0fz1 12232 lmodfopnelem1 18722 grporn 26759 hon0 28036 2ffzoeq 40361 |
Copyright terms: Public domain | W3C validator |