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

Theorem relssi 5771
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 5766 . . 3 (Rel 𝐴 → (𝐴 ⊆ 𝐵 ↔ ∀𝑥∀𝑦(⟨𝑥, 𝑦⟩ ∈ 𝐴 → ⟨𝑥, 𝑦⟩ ∈ 𝐵)))
31, 2ax-mp 5 . 2 (𝐴 ⊆ 𝐵 ↔ ∀𝑥∀𝑦(⟨𝑥, 𝑦⟩ ∈ 𝐴 → ⟨𝑥, 𝑦⟩ ∈ 𝐵))
4 relssi.2 . . 3 (⟨𝑥, 𝑦⟩ ∈ 𝐴 → ⟨𝑥, 𝑦⟩ ∈ 𝐵)
54ax-gen 1830 . 2 ∀𝑦(⟨𝑥, 𝑦⟩ ∈ 𝐴 → ⟨𝑥, 𝑦⟩ ∈ 𝐵)
63, 5mpgbir 1834 1 𝐴 ⊆ 𝐵
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209  ∀wal 1570   ∈ wcel 2150   ⊆ wss 3899  ⟨cop 4839  Rel wrel 5662
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-tru 1575  df-ex 1815  df-sb 2104  df-clab 2745  df-cleq 2758  df-clel 2842  df-ss 3900  df-opab 5173  df-xp 5663  df-rel 5664
This theorem is used by:  xpsspw  5795  oprssdm  7633  dftpos4  8299  enssdomOLD  9041  idssen  9061  ttrcltr  9753  txuni2  23941  acycgr0v  36112  prclisacycgr  36115  txpss3v  36856  pprodss4v  36862  comodular  38209  bj-idres  38351  xrnss3v  39581  aoprssdm  48605
  Copyright terms: Public domain W3C validator