Theorem relssi 5762

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 5758	. . 3 ⊢ (Rel 𝐴 → (𝐴 ⊆ 𝐵 ↔ ∀𝑥∀𝑦(⟨𝑥, 𝑦⟩ ∈ 𝐴 → ⟨𝑥, 𝑦⟩ ∈ 𝐵)))
3	1, 2	ax-mp 5	. 2 ⊢ (𝐴 ⊆ 𝐵 ↔ ∀𝑥∀𝑦(⟨𝑥, 𝑦⟩ ∈ 𝐴 → ⟨𝑥, 𝑦⟩ ∈ 𝐵))
4		relssi.2	. . 3 ⊢ (⟨𝑥, 𝑦⟩ ∈ 𝐴 → ⟨𝑥, 𝑦⟩ ∈ 𝐵)
5	4	ax-gen 1827	. 2 ⊢ ∀𝑦(⟨𝑥, 𝑦⟩ ∈ 𝐴 → ⟨𝑥, 𝑦⟩ ∈ 𝐵)
6	3, 5	mpgbir 1831	1 ⊢ 𝐴 ⊆ 𝐵

This proof depends on syntax axioms:   → wi 4   ↔ wb 209  ∀wal 1567   ∈ wcel 2144   ⊆ wss 3895  ⟨cop 4589  Rel wrel 5655

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1572  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-v 3452  df-ss 3896  df-opab 5167  df-xp 5656  df-rel 5657

This theorem is used by:  xpsspw  5786  oprssdm  7602  dftpos4  8262  enssdomOLD  9004  idssen  9024  ttrcltr  9717  txuni2  23884  acycgr0v  35913  prclisacycgr  35916  txpss3v  36640  pprodss4v  36646  bj-idres  38082  xrnss3v  39314  aoprssdm  48272