| 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 6655 | . . 3 ⊢ (𝐹:𝐴⟶𝐵 → 𝐹 Fn 𝐴) | |
| 2 | fssxp 6682 | . . 3 ⊢ (𝐹:𝐴⟶𝐵 → 𝐹 ⊆ (𝐴 × 𝐵)) | |
| 3 | 1, 2 | jca 516 | . 2 ⊢ (𝐹:𝐴⟶𝐵 → (𝐹 Fn 𝐴 ∧ 𝐹 ⊆ (𝐴 × 𝐵))) |
| 4 | rnss 5881 | . . . . 5 ⊢ (𝐹 ⊆ (𝐴 × 𝐵) → ran 𝐹 ⊆ ran (𝐴 × 𝐵)) | |
| 5 | rnxpss 6123 | . . . . 5 ⊢ ran (𝐴 × 𝐵) ⊆ 𝐵 | |
| 6 | 4, 5 | sstrdi 3927 | . . . 4 ⊢ (𝐹 ⊆ (𝐴 × 𝐵) → ran 𝐹 ⊆ 𝐵) |
| 7 | 6 | anim2i 623 | . . 3 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐹 ⊆ (𝐴 × 𝐵)) → (𝐹 Fn 𝐴 ∧ ran 𝐹 ⊆ 𝐵)) |
| 8 | df-f 6489 | . . 3 ⊢ (𝐹:𝐴⟶𝐵 ↔ (𝐹 Fn 𝐴 ∧ ran 𝐹 ⊆ 𝐵)) | |
| 9 | 7, 8 | sylibr 235 | . 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐹 ⊆ (𝐴 × 𝐵)) → 𝐹:𝐴⟶𝐵) |
| 10 | 3, 9 | impbii 210 | 1 ⊢ (𝐹:𝐴⟶𝐵 ↔ (𝐹 Fn 𝐴 ∧ 𝐹 ⊆ (𝐴 × 𝐵))) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 207 ∧ wa 396 ⊆ wss 3883 × cxp 5616 ran crn 5619 Fn wfn 6480 ⟶wf 6481 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-11 2168 ax-ext 2711 ax-sep 5218 ax-pr 5362 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-sb 2074 df-clab 2718 df-cleq 2731 df-clel 2814 df-ne 2935 df-ral 3054 df-rex 3064 df-rab 3392 df-v 3433 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4262 df-if 4455 df-sn 4556 df-pr 4558 df-op 4562 df-br 5073 df-opab 5135 df-xp 5624 df-rel 5625 df-cnv 5626 df-dm 5628 df-rn 5629 df-fun 6487 df-fn 6488 df-f 6489 |
| This theorem is referenced by: fpr2g 7155 mapval2 8810 cardf2 9858 mpoaddf 11123 mpomulf 11124 imasaddflem 17485 imasvscaf 17494 gsumpart 33144 |
| Copyright terms: Public domain | W3C validator |