| 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 5480 | . 2 ⊢ (𝐹 Fn 𝐴 → dom 𝐹 = 𝐴) | |
| 2 | fndm 5480 | . 2 ⊢ (𝐹 Fn 𝐵 → dom 𝐹 = 𝐵) | |
| 3 | 1, 2 | sylan9req 2292 | 1 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐹 Fn 𝐵) → 𝐴 = 𝐵) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 104 = wceq 1402 dom cdm 4774 Fn wfn 5372 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-5 1500 ax-gen 1502 ax-4 1563 ax-17 1579 ax-ext 2220 |
| This proof depends on definitions: df-bi 117 df-cleq 2231 df-fn 5380 |
| This theorem is used by: fodmrnu 5623 tfrlemisucaccv 6596 tfr1onlemsucaccv 6612 tfrcllemsucaccv 6625 0fz1 10449 lmodfopnelem1 14661 |
| Copyright terms: Public domain | W3C validator |