Theorem ssrd 3253

Description: Deduction 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 1575	. 2 ⊢ (𝜑 → ∀𝑥(𝑥 ∈ 𝐴 → 𝑥 ∈ 𝐵))
4		ssrd.1	. . 3 ⊢ Ⅎ𝑥𝐴
5		ssrd.2	. . 3 ⊢ Ⅎ𝑥𝐵
6	4, 5	dfss2f 3239	. 2 ⊢ (𝐴 ⊆ 𝐵 ↔ ∀𝑥(𝑥 ∈ 𝐴 → 𝑥 ∈ 𝐵))
7	3, 6	sylibr 134	1 ⊢ (𝜑 → 𝐴 ⊆ 𝐵)

Syntax hints:   → wi 4  ∀wal 1400  Ⅎwnf 1513   ∈ wcel 2209  Ⅎwnfc 2379   ⊆ wss 3220

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-ext 2220

This theorem depends on definitions:  df-bi 117  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-in 3226  df-ss 3233

This theorem is referenced by:  eqrd  3266  exmidomni  7472