Theorem cnvss 5857

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.

Step	Hyp	Ref	Expression
1		ssbr 5154	. . 3 ⊢ (𝐴 ⊆ 𝐵 → (𝑦𝐴𝑥 → 𝑦𝐵𝑥))
2	1	ssopab2dv 5535	. 2 ⊢ (𝐴 ⊆ 𝐵 → {⟨𝑥, 𝑦⟩ ∣ 𝑦𝐴𝑥} ⊆ {⟨𝑥, 𝑦⟩ ∣ 𝑦𝐵𝑥})
3		df-cnv 5668	. 2 ⊢ ◡𝐴 = {⟨𝑥, 𝑦⟩ ∣ 𝑦𝐴𝑥}
4		df-cnv 5668	. 2 ⊢ ◡𝐵 = {⟨𝑥, 𝑦⟩ ∣ 𝑦𝐵𝑥}
5	2, 3, 4	3sstr4g 3989	1 ⊢ (𝐴 ⊆ 𝐵 → ◡𝐴 ⊆ ◡𝐵)

This proof depends on syntax axioms:   → wi 4   ⊆ wss 3904   class class class wbr 5108  {copab 5172  ^◡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

This proof depends on definitions:  df-bi 210  df-an 401  df-ex 1809  df-sb 2096  df-clab 2741  df-cleq 2754  df-clel 2837  df-ss 3921  df-br 5109  df-opab 5173  df-cnv 5668

This theorem is used by:  cnveq  5858  rnss  5928  relcnvtrg  6267  relcnvtrgOLD  6268  predrelss  6338  funss  6555  funres11  6613  funcnvres  6614  foimacnv  6838  funcnvuni  7927  tposss  8221  vdwnnlem1  17061  structcnvcnv  17219  catcoppccl  18180  cnvps  18640  tsrdir  18666  ustneism  24392  metustsym  24723  metust  24726  pi1xfrcnv  25227  eulerpartlemmf  34774  relcnveq3  39004  elrelscnveq3  39304  disjss  39508  cnvssb  44340  trclubgNEW  44372  clrellem  44376  clcnvlem  44377  cnvrcl0  44379  cnvtrcl0  44380  cnvtrrel  44424  relexpaddss  44472