Theorem dff2 5843

Description: Alternate definition of a mapping. (Contributed by NM, 14-Nov-2007.)

Assertion

Ref	Expression
dff2	⊢ (𝐹:𝐴⟶𝐵 ↔ (𝐹 Fn 𝐴 ∧ 𝐹 ⊆ (𝐴 × 𝐵)))

Proof of Theorem dff2

Step	Hyp	Ref	Expression
1		ffn 5528	. . 3 ⊢ (𝐹:𝐴⟶𝐵 → 𝐹 Fn 𝐴)
2		fssxp 5550	. . 3 ⊢ (𝐹:𝐴⟶𝐵 → 𝐹 ⊆ (𝐴 × 𝐵))
3	1, 2	jca 306	. 2 ⊢ (𝐹:𝐴⟶𝐵 → (𝐹 Fn 𝐴 ∧ 𝐹 ⊆ (𝐴 × 𝐵)))
4		rnss 5007	. . . . 5 ⊢ (𝐹 ⊆ (𝐴 × 𝐵) → ran 𝐹 ⊆ ran (𝐴 × 𝐵))
5		rnxpss 5214	. . . . 5 ⊢ ran (𝐴 × 𝐵) ⊆ 𝐵
6	4, 5	sstrdi 3260	. . . 4 ⊢ (𝐹 ⊆ (𝐴 × 𝐵) → ran 𝐹 ⊆ 𝐵)
7	6	anim2i 342	. . 3 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐹 ⊆ (𝐴 × 𝐵)) → (𝐹 Fn 𝐴 ∧ ran 𝐹 ⊆ 𝐵))
8		df-f 5376	. . 3 ⊢ (𝐹:𝐴⟶𝐵 ↔ (𝐹 Fn 𝐴 ∧ ran 𝐹 ⊆ 𝐵))
9	7, 8	sylibr 134	. 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐹 ⊆ (𝐴 × 𝐵)) → 𝐹:𝐴⟶𝐵)
10	3, 9	impbii 126	1 ⊢ (𝐹:𝐴⟶𝐵 ↔ (𝐹 Fn 𝐴 ∧ 𝐹 ⊆ (𝐴 × 𝐵)))

Syntax hints:   ∧ wa 104   ↔ wb 105   ⊆ wss 3220   × cxp 4767  ran crn 4770   Fn wfn 5367  ⟶wf 5368

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4244  ax-pow 4306  ax-pr 4341

This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-un 3224  df-in 3226  df-ss 3233  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-br 4126  df-opab 4188  df-xp 4775  df-rel 4776  df-cnv 4777  df-dm 4779  df-rn 4780  df-fun 5374  df-fn 5375  df-f 5376

This theorem is referenced by:  mapval2  6949  mpomulf  8306  frecuzrdgtclt  10836  imasaddflemg  13614