| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > funssxp | 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 5407 | . . . . . 6 ⊢ (Fun 𝐹 ↔ 𝐹 Fn dom 𝐹) | |
| 2 | 1 | biimpi 120 | . . . . 5 ⊢ (Fun 𝐹 → 𝐹 Fn dom 𝐹) |
| 3 | rnss 5012 | . . . . . 6 ⊢ (𝐹 ⊆ (𝐴 × 𝐵) → ran 𝐹 ⊆ ran (𝐴 × 𝐵)) | |
| 4 | rnxpss 5219 | . . . . . 6 ⊢ ran (𝐴 × 𝐵) ⊆ 𝐵 | |
| 5 | 3, 4 | sstrdi 3260 | . . . . 5 ⊢ (𝐹 ⊆ (𝐴 × 𝐵) → ran 𝐹 ⊆ 𝐵) |
| 6 | 2, 5 | anim12i 338 | . . . 4 ⊢ ((Fun 𝐹 ∧ 𝐹 ⊆ (𝐴 × 𝐵)) → (𝐹 Fn dom 𝐹 ∧ ran 𝐹 ⊆ 𝐵)) |
| 7 | df-f 5381 | . . . 4 ⊢ (𝐹:dom 𝐹⟶𝐵 ↔ (𝐹 Fn dom 𝐹 ∧ ran 𝐹 ⊆ 𝐵)) | |
| 8 | 6, 7 | sylibr 134 | . . 3 ⊢ ((Fun 𝐹 ∧ 𝐹 ⊆ (𝐴 × 𝐵)) → 𝐹:dom 𝐹⟶𝐵) |
| 9 | dmss 4980 | . . . . 5 ⊢ (𝐹 ⊆ (𝐴 × 𝐵) → dom 𝐹 ⊆ dom (𝐴 × 𝐵)) | |
| 10 | dmxpss 5218 | . . . . 5 ⊢ dom (𝐴 × 𝐵) ⊆ 𝐴 | |
| 11 | 9, 10 | sstrdi 3260 | . . . 4 ⊢ (𝐹 ⊆ (𝐴 × 𝐵) → dom 𝐹 ⊆ 𝐴) |
| 12 | 11 | adantl 277 | . . 3 ⊢ ((Fun 𝐹 ∧ 𝐹 ⊆ (𝐴 × 𝐵)) → dom 𝐹 ⊆ 𝐴) |
| 13 | 8, 12 | jca 306 | . 2 ⊢ ((Fun 𝐹 ∧ 𝐹 ⊆ (𝐴 × 𝐵)) → (𝐹:dom 𝐹⟶𝐵 ∧ dom 𝐹 ⊆ 𝐴)) |
| 14 | ffun 5536 | . . . 4 ⊢ (𝐹:dom 𝐹⟶𝐵 → Fun 𝐹) | |
| 15 | 14 | adantr 276 | . . 3 ⊢ ((𝐹:dom 𝐹⟶𝐵 ∧ dom 𝐹 ⊆ 𝐴) → Fun 𝐹) |
| 16 | fssxp 5555 | . . . 4 ⊢ (𝐹:dom 𝐹⟶𝐵 → 𝐹 ⊆ (dom 𝐹 × 𝐵)) | |
| 17 | xpss1 4885 | . . . 4 ⊢ (dom 𝐹 ⊆ 𝐴 → (dom 𝐹 × 𝐵) ⊆ (𝐴 × 𝐵)) | |
| 18 | 16, 17 | sylan9ss 3261 | . . 3 ⊢ ((𝐹:dom 𝐹⟶𝐵 ∧ dom 𝐹 ⊆ 𝐴) → 𝐹 ⊆ (𝐴 × 𝐵)) |
| 19 | 15, 18 | jca 306 | . 2 ⊢ ((𝐹:dom 𝐹⟶𝐵 ∧ dom 𝐹 ⊆ 𝐴) → (Fun 𝐹 ∧ 𝐹 ⊆ (𝐴 × 𝐵))) |
| 20 | 13, 19 | impbii 126 | 1 ⊢ ((Fun 𝐹 ∧ 𝐹 ⊆ (𝐴 × 𝐵)) ↔ (𝐹:dom 𝐹⟶𝐵 ∧ dom 𝐹 ⊆ 𝐴)) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: ∧ wa 104 ↔ wb 105 ⊆ wss 3220 × cxp 4772 dom cdm 4774 ran crn 4775 Fun wfun 5371 Fn wfn 5372 ⟶wf 5373 |
| This proof depends on 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 4249 ax-pow 4311 ax-pr 4346 |
| This proof 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 3690 df-sn 3715 df-pr 3716 df-op 3718 df-br 4131 df-opab 4193 df-xp 4780 df-rel 4781 df-cnv 4782 df-dm 4784 df-rn 4785 df-fun 5379 df-fn 5380 df-f 5381 |
| This theorem is used by: elpm2g 6939 casef 7428 |
| Copyright terms: Public domain | W3C validator |