Theorem ssrd 3019

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 1458	. 2 ⊢ (𝜑 → ∀𝑥(𝑥 ∈ 𝐴 → 𝑥 ∈ 𝐵))
4		ssrd.1	. . 3 ⊢ Ⅎ𝑥𝐴
5		ssrd.2	. . 3 ⊢ Ⅎ𝑥𝐵
6	4, 5	dfss2f 3005	. 2 ⊢ (𝐴 ⊆ 𝐵 ↔ ∀𝑥(𝑥 ∈ 𝐴 → 𝑥 ∈ 𝐵))
7	3, 6	sylibr 132	1 ⊢ (𝜑 → 𝐴 ⊆ 𝐵)

Syntax hints:   → wi 4  ∀wal 1285  Ⅎwnf 1392   ∈ wcel 1436  Ⅎwnfc 2212   ⊆ wss 2988

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 663  ax-5 1379  ax-7 1380  ax-gen 1381  ax-ie1 1425  ax-ie2 1426  ax-8 1438  ax-10 1439  ax-11 1440  ax-i12 1441  ax-bndl 1442  ax-4 1443  ax-17 1462  ax-i9 1466  ax-ial 1470  ax-i5r 1471  ax-ext 2067

This theorem depends on definitions:  df-bi 115  df-nf 1393  df-sb 1690  df-clab 2072  df-cleq 2078  df-clel 2081  df-nfc 2214  df-in 2994  df-ss 3001

This theorem is referenced by:  eqrd  3032  exmidomni  6742