Theorem ssrd 3573

Description: Deduction rule based on subclass definition. (Contributed by Thierry Arnoux, 8-Mar-2017.)

Hypotheses

Ref	Expression
ssrd.0	⊢ Ⅎ𝑥𝜑
ssrd.1	⊢ Ⅎ𝑥𝐴
ssrd.2	⊢ Ⅎ𝑥𝐵
ssrd.3	⊢ (𝜑 → (𝑥 ∈ 𝐴 → 𝑥 ∈ 𝐵))

Assertion

Ref	Expression
ssrd	⊢ (𝜑 → 𝐴 ⊆ 𝐵)

Proof of Theorem ssrd

Step	Hyp	Ref	Expression
1		ssrd.0	. . 3 ⊢ Ⅎ𝑥𝜑
2		ssrd.3	. . 3 ⊢ (𝜑 → (𝑥 ∈ 𝐴 → 𝑥 ∈ 𝐵))
3	1, 2	alrimi 2069	. 2 ⊢ (𝜑 → ∀𝑥(𝑥 ∈ 𝐴 → 𝑥 ∈ 𝐵))
4		ssrd.1	. . 3 ⊢ Ⅎ𝑥𝐴
5		ssrd.2	. . 3 ⊢ Ⅎ𝑥𝐵
6	4, 5	dfss2f 3559	. 2 ⊢ (𝐴 ⊆ 𝐵 ↔ ∀𝑥(𝑥 ∈ 𝐴 → 𝑥 ∈ 𝐵))
7	3, 6	sylibr 223	1 ⊢ (𝜑 → 𝐴 ⊆ 𝐵)

Syntax hints:   → wi 4  ∀wal 1473  Ⅎwnf 1699   ∈ wcel 1977  Ⅎwnfc 2738   ⊆ wss 3540

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590

This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-in 3547  df-ss 3554

This theorem is referenced by:  eqrd  3586  neiptopnei  20746  rabss3d  28736  topdifinffinlem  32371  relowlssretop  32387  ssfiunibd  38464  stoweidlem52  38945  stoweidlem59  38952