Theorem rabss3d 4009

Description: Subclass law for restricted abstraction. (Contributed by Thierry Arnoux, 25-Sep-2017.)

Hypothesis

Ref	Expression
rabss3d.1	⊢ ((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 𝜓)) → 𝑥 ∈ 𝐵)

Assertion

Ref	Expression
rabss3d	⊢ (𝜑 → {𝑥 ∈ 𝐴 ∣ 𝜓} ⊆ {𝑥 ∈ 𝐵 ∣ 𝜓})

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝜑,𝑥

Allowed substitution hint:   𝜓(𝑥)

Proof of Theorem rabss3d

Step	Hyp	Ref	Expression
1		nfv 1949	. 2 ⊢ Ⅎ𝑥𝜑
2		nfrab1 3435	. 2 ⊢ Ⅎ𝑥{𝑥 ∈ 𝐴 ∣ 𝜓}
3		nfrab1 3435	. 2 ⊢ Ⅎ𝑥{𝑥 ∈ 𝐵 ∣ 𝜓}
4		rabss3d.1	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 𝜓)) → 𝑥 ∈ 𝐵)
5		simprr 785	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 𝜓)) → 𝜓)
6	4, 5	jca 521	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 𝜓)) → (𝑥 ∈ 𝐵 ∧ 𝜓))
7	6	ex 418	. . 3 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ∧ 𝜓) → (𝑥 ∈ 𝐵 ∧ 𝜓)))
8		rabid 3436	. . 3 ⊢ (𝑥 ∈ {𝑥 ∈ 𝐴 ∣ 𝜓} ↔ (𝑥 ∈ 𝐴 ∧ 𝜓))
9		rabid 3436	. . 3 ⊢ (𝑥 ∈ {𝑥 ∈ 𝐵 ∣ 𝜓} ↔ (𝑥 ∈ 𝐵 ∧ 𝜓))
10	7, 8, 9	3imtr4g 299	. 2 ⊢ (𝜑 → (𝑥 ∈ {𝑥 ∈ 𝐴 ∣ 𝜓} → 𝑥 ∈ {𝑥 ∈ 𝐵 ∣ 𝜓}))
11	1, 2, 3, 10	ssrd 3918	1 ⊢ (𝜑 → {𝑥 ∈ 𝐴 ∣ 𝜓} ⊆ {𝑥 ∈ 𝐵 ∣ 𝜓})

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∈ wcel 2147  {crab 3416   ⊆ wss 3900

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-ex 1813  df-nf 1817  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-rab 3417  df-ss 3901

This theorem is used by:  chnflenfi  18852  xpinpreima2  34650  reprss  35357  reprinfz1  35362  unitscyglem2  43512  unitscyglem4  43514  unitscyglem5  43515