| 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 6566 | . . . . . 6 ⊢ (Fun 𝐹 ↔ 𝐹 Fn dom 𝐹) | |
| 2 | 1 | biimpi 219 | . . . . 5 ⊢ (Fun 𝐹 → 𝐹 Fn dom 𝐹) |
| 3 | rnss 5928 | . . . . . 6 ⊢ (𝐹 ⊆ (𝐴 × 𝐵) → ran 𝐹 ⊆ ran (𝐴 × 𝐵)) | |
| 4 | rnxpss 6169 | . . . . . 6 ⊢ ran (𝐴 × 𝐵) ⊆ 𝐵 | |
| 5 | 3, 4 | sstrdi 3948 | . . . . 5 ⊢ (𝐹 ⊆ (𝐴 × 𝐵) → ran 𝐹 ⊆ 𝐵) |
| 6 | 2, 5 | anim12i 624 | . . . 4 ⊢ ((Fun 𝐹 ∧ 𝐹 ⊆ (𝐴 × 𝐵)) → (𝐹 Fn dom 𝐹 ∧ ran 𝐹 ⊆ 𝐵)) |
| 7 | df-f 6540 | . . . 4 ⊢ (𝐹:dom 𝐹⟶𝐵 ↔ (𝐹 Fn dom 𝐹 ∧ ran 𝐹 ⊆ 𝐵)) | |
| 8 | 6, 7 | sylibr 237 | . . 3 ⊢ ((Fun 𝐹 ∧ 𝐹 ⊆ (𝐴 × 𝐵)) → 𝐹:dom 𝐹⟶𝐵) |
| 9 | dmss 5891 | . . . . 5 ⊢ (𝐹 ⊆ (𝐴 × 𝐵) → dom 𝐹 ⊆ dom (𝐴 × 𝐵)) | |
| 10 | dmxpss 6168 | . . . . 5 ⊢ dom (𝐴 × 𝐵) ⊆ 𝐴 | |
| 11 | 9, 10 | sstrdi 3948 | . . . 4 ⊢ (𝐹 ⊆ (𝐴 × 𝐵) → dom 𝐹 ⊆ 𝐴) |
| 12 | 11 | adantl 486 | . . 3 ⊢ ((Fun 𝐹 ∧ 𝐹 ⊆ (𝐴 × 𝐵)) → dom 𝐹 ⊆ 𝐴) |
| 13 | 8, 12 | jca 520 | . 2 ⊢ ((Fun 𝐹 ∧ 𝐹 ⊆ (𝐴 × 𝐵)) → (𝐹:dom 𝐹⟶𝐵 ∧ dom 𝐹 ⊆ 𝐴)) |
| 14 | ffun 6708 | . . . 4 ⊢ (𝐹:dom 𝐹⟶𝐵 → Fun 𝐹) | |
| 15 | 14 | adantr 485 | . . 3 ⊢ ((𝐹:dom 𝐹⟶𝐵 ∧ dom 𝐹 ⊆ 𝐴) → Fun 𝐹) |
| 16 | fssxp 6733 | . . . 4 ⊢ (𝐹:dom 𝐹⟶𝐵 → 𝐹 ⊆ (dom 𝐹 × 𝐵)) | |
| 17 | xpss1 5679 | . . . 4 ⊢ (dom 𝐹 ⊆ 𝐴 → (dom 𝐹 × 𝐵) ⊆ (𝐴 × 𝐵)) | |
| 18 | 16, 17 | sylan9ss 3949 | . . 3 ⊢ ((𝐹:dom 𝐹⟶𝐵 ∧ dom 𝐹 ⊆ 𝐴) → 𝐹 ⊆ (𝐴 × 𝐵)) |
| 19 | 15, 18 | jca 520 | . 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 400 ⊆ wss 3904 × cxp 5658 dom cdm 5660 ran crn 5661 Fun wfun 6530 Fn wfn 6531 ⟶wf 6532 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-8 2144 ax-9 2152 ax-11 2191 ax-ext 2734 ax-sep 5256 ax-pr 5403 |
| This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1104 df-tru 1572 df-fal 1582 df-ex 1809 df-sb 2096 df-clab 2741 df-cleq 2754 df-clel 2837 df-ne 2958 df-ral 3079 df-rex 3089 df-rab 3416 df-v 3456 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-nul 4286 df-if 4487 df-sn 4589 df-pr 4591 df-op 4595 df-br 5109 df-opab 5173 df-xp 5666 df-rel 5667 df-cnv 5668 df-dm 5670 df-rn 5671 df-fun 6538 df-fn 6539 df-f 6540 |
| This theorem is used by: elpm2g 8839 volf 25699 dfno2 44182 |
| Copyright terms: Public domain | W3C validator |