![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > cnvct | Structured version Visualization version GIF version |
Description: If a set is countable, so is its converse. (Contributed by Thierry Arnoux, 29-Dec-2016.) |
Ref | Expression |
---|---|
cnvct | ⊢ (𝐴 ≼ ω → ◡𝐴 ≼ ω) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | relcnv 6094 | . . . 4 ⊢ Rel ◡𝐴 | |
2 | ctex 8956 | . . . . 5 ⊢ (𝐴 ≼ ω → 𝐴 ∈ V) | |
3 | cnvexg 7909 | . . . . 5 ⊢ (𝐴 ∈ V → ◡𝐴 ∈ V) | |
4 | 2, 3 | syl 17 | . . . 4 ⊢ (𝐴 ≼ ω → ◡𝐴 ∈ V) |
5 | cnven 9030 | . . . 4 ⊢ ((Rel ◡𝐴 ∧ ◡𝐴 ∈ V) → ◡𝐴 ≈ ◡◡𝐴) | |
6 | 1, 4, 5 | sylancr 586 | . . 3 ⊢ (𝐴 ≼ ω → ◡𝐴 ≈ ◡◡𝐴) |
7 | cnvcnvss 6184 | . . . 4 ⊢ ◡◡𝐴 ⊆ 𝐴 | |
8 | ssdomg 8993 | . . . 4 ⊢ (𝐴 ∈ V → (◡◡𝐴 ⊆ 𝐴 → ◡◡𝐴 ≼ 𝐴)) | |
9 | 2, 7, 8 | mpisyl 21 | . . 3 ⊢ (𝐴 ≼ ω → ◡◡𝐴 ≼ 𝐴) |
10 | endomtr 9005 | . . 3 ⊢ ((◡𝐴 ≈ ◡◡𝐴 ∧ ◡◡𝐴 ≼ 𝐴) → ◡𝐴 ≼ 𝐴) | |
11 | 6, 9, 10 | syl2anc 583 | . 2 ⊢ (𝐴 ≼ ω → ◡𝐴 ≼ 𝐴) |
12 | domtr 9000 | . 2 ⊢ ((◡𝐴 ≼ 𝐴 ∧ 𝐴 ≼ ω) → ◡𝐴 ≼ ω) | |
13 | 11, 12 | mpancom 685 | 1 ⊢ (𝐴 ≼ ω → ◡𝐴 ≼ ω) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∈ wcel 2098 Vcvv 3466 ⊆ wss 3941 class class class wbr 5139 ◡ccnv 5666 Rel wrel 5672 ωcom 7849 ≈ cen 8933 ≼ cdom 8934 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2163 ax-ext 2695 ax-sep 5290 ax-nul 5297 ax-pow 5354 ax-pr 5418 ax-un 7719 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2526 df-eu 2555 df-clab 2702 df-cleq 2716 df-clel 2802 df-nfc 2877 df-ne 2933 df-ral 3054 df-rex 3063 df-rab 3425 df-v 3468 df-dif 3944 df-un 3946 df-in 3948 df-ss 3958 df-nul 4316 df-if 4522 df-pw 4597 df-sn 4622 df-pr 4624 df-op 4628 df-uni 4901 df-br 5140 df-opab 5202 df-mpt 5223 df-id 5565 df-xp 5673 df-rel 5674 df-cnv 5675 df-co 5676 df-dm 5677 df-rn 5678 df-res 5679 df-ima 5680 df-iota 6486 df-fun 6536 df-fn 6537 df-f 6538 df-f1 6539 df-fo 6540 df-f1o 6541 df-fv 6542 df-1st 7969 df-2nd 7970 df-en 8937 df-dom 8938 |
This theorem is referenced by: rnct 10517 |
Copyright terms: Public domain | W3C validator |