MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  cnvss Structured version   Visualization version   GIF version

Theorem cnvss 5861
Description: Subset theorem for converse. (Contributed by NM, 22-Mar-1998.) (Proof shortened by Kyle Wyonch, 27-Apr-2021.)
Assertion
Ref Expression
cnvss (𝐴 ⊆ 𝐵 → ◡𝐴 ⊆ ◡𝐵)

Proof of Theorem cnvss
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ssbr 5154 . . 3 (𝐴 ⊆ 𝐵 → (𝑦𝐴𝑥 → 𝑦𝐵𝑥))
21ssopab2dv 5532 . 2 (𝐴 ⊆ 𝐵 → {⟨𝑥, 𝑦⟩ ∣ 𝑦𝐴𝑥} ⊆ {⟨𝑥, 𝑦⟩ ∣ 𝑦𝐵𝑥})
3 df-cnv 5665 . 2 ◡𝐴 = {⟨𝑥, 𝑦⟩ ∣ 𝑦𝐴𝑥}
4 df-cnv 5665 . 2 ◡𝐵 = {⟨𝑥, 𝑦⟩ ∣ 𝑦𝐵𝑥}
52, 3, 43sstr4g 3965 1 (𝐴 ⊆ 𝐵 → ◡𝐴 ⊆ ◡𝐵)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ⊆ wss 3899   class class class wbr 5107  {copab 5172  ◡ccnv 5656
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
This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1815  df-sb 2104  df-clab 2745  df-cleq 2758  df-clel 2842  df-ss 3900  df-br 5108  df-opab 5173  df-cnv 5665
This theorem is used by:  cnveq  5862  rnss  5932  cnvssb  6206  relcnvtrg  6291  relcnvtrgOLD  6292  predrelss  6365  funss  6585  funres11  6646  funcnvres  6647  foimacnv  6871  funcnvuni  7977  tposss  8281  vdwnnlem1  17219  structcnvcnv  17377  catcoppccl  18344  cnvps  18804  tsrdir  18830  ustneism  24600  metustsym  24931  metust  24934  pi1xfrcnv  25435  eulerpartlemmf  35119  cossidres2  38223  cossidcnvss2  38224  cossidcnvss  38225  cossididres  38226  cossididresb  38229  nvo2  38231  nvo3  38232  relcnveq3  39527  elrelscnveq3  39827  disjss  40031  trclubgNEW  44939  clrellem  44943  clcnvlem  44944  cnvrcl0  44946  cnvtrcl0  44947  cnvtrrel  44991  relexpaddss  45039
  Copyright terms: Public domain W3C validator