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

Theorem relssi 5663
Description: Inference from subclass principle for relations. (Contributed by NM, 31-Mar-1998.)
Hypotheses
Ref Expression
relssi.1 Rel 𝐴
relssi.2 (⟨𝑥, 𝑦⟩ ∈ 𝐴 → ⟨𝑥, 𝑦⟩ ∈ 𝐵)
Assertion
Ref Expression
relssi 𝐴𝐵
Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝐵,𝑦

Proof of Theorem relssi
StepHypRef Expression
1 relssi.1 . . 3 Rel 𝐴
2 ssrel 5660 . . 3 (Rel 𝐴 → (𝐴𝐵 ↔ ∀𝑥𝑦(⟨𝑥, 𝑦⟩ ∈ 𝐴 → ⟨𝑥, 𝑦⟩ ∈ 𝐵)))
31, 2ax-mp 5 . 2 (𝐴𝐵 ↔ ∀𝑥𝑦(⟨𝑥, 𝑦⟩ ∈ 𝐴 → ⟨𝑥, 𝑦⟩ ∈ 𝐵))
4 relssi.2 . . 3 (⟨𝑥, 𝑦⟩ ∈ 𝐴 → ⟨𝑥, 𝑦⟩ ∈ 𝐵)
54ax-gen 1795 . 2 𝑦(⟨𝑥, 𝑦⟩ ∈ 𝐴 → ⟨𝑥, 𝑦⟩ ∈ 𝐵)
63, 5mpgbir 1799 1 𝐴𝐵
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wal 1534  wcel 2113  wss 3939  cop 4576  Rel wrel 5563
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1969  ax-7 2014  ax-8 2115  ax-9 2123  ax-10 2144  ax-11 2160  ax-12 2176  ax-ext 2796
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-tru 1539  df-ex 1780  df-nf 1784  df-sb 2069  df-clab 2803  df-cleq 2817  df-clel 2896  df-in 3946  df-ss 3955  df-opab 5132  df-xp 5564  df-rel 5565
This theorem is referenced by:  xpsspw  5685  oprssdm  7332  dftpos4  7914  enssdom  8537  idssen  8557  txuni2  22176  acycgr0v  32399  prclisacycgr  32402  txpss3v  33343  pprodss4v  33349  bj-idres  34456  xrnss3v  35628  aoprssdm  43408
  Copyright terms: Public domain W3C validator