| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > cnvssrndm | Structured version Visualization version GIF version | ||
| Description: The converse is a subset of the cartesian product of range and domain. (Contributed by Mario Carneiro, 2-Jan-2017.) |
| Ref | Expression |
|---|---|
| cnvssrndm | ⊢ ◡𝐴 ⊆ (ran 𝐴 × dom 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | relcnv 6117 | . . 3 ⊢ Rel ◡𝐴 | |
| 2 | relssdmrn 6294 | . . 3 ⊢ (Rel ◡𝐴 → ◡𝐴 ⊆ (dom ◡𝐴 × ran ◡𝐴)) | |
| 3 | 1, 2 | ax-mp 5 | . 2 ⊢ ◡𝐴 ⊆ (dom ◡𝐴 × ran ◡𝐴) |
| 4 | df-rn 5668 | . . 3 ⊢ ran 𝐴 = dom ◡𝐴 | |
| 5 | dfdm4 5888 | . . 3 ⊢ dom 𝐴 = ran ◡𝐴 | |
| 6 | 4, 5 | xpeq12i 5685 | . 2 ⊢ (ran 𝐴 × dom 𝐴) = (dom ◡𝐴 × ran ◡𝐴) |
| 7 | 3, 6 | sseqtrri 3961 | 1 ⊢ ◡𝐴 ⊆ (ran 𝐴 × dom 𝐴) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ⊆ wss 3899 × cxp 5655 ◡ccnv 5656 dom cdm 5657 ran crn 5658 Rel wrel 5662 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1830 ax-4 1844 ax-5 1947 ax-6 2004 ax-7 2045 ax-8 2152 ax-9 2160 ax-ext 2738 ax-sep 5254 ax-pr 5397 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1106 df-tru 1575 df-fal 1585 df-ex 1815 df-sb 2104 df-clab 2745 df-cleq 2758 df-clel 2842 df-ral 3084 df-rex 3094 df-rab 3416 df-v 3455 df-ss 3900 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-sn 4588 df-pr 4590 df-op 4840 df-br 5108 df-opab 5173 df-xp 5663 df-rel 5664 df-cnv 5665 df-dm 5667 df-rn 5668 |
| This theorem is used by: wuncnv 10853 fcnvgreu 33366 trclubgNEW 44939 |
| Copyright terms: Public domain | W3C validator |