MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  dff2 Structured version   Visualization version   GIF version

Theorem dff2 6514
Description: Alternate definition of a mapping. (Contributed by NM, 14-Nov-2007.)
Assertion
Ref Expression
dff2 (𝐹:𝐴𝐵 ↔ (𝐹 Fn 𝐴𝐹 ⊆ (𝐴 × 𝐵)))

Proof of Theorem dff2
StepHypRef Expression
1 ffn 6185 . . 3 (𝐹:𝐴𝐵𝐹 Fn 𝐴)
2 fssxp 6200 . . 3 (𝐹:𝐴𝐵𝐹 ⊆ (𝐴 × 𝐵))
31, 2jca 495 . 2 (𝐹:𝐴𝐵 → (𝐹 Fn 𝐴𝐹 ⊆ (𝐴 × 𝐵)))
4 rnss 5492 . . . . 5 (𝐹 ⊆ (𝐴 × 𝐵) → ran 𝐹 ⊆ ran (𝐴 × 𝐵))
5 rnxpss 5707 . . . . 5 ran (𝐴 × 𝐵) ⊆ 𝐵
64, 5syl6ss 3762 . . . 4 (𝐹 ⊆ (𝐴 × 𝐵) → ran 𝐹𝐵)
76anim2i 595 . . 3 ((𝐹 Fn 𝐴𝐹 ⊆ (𝐴 × 𝐵)) → (𝐹 Fn 𝐴 ∧ ran 𝐹𝐵))
8 df-f 6035 . . 3 (𝐹:𝐴𝐵 ↔ (𝐹 Fn 𝐴 ∧ ran 𝐹𝐵))
97, 8sylibr 224 . 2 ((𝐹 Fn 𝐴𝐹 ⊆ (𝐴 × 𝐵)) → 𝐹:𝐴𝐵)
103, 9impbii 199 1 (𝐹:𝐴𝐵 ↔ (𝐹 Fn 𝐴𝐹 ⊆ (𝐴 × 𝐵)))
Colors of variables: wff setvar class
Syntax hints:  wb 196  wa 382  wss 3721   × cxp 5247  ran crn 5250   Fn wfn 6026  wf 6027
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1869  ax-4 1884  ax-5 1990  ax-6 2056  ax-7 2092  ax-9 2153  ax-10 2173  ax-11 2189  ax-12 2202  ax-13 2407  ax-ext 2750  ax-sep 4912  ax-nul 4920  ax-pr 5034
This theorem depends on definitions:  df-bi 197  df-an 383  df-or 827  df-3an 1072  df-tru 1633  df-ex 1852  df-nf 1857  df-sb 2049  df-eu 2621  df-mo 2622  df-clab 2757  df-cleq 2763  df-clel 2766  df-nfc 2901  df-ne 2943  df-ral 3065  df-rex 3066  df-rab 3069  df-v 3351  df-dif 3724  df-un 3726  df-in 3728  df-ss 3735  df-nul 4062  df-if 4224  df-sn 4315  df-pr 4317  df-op 4321  df-br 4785  df-opab 4845  df-xp 5255  df-rel 5256  df-cnv 5257  df-dm 5259  df-rn 5260  df-fun 6033  df-fn 6034  df-f 6035
This theorem is referenced by:  fpr2g  6618  mapval2  8038  cardf2  8968  imasaddflem  16397  imasvscaf  16406
  Copyright terms: Public domain W3C validator