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 6523 | . . 3 ⊢ (𝐹:𝐴⟶𝐵 → 𝐹 Fn 𝐴) | |
2 | fssxp 6551 | . . 3 ⊢ (𝐹:𝐴⟶𝐵 → 𝐹 ⊆ (𝐴 × 𝐵)) | |
3 | 1, 2 | jca 515 | . 2 ⊢ (𝐹:𝐴⟶𝐵 → (𝐹 Fn 𝐴 ∧ 𝐹 ⊆ (𝐴 × 𝐵))) |
4 | rnss 5793 | . . . . 5 ⊢ (𝐹 ⊆ (𝐴 × 𝐵) → ran 𝐹 ⊆ ran (𝐴 × 𝐵)) | |
5 | rnxpss 6015 | . . . . 5 ⊢ ran (𝐴 × 𝐵) ⊆ 𝐵 | |
6 | 4, 5 | sstrdi 3899 | . . . 4 ⊢ (𝐹 ⊆ (𝐴 × 𝐵) → ran 𝐹 ⊆ 𝐵) |
7 | 6 | anim2i 620 | . . 3 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐹 ⊆ (𝐴 × 𝐵)) → (𝐹 Fn 𝐴 ∧ ran 𝐹 ⊆ 𝐵)) |
8 | df-f 6362 | . . 3 ⊢ (𝐹:𝐴⟶𝐵 ↔ (𝐹 Fn 𝐴 ∧ ran 𝐹 ⊆ 𝐵)) | |
9 | 7, 8 | sylibr 237 | . 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐹 ⊆ (𝐴 × 𝐵)) → 𝐹:𝐴⟶𝐵) |
10 | 3, 9 | impbii 212 | 1 ⊢ (𝐹:𝐴⟶𝐵 ↔ (𝐹 Fn 𝐴 ∧ 𝐹 ⊆ (𝐴 × 𝐵))) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 209 ∧ wa 399 ⊆ wss 3853 × cxp 5534 ran crn 5537 Fn wfn 6353 ⟶wf 6354 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1976 ax-7 2018 ax-8 2114 ax-9 2122 ax-10 2143 ax-11 2160 ax-12 2177 ax-ext 2708 ax-sep 5177 ax-nul 5184 ax-pr 5307 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 848 df-3an 1091 df-tru 1546 df-fal 1556 df-ex 1788 df-nf 1792 df-sb 2073 df-mo 2539 df-eu 2568 df-clab 2715 df-cleq 2728 df-clel 2809 df-nfc 2879 df-ne 2933 df-ral 3056 df-rex 3057 df-rab 3060 df-v 3400 df-dif 3856 df-un 3858 df-in 3860 df-ss 3870 df-nul 4224 df-if 4426 df-sn 4528 df-pr 4530 df-op 4534 df-br 5040 df-opab 5102 df-xp 5542 df-rel 5543 df-cnv 5544 df-dm 5546 df-rn 5547 df-fun 6360 df-fn 6361 df-f 6362 |
This theorem is referenced by: fpr2g 7005 mapval2 8531 cardf2 9524 imasaddflem 16989 imasvscaf 16998 gsumpart 30988 |
Copyright terms: Public domain | W3C validator |