Theorem clsslem 15006

Description: The closure of a subclass is a subclass of the closure. (Contributed by RP, 16-May-2020.)

Assertion

Ref	Expression
clsslem	⊢ (𝑅 ⊆ 𝑆 → ∩ {𝑟 ∣ (𝑅 ⊆ 𝑟 ∧ 𝜑)} ⊆ ∩ {𝑟 ∣ (𝑆 ⊆ 𝑟 ∧ 𝜑)})

Distinct variable groups:   𝑅,𝑟   𝑆,𝑟

Allowed substitution hint:   𝜑(𝑟)

Proof of Theorem clsslem

Step	Hyp	Ref	Expression
1		sstr2 3972	. . . 4 ⊢ (𝑅 ⊆ 𝑆 → (𝑆 ⊆ 𝑟 → 𝑅 ⊆ 𝑟))
2	1	anim1d 611	. . 3 ⊢ (𝑅 ⊆ 𝑆 → ((𝑆 ⊆ 𝑟 ∧ 𝜑) → (𝑅 ⊆ 𝑟 ∧ 𝜑)))
3	2	ss2abdv 4048	. 2 ⊢ (𝑅 ⊆ 𝑆 → {𝑟 ∣ (𝑆 ⊆ 𝑟 ∧ 𝜑)} ⊆ {𝑟 ∣ (𝑅 ⊆ 𝑟 ∧ 𝜑)})
4		intss 4951	. 2 ⊢ ({𝑟 ∣ (𝑆 ⊆ 𝑟 ∧ 𝜑)} ⊆ {𝑟 ∣ (𝑅 ⊆ 𝑟 ∧ 𝜑)} → ∩ {𝑟 ∣ (𝑅 ⊆ 𝑟 ∧ 𝜑)} ⊆ ∩ {𝑟 ∣ (𝑆 ⊆ 𝑟 ∧ 𝜑)})
5	3, 4	syl 17	1 ⊢ (𝑅 ⊆ 𝑆 → ∩ {𝑟 ∣ (𝑅 ⊆ 𝑟 ∧ 𝜑)} ⊆ ∩ {𝑟 ∣ (𝑆 ⊆ 𝑟 ∧ 𝜑)})

Syntax hints:   → wi 4   ∧ wa 395  {cab 2712   ⊆ wss 3933  ∩ cint 4928

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1794  ax-4 1808  ax-5 1909  ax-6 1966  ax-7 2006  ax-9 2117  ax-ext 2706

This theorem depends on definitions:  df-bi 207  df-an 396  df-ex 1779  df-sb 2064  df-clab 2713  df-cleq 2726  df-ral 3051  df-ss 3950  df-int 4929

This theorem is referenced by:  trclsslem  15012