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 6515 | . . . 4 ⊢ (𝐹:𝐴⟶𝐵 → dom 𝐹 = 𝐴) | |
2 | 1 | feq2d 6493 | . . 3 ⊢ (𝐹:𝐴⟶𝐵 → (𝐹:dom 𝐹⟶𝐵 ↔ 𝐹:𝐴⟶𝐵)) |
3 | 2 | ibir 269 | . 2 ⊢ (𝐹:𝐴⟶𝐵 → 𝐹:dom 𝐹⟶𝐵) |
4 | eqimss 4020 | . . 3 ⊢ (dom 𝐹 = 𝐴 → dom 𝐹 ⊆ 𝐴) | |
5 | 1, 4 | syl 17 | . 2 ⊢ (𝐹:𝐴⟶𝐵 → dom 𝐹 ⊆ 𝐴) |
6 | 3, 5 | jca 512 | 1 ⊢ (𝐹:𝐴⟶𝐵 → (𝐹:dom 𝐹⟶𝐵 ∧ dom 𝐹 ⊆ 𝐴)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 = wceq 1528 ⊆ wss 3933 dom cdm 5548 ⟶wf 6344 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1787 ax-4 1801 ax-5 1902 ax-6 1961 ax-7 2006 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2151 ax-12 2167 ax-ext 2790 |
This theorem depends on definitions: df-bi 208 df-an 397 df-or 842 df-tru 1531 df-ex 1772 df-nf 1776 df-sb 2061 df-clab 2797 df-cleq 2811 df-clel 2890 df-in 3940 df-ss 3949 df-fn 6351 df-f 6352 |
This theorem is referenced by: ffdmd 6530 smoiso 7988 s4f1o 14268 islindf2 20886 fourierdlem92 42360 fouriersw 42393 etransclem2 42398 |
Copyright terms: Public domain | W3C validator |