| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > cnvss | Structured version Visualization version GIF version | ||
| Description: Subset theorem for converse. (Contributed by NM, 22-Mar-1998.) (Proof shortened by Kyle Wyonch, 27-Apr-2021.) |
| Ref | Expression |
|---|---|
| cnvss | ⊢ (𝐴 ⊆ 𝐵 → ◡𝐴 ⊆ ◡𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ssbr 5144 | . . 3 ⊢ (𝐴 ⊆ 𝐵 → (𝑦𝐴𝑥 → 𝑦𝐵𝑥)) | |
| 2 | 1 | ssopab2dv 5509 | . 2 ⊢ (𝐴 ⊆ 𝐵 → {〈𝑥, 𝑦〉 ∣ 𝑦𝐴𝑥} ⊆ {〈𝑥, 𝑦〉 ∣ 𝑦𝐵𝑥}) |
| 3 | df-cnv 5642 | . 2 ⊢ ◡𝐴 = {〈𝑥, 𝑦〉 ∣ 𝑦𝐴𝑥} | |
| 4 | df-cnv 5642 | . 2 ⊢ ◡𝐵 = {〈𝑥, 𝑦〉 ∣ 𝑦𝐵𝑥} | |
| 5 | 2, 3, 4 | 3sstr4g 3989 | 1 ⊢ (𝐴 ⊆ 𝐵 → ◡𝐴 ⊆ ◡𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ⊆ wss 3903 class class class wbr 5100 {copab 5162 ◡ccnv 5633 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-ext 2709 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-ex 1782 df-sb 2069 df-clab 2716 df-cleq 2729 df-clel 2812 df-ss 3920 df-br 5101 df-opab 5163 df-cnv 5642 |
| This theorem is referenced by: cnveq 5832 rnss 5898 relcnvtrg 6235 predrelss 6305 funss 6521 funres11 6579 funcnvres 6580 foimacnv 6801 funcnvuni 7886 tposss 8181 vdwnnlem1 16937 structcnvcnv 17094 catcoppccl 18055 cnvps 18515 tsrdir 18541 ustneism 24185 metustsym 24516 metust 24519 pi1xfrcnv 25030 eulerpartlemmf 34559 relcnveq3 38607 elrelscnveq3 38907 disjss 39111 cnvssb 43971 trclubgNEW 44003 clrellem 44007 clcnvlem 44008 cnvrcl0 44010 cnvtrcl0 44011 cnvtrrel 44055 relexpaddss 44103 |
| Copyright terms: Public domain | W3C validator |