Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > dff2 | Structured version Visualization version GIF version |
Description: Alternate definition of a mapping. (Contributed by NM, 14-Nov-2007.) |
Ref | Expression |
---|---|
dff2 | ⊢ (𝐹:𝐴⟶𝐵 ↔ (𝐹 Fn 𝐴 ∧ 𝐹 ⊆ (𝐴 × 𝐵))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ffn 6508 | . . 3 ⊢ (𝐹:𝐴⟶𝐵 → 𝐹 Fn 𝐴) | |
2 | fssxp 6528 | . . 3 ⊢ (𝐹:𝐴⟶𝐵 → 𝐹 ⊆ (𝐴 × 𝐵)) | |
3 | 1, 2 | jca 514 | . 2 ⊢ (𝐹:𝐴⟶𝐵 → (𝐹 Fn 𝐴 ∧ 𝐹 ⊆ (𝐴 × 𝐵))) |
4 | rnss 5803 | . . . . 5 ⊢ (𝐹 ⊆ (𝐴 × 𝐵) → ran 𝐹 ⊆ ran (𝐴 × 𝐵)) | |
5 | rnxpss 6023 | . . . . 5 ⊢ ran (𝐴 × 𝐵) ⊆ 𝐵 | |
6 | 4, 5 | sstrdi 3978 | . . . 4 ⊢ (𝐹 ⊆ (𝐴 × 𝐵) → ran 𝐹 ⊆ 𝐵) |
7 | 6 | anim2i 618 | . . 3 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐹 ⊆ (𝐴 × 𝐵)) → (𝐹 Fn 𝐴 ∧ ran 𝐹 ⊆ 𝐵)) |
8 | df-f 6353 | . . 3 ⊢ (𝐹:𝐴⟶𝐵 ↔ (𝐹 Fn 𝐴 ∧ ran 𝐹 ⊆ 𝐵)) | |
9 | 7, 8 | sylibr 236 | . 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐹 ⊆ (𝐴 × 𝐵)) → 𝐹:𝐴⟶𝐵) |
10 | 3, 9 | impbii 211 | 1 ⊢ (𝐹:𝐴⟶𝐵 ↔ (𝐹 Fn 𝐴 ∧ 𝐹 ⊆ (𝐴 × 𝐵))) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 208 ∧ wa 398 ⊆ wss 3935 × cxp 5547 ran crn 5550 Fn wfn 6344 ⟶wf 6345 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-sep 5195 ax-nul 5202 ax-pr 5321 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-ral 3143 df-rex 3144 df-rab 3147 df-v 3496 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-nul 4291 df-if 4467 df-sn 4561 df-pr 4563 df-op 4567 df-br 5059 df-opab 5121 df-xp 5555 df-rel 5556 df-cnv 5557 df-dm 5559 df-rn 5560 df-fun 6351 df-fn 6352 df-f 6353 |
This theorem is referenced by: fpr2g 6968 mapval2 8430 cardf2 9366 imasaddflem 16797 imasvscaf 16806 |
Copyright terms: Public domain | W3C validator |