ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  cnvss GIF version

Theorem cnvss 4955
Description: Subset theorem for converse. (Contributed by NM, 22-Mar-1998.)
Assertion
Ref Expression
cnvss (𝐴 ⊆ 𝐵 → ◡𝐴 ⊆ ◡𝐵)

Proof of Theorem cnvss
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ssel 3242 . . . 4 (𝐴 ⊆ 𝐵 → (⟨𝑦, 𝑥⟩ ∈ 𝐴 → ⟨𝑦, 𝑥⟩ ∈ 𝐵))
2 df-br 4132 . . . 4 (𝑦𝐴𝑥 ↔ ⟨𝑦, 𝑥⟩ ∈ 𝐴)
3 df-br 4132 . . . 4 (𝑦𝐵𝑥 ↔ ⟨𝑦, 𝑥⟩ ∈ 𝐵)
41, 2, 33imtr4g 205 . . 3 (𝐴 ⊆ 𝐵 → (𝑦𝐴𝑥 → 𝑦𝐵𝑥))
54ssopab2dv 4423 . 2 (𝐴 ⊆ 𝐵 → {⟨𝑥, 𝑦⟩ ∣ 𝑦𝐴𝑥} ⊆ {⟨𝑥, 𝑦⟩ ∣ 𝑦𝐵𝑥})
6 df-cnv 4784 . 2 ◡𝐴 = {⟨𝑥, 𝑦⟩ ∣ 𝑦𝐴𝑥}
7 df-cnv 4784 . 2 ◡𝐵 = {⟨𝑥, 𝑦⟩ ∣ 𝑦𝐵𝑥}
85, 6, 73sstr4g 3291 1 (𝐴 ⊆ 𝐵 → ◡𝐴 ⊆ ◡𝐵)
Colors of variables:    wff set class
This proof depends on syntax axioms:   → wi 4   ∈ wcel 2209   ⊆ wss 3220  ⟨cop 3712   class class class wbr 4131  {copab 4192  ◡ccnv 4775
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-ext 2220
This proof depends on definitions:  df-bi 117  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-in 3226  df-ss 3233  df-br 4132  df-opab 4194  df-cnv 4784
This theorem is used by:  cnveq  4956  rnss  5014  relcnvtr  5310  funss  5399  funcnvuni  5453  funres11  5456  funcnvres  5457  foimacnv  5660  tposss  6521  structcnvcnv  13426  pw1nct  17238
  Copyright terms: Public domain W3C validator