![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > ffdm | Structured version Visualization version GIF version |
Description: A mapping is a partial function. (Contributed by NM, 25-Nov-2007.) |
Ref | Expression |
---|---|
ffdm | ⊢ (𝐹:𝐴⟶𝐵 → (𝐹:dom 𝐹⟶𝐵 ∧ dom 𝐹 ⊆ 𝐴)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | fdm 6678 | . . . 4 ⊢ (𝐹:𝐴⟶𝐵 → dom 𝐹 = 𝐴) | |
2 | 1 | feq2d 6655 | . . 3 ⊢ (𝐹:𝐴⟶𝐵 → (𝐹:dom 𝐹⟶𝐵 ↔ 𝐹:𝐴⟶𝐵)) |
3 | 2 | ibir 268 | . 2 ⊢ (𝐹:𝐴⟶𝐵 → 𝐹:dom 𝐹⟶𝐵) |
4 | eqimss 4001 | . . 3 ⊢ (dom 𝐹 = 𝐴 → dom 𝐹 ⊆ 𝐴) | |
5 | 1, 4 | syl 17 | . 2 ⊢ (𝐹:𝐴⟶𝐵 → dom 𝐹 ⊆ 𝐴) |
6 | 3, 5 | jca 513 | 1 ⊢ (𝐹:𝐴⟶𝐵 → (𝐹:dom 𝐹⟶𝐵 ∧ dom 𝐹 ⊆ 𝐴)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 397 = wceq 1542 ⊆ wss 3911 dom cdm 5634 ⟶wf 6493 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-ext 2704 |
This theorem depends on definitions: df-bi 206 df-an 398 df-tru 1545 df-ex 1783 df-sb 2069 df-clab 2711 df-cleq 2725 df-clel 2811 df-v 3446 df-in 3918 df-ss 3928 df-fn 6500 df-f 6501 |
This theorem is referenced by: ffdmd 6700 smoiso 8309 s4f1o 14813 islindf2 21236 fourierdlem92 44525 fouriersw 44558 etransclem2 44563 |
Copyright terms: Public domain | W3C validator |