![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > funssxp | Structured version Visualization version GIF version |
Description: Two ways of specifying a partial function from 𝐴 to 𝐵. (Contributed by NM, 13-Nov-2007.) |
Ref | Expression |
---|---|
funssxp | ⊢ ((Fun 𝐹 ∧ 𝐹 ⊆ (𝐴 × 𝐵)) ↔ (𝐹:dom 𝐹⟶𝐵 ∧ dom 𝐹 ⊆ 𝐴)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | funfn 6608 | . . . . . 6 ⊢ (Fun 𝐹 ↔ 𝐹 Fn dom 𝐹) | |
2 | 1 | biimpi 216 | . . . . 5 ⊢ (Fun 𝐹 → 𝐹 Fn dom 𝐹) |
3 | rnss 5964 | . . . . . 6 ⊢ (𝐹 ⊆ (𝐴 × 𝐵) → ran 𝐹 ⊆ ran (𝐴 × 𝐵)) | |
4 | rnxpss 6203 | . . . . . 6 ⊢ ran (𝐴 × 𝐵) ⊆ 𝐵 | |
5 | 3, 4 | sstrdi 4021 | . . . . 5 ⊢ (𝐹 ⊆ (𝐴 × 𝐵) → ran 𝐹 ⊆ 𝐵) |
6 | 2, 5 | anim12i 612 | . . . 4 ⊢ ((Fun 𝐹 ∧ 𝐹 ⊆ (𝐴 × 𝐵)) → (𝐹 Fn dom 𝐹 ∧ ran 𝐹 ⊆ 𝐵)) |
7 | df-f 6577 | . . . 4 ⊢ (𝐹:dom 𝐹⟶𝐵 ↔ (𝐹 Fn dom 𝐹 ∧ ran 𝐹 ⊆ 𝐵)) | |
8 | 6, 7 | sylibr 234 | . . 3 ⊢ ((Fun 𝐹 ∧ 𝐹 ⊆ (𝐴 × 𝐵)) → 𝐹:dom 𝐹⟶𝐵) |
9 | dmss 5927 | . . . . 5 ⊢ (𝐹 ⊆ (𝐴 × 𝐵) → dom 𝐹 ⊆ dom (𝐴 × 𝐵)) | |
10 | dmxpss 6202 | . . . . 5 ⊢ dom (𝐴 × 𝐵) ⊆ 𝐴 | |
11 | 9, 10 | sstrdi 4021 | . . . 4 ⊢ (𝐹 ⊆ (𝐴 × 𝐵) → dom 𝐹 ⊆ 𝐴) |
12 | 11 | adantl 481 | . . 3 ⊢ ((Fun 𝐹 ∧ 𝐹 ⊆ (𝐴 × 𝐵)) → dom 𝐹 ⊆ 𝐴) |
13 | 8, 12 | jca 511 | . 2 ⊢ ((Fun 𝐹 ∧ 𝐹 ⊆ (𝐴 × 𝐵)) → (𝐹:dom 𝐹⟶𝐵 ∧ dom 𝐹 ⊆ 𝐴)) |
14 | ffun 6750 | . . . 4 ⊢ (𝐹:dom 𝐹⟶𝐵 → Fun 𝐹) | |
15 | 14 | adantr 480 | . . 3 ⊢ ((𝐹:dom 𝐹⟶𝐵 ∧ dom 𝐹 ⊆ 𝐴) → Fun 𝐹) |
16 | fssxp 6775 | . . . 4 ⊢ (𝐹:dom 𝐹⟶𝐵 → 𝐹 ⊆ (dom 𝐹 × 𝐵)) | |
17 | xpss1 5719 | . . . 4 ⊢ (dom 𝐹 ⊆ 𝐴 → (dom 𝐹 × 𝐵) ⊆ (𝐴 × 𝐵)) | |
18 | 16, 17 | sylan9ss 4022 | . . 3 ⊢ ((𝐹:dom 𝐹⟶𝐵 ∧ dom 𝐹 ⊆ 𝐴) → 𝐹 ⊆ (𝐴 × 𝐵)) |
19 | 15, 18 | jca 511 | . 2 ⊢ ((𝐹:dom 𝐹⟶𝐵 ∧ dom 𝐹 ⊆ 𝐴) → (Fun 𝐹 ∧ 𝐹 ⊆ (𝐴 × 𝐵))) |
20 | 13, 19 | impbii 209 | 1 ⊢ ((Fun 𝐹 ∧ 𝐹 ⊆ (𝐴 × 𝐵)) ↔ (𝐹:dom 𝐹⟶𝐵 ∧ dom 𝐹 ⊆ 𝐴)) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 206 ∧ wa 395 ⊆ wss 3976 × cxp 5698 dom cdm 5700 ran crn 5701 Fun wfun 6567 Fn wfn 6568 ⟶wf 6569 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-11 2158 ax-12 2178 ax-ext 2711 ax-sep 5317 ax-nul 5324 ax-pr 5447 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-sb 2065 df-clab 2718 df-cleq 2732 df-clel 2819 df-ne 2947 df-ral 3068 df-rex 3077 df-rab 3444 df-v 3490 df-dif 3979 df-un 3981 df-ss 3993 df-nul 4353 df-if 4549 df-sn 4649 df-pr 4651 df-op 4655 df-br 5167 df-opab 5229 df-xp 5706 df-rel 5707 df-cnv 5708 df-dm 5710 df-rn 5711 df-fun 6575 df-fn 6576 df-f 6577 |
This theorem is referenced by: elpm2g 8902 volf 25583 dfno2 43390 |
Copyright terms: Public domain | W3C validator |