| 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 6567 | . . . . . 6 ⊢ (Fun 𝐹 ↔ 𝐹 Fn dom 𝐹) | |
| 2 | 1 | biimpi 219 | . . . . 5 ⊢ (Fun 𝐹 → 𝐹 Fn dom 𝐹) |
| 3 | rnss 5927 | . . . . . 6 ⊢ (𝐹 ⊆ (𝐴 × 𝐵) → ran 𝐹 ⊆ ran (𝐴 × 𝐵)) | |
| 4 | rnxpss 6169 | . . . . . 6 ⊢ ran (𝐴 × 𝐵) ⊆ 𝐵 | |
| 5 | 3, 4 | sstrdi 3946 | . . . . 5 ⊢ (𝐹 ⊆ (𝐴 × 𝐵) → ran 𝐹 ⊆ 𝐵) |
| 6 | 2, 5 | anim12i 625 | . . . 4 ⊢ ((Fun 𝐹 ∧ 𝐹 ⊆ (𝐴 × 𝐵)) → (𝐹 Fn dom 𝐹 ∧ ran 𝐹 ⊆ 𝐵)) |
| 7 | df-f 6541 | . . . 4 ⊢ (𝐹:dom 𝐹⟶𝐵 ↔ (𝐹 Fn dom 𝐹 ∧ ran 𝐹 ⊆ 𝐵)) | |
| 8 | 6, 7 | sylibr 237 | . . 3 ⊢ ((Fun 𝐹 ∧ 𝐹 ⊆ (𝐴 × 𝐵)) → 𝐹:dom 𝐹⟶𝐵) |
| 9 | dmss 5890 | . . . . 5 ⊢ (𝐹 ⊆ (𝐴 × 𝐵) → dom 𝐹 ⊆ dom (𝐴 × 𝐵)) | |
| 10 | dmxpss 6168 | . . . . 5 ⊢ dom (𝐴 × 𝐵) ⊆ 𝐴 | |
| 11 | 9, 10 | sstrdi 3946 | . . . 4 ⊢ (𝐹 ⊆ (𝐴 × 𝐵) → dom 𝐹 ⊆ 𝐴) |
| 12 | 11 | adantl 487 | . . 3 ⊢ ((Fun 𝐹 ∧ 𝐹 ⊆ (𝐴 × 𝐵)) → dom 𝐹 ⊆ 𝐴) |
| 13 | 8, 12 | jca 521 | . 2 ⊢ ((Fun 𝐹 ∧ 𝐹 ⊆ (𝐴 × 𝐵)) → (𝐹:dom 𝐹⟶𝐵 ∧ dom 𝐹 ⊆ 𝐴)) |
| 14 | ffun 6709 | . . . 4 ⊢ (𝐹:dom 𝐹⟶𝐵 → Fun 𝐹) | |
| 15 | 14 | adantr 486 | . . 3 ⊢ ((𝐹:dom 𝐹⟶𝐵 ∧ dom 𝐹 ⊆ 𝐴) → Fun 𝐹) |
| 16 | fssxp 6734 | . . . 4 ⊢ (𝐹:dom 𝐹⟶𝐵 → 𝐹 ⊆ (dom 𝐹 × 𝐵)) | |
| 17 | xpss1 5678 | . . . 4 ⊢ (dom 𝐹 ⊆ 𝐴 → (dom 𝐹 × 𝐵) ⊆ (𝐴 × 𝐵)) | |
| 18 | 16, 17 | sylan9ss 3947 | . . 3 ⊢ ((𝐹:dom 𝐹⟶𝐵 ∧ dom 𝐹 ⊆ 𝐴) → 𝐹 ⊆ (𝐴 × 𝐵)) |
| 19 | 15, 18 | jca 521 | . 2 ⊢ ((𝐹:dom 𝐹⟶𝐵 ∧ dom 𝐹 ⊆ 𝐴) → (Fun 𝐹 ∧ 𝐹 ⊆ (𝐴 × 𝐵))) |
| 20 | 13, 19 | impbii 212 | 1 ⊢ ((Fun 𝐹 ∧ 𝐹 ⊆ (𝐴 × 𝐵)) ↔ (𝐹:dom 𝐹⟶𝐵 ∧ dom 𝐹 ⊆ 𝐴)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 ∧ wa 401 ⊆ wss 3902 × cxp 5657 dom cdm 5659 ran crn 5660 Fun wfun 6531 Fn wfn 6532 ⟶wf 6533 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-ext 2734 ax-sep 5255 ax-pr 5402 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2100 df-clab 2741 df-cleq 2754 df-clel 2837 df-ne 2958 df-ral 3079 df-rex 3089 df-rab 3415 df-v 3455 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4283 df-if 4486 df-sn 4588 df-pr 4590 df-op 4594 df-br 5108 df-opab 5172 df-xp 5665 df-rel 5666 df-cnv 5667 df-dm 5669 df-rn 5670 df-fun 6539 df-fn 6540 df-f 6541 |
| This theorem is used by: elpm2g 8846 volf 25761 dfno2 44270 |
| Copyright terms: Public domain | W3C validator |