| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > cnvcnvssOLD | Structured version Visualization version GIF version | ||
| Description: Obsolete version of cnvcnvss 6191 as of 10-Jun-2026. (Contributed by NM, 23-Jul-2004.) (Proof modification is discouraged.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| cnvcnvssOLD | ⊢ ◡◡𝐴 ⊆ 𝐴 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cnvcnv 6189 | . 2 ⊢ ◡◡𝐴 = (𝐴 ∩ (V × V)) | |
| 2 | inss1 4188 | . 2 ⊢ (𝐴 ∩ (V × V)) ⊆ 𝐴 | |
| 3 | 1, 2 | eqsstri 3982 | 1 ⊢ ◡◡𝐴 ⊆ 𝐴 |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: Vcvv 3454 ∩ cin 3903 ⊆ wss 3904 × cxp 5658 ◡ccnv 5659 |
| 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-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-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 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |