| 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 6619 | . 2 ⊢ (𝐹 Fn 𝐴 → dom 𝐹 = 𝐴) | |
| 2 | fndm 6619 | . 2 ⊢ (𝐹 Fn 𝐵 → dom 𝐹 = 𝐵) | |
| 3 | 1, 2 | sylan9req 2817 | 1 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐹 Fn 𝐵) → 𝐴 = 𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 399 = wceq 1559 dom cdm 5643 Fn wfn 6511 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-9 2151 ax-ext 2733 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-ex 1799 df-cleq 2753 df-fn 6519 |
| This theorem is referenced by: fodmrnu 6781 0fz1 13543 lmodfopnelem1 20953 grporn 30681 hon0 31953 2ffzoeq 47883 homf0 49591 funchomf 49679 |
| Copyright terms: Public domain | W3C validator |