![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > ffdm | 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 5318 | . . . 4 ⊢ (𝐹:𝐴⟶𝐵 → dom 𝐹 = 𝐴) | |
2 | 1 | feq2d 5300 | . . 3 ⊢ (𝐹:𝐴⟶𝐵 → (𝐹:dom 𝐹⟶𝐵 ↔ 𝐹:𝐴⟶𝐵)) |
3 | 2 | ibir 176 | . 2 ⊢ (𝐹:𝐴⟶𝐵 → 𝐹:dom 𝐹⟶𝐵) |
4 | eqimss 3178 | . . 3 ⊢ (dom 𝐹 = 𝐴 → dom 𝐹 ⊆ 𝐴) | |
5 | 1, 4 | syl 14 | . 2 ⊢ (𝐹:𝐴⟶𝐵 → dom 𝐹 ⊆ 𝐴) |
6 | 3, 5 | jca 304 | 1 ⊢ (𝐹:𝐴⟶𝐵 → (𝐹:dom 𝐹⟶𝐵 ∧ dom 𝐹 ⊆ 𝐴)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 = wceq 1332 ⊆ wss 3098 dom cdm 4579 ⟶wf 5159 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-5 1424 ax-7 1425 ax-gen 1426 ax-ie1 1470 ax-ie2 1471 ax-8 1481 ax-11 1483 ax-4 1487 ax-17 1503 ax-i9 1507 ax-ial 1511 ax-i5r 1512 ax-ext 2136 |
This theorem depends on definitions: df-bi 116 df-nf 1438 df-sb 1740 df-clab 2141 df-cleq 2147 df-clel 2150 df-in 3104 df-ss 3111 df-fn 5166 df-f 5167 |
This theorem is referenced by: smoiso 6239 dvcj 13012 dvfre 13013 |
Copyright terms: Public domain | W3C validator |