![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > fssxp | GIF version |
Description: A mapping is a class of ordered pairs. (Contributed by NM, 3-Aug-1994.) (Proof shortened by Andrew Salmon, 17-Sep-2011.) |
Ref | Expression |
---|---|
fssxp | ⊢ (𝐹:𝐴⟶𝐵 → 𝐹 ⊆ (𝐴 × 𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | frel 5285 | . . 3 ⊢ (𝐹:𝐴⟶𝐵 → Rel 𝐹) | |
2 | relssdmrn 5067 | . . 3 ⊢ (Rel 𝐹 → 𝐹 ⊆ (dom 𝐹 × ran 𝐹)) | |
3 | 1, 2 | syl 14 | . 2 ⊢ (𝐹:𝐴⟶𝐵 → 𝐹 ⊆ (dom 𝐹 × ran 𝐹)) |
4 | fdm 5286 | . . . 4 ⊢ (𝐹:𝐴⟶𝐵 → dom 𝐹 = 𝐴) | |
5 | eqimss 3156 | . . . 4 ⊢ (dom 𝐹 = 𝐴 → dom 𝐹 ⊆ 𝐴) | |
6 | 4, 5 | syl 14 | . . 3 ⊢ (𝐹:𝐴⟶𝐵 → dom 𝐹 ⊆ 𝐴) |
7 | frn 5289 | . . 3 ⊢ (𝐹:𝐴⟶𝐵 → ran 𝐹 ⊆ 𝐵) | |
8 | xpss12 4654 | . . 3 ⊢ ((dom 𝐹 ⊆ 𝐴 ∧ ran 𝐹 ⊆ 𝐵) → (dom 𝐹 × ran 𝐹) ⊆ (𝐴 × 𝐵)) | |
9 | 6, 7, 8 | syl2anc 409 | . 2 ⊢ (𝐹:𝐴⟶𝐵 → (dom 𝐹 × ran 𝐹) ⊆ (𝐴 × 𝐵)) |
10 | 3, 9 | sstrd 3112 | 1 ⊢ (𝐹:𝐴⟶𝐵 → 𝐹 ⊆ (𝐴 × 𝐵)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 = wceq 1332 ⊆ wss 3076 × cxp 4545 dom cdm 4547 ran crn 4548 Rel wrel 4552 ⟶wf 5127 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-io 699 ax-5 1424 ax-7 1425 ax-gen 1426 ax-ie1 1470 ax-ie2 1471 ax-8 1483 ax-10 1484 ax-11 1485 ax-i12 1486 ax-bndl 1487 ax-4 1488 ax-14 1493 ax-17 1507 ax-i9 1511 ax-ial 1515 ax-i5r 1516 ax-ext 2122 ax-sep 4054 ax-pow 4106 ax-pr 4139 |
This theorem depends on definitions: df-bi 116 df-3an 965 df-tru 1335 df-nf 1438 df-sb 1737 df-eu 2003 df-mo 2004 df-clab 2127 df-cleq 2133 df-clel 2136 df-nfc 2271 df-ral 2422 df-rex 2423 df-v 2691 df-un 3080 df-in 3082 df-ss 3089 df-pw 3517 df-sn 3538 df-pr 3539 df-op 3541 df-br 3938 df-opab 3998 df-xp 4553 df-rel 4554 df-cnv 4555 df-dm 4557 df-rn 4558 df-fun 5133 df-fn 5134 df-f 5135 |
This theorem is referenced by: fex2 5299 funssxp 5300 opelf 5302 fabexg 5318 dff2 5572 dff3im 5573 f2ndf 6131 f1o2ndf1 6133 tfrlemibfn 6233 tfr1onlembfn 6249 tfrcllembfn 6262 mapex 6556 uniixp 6623 ixxex 9712 pw1nct 13371 |
Copyright terms: Public domain | W3C validator |