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

Step	Hyp	Ref	Expression
1		relssi.1	. . 3 ⊢ Rel 𝐴
2		ssrel 5767	. . 3 ⊢ (Rel 𝐴 → (𝐴 ⊆ 𝐵 ↔ ∀𝑥∀𝑦(⟨𝑥, 𝑦⟩ ∈ 𝐴 → ⟨𝑥, 𝑦⟩ ∈ 𝐵)))
3	1, 2	ax-mp 5	. 2 ⊢ (𝐴 ⊆ 𝐵 ↔ ∀𝑥∀𝑦(⟨𝑥, 𝑦⟩ ∈ 𝐴 → ⟨𝑥, 𝑦⟩ ∈ 𝐵))
4		relssi.2	. . 3 ⊢ (⟨𝑥, 𝑦⟩ ∈ 𝐴 → ⟨𝑥, 𝑦⟩ ∈ 𝐵)
5	4	ax-gen 1828	. 2 ⊢ ∀𝑦(⟨𝑥, 𝑦⟩ ∈ 𝐴 → ⟨𝑥, 𝑦⟩ ∈ 𝐵)
6	3, 5	mpgbir 1832	1 ⊢ 𝐴 ⊆ 𝐵

This proof depends on syntax axioms:   → wi 4   ↔ wb 209  ∀wal 1568   ∈ wcel 2145   ⊆ wss 3902  ⟨cop 4593  Rel wrel 5664

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2734

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2741  df-cleq 2754  df-clel 2837  df-v 3455  df-ss 3919  df-opab 5172  df-xp 5665  df-rel 5666

This theorem is used by:  xpsspw  5794  oprssdm  7598  dftpos4  8246  enssdomOLD  8986  idssen  9006  ttrcltr  9698  txuni2  23792  acycgr0v  35714  prclisacycgr  35717  txpss3v  36442  pprodss4v  36448  bj-idres  37899  xrnss3v  39116  aoprssdm  48077