Theorem ssrabi 38963

Description: Inference of restricted abstraction subclass from implication. (Contributed by Peter Mazsa, 26-Oct-2022.)

Hypothesis

Ref	Expression
ssrabi.1	⊢ (𝜑 → 𝜓)

Assertion

Ref	Expression
ssrabi	⊢ {𝑥 ∈ 𝐴 ∣ 𝜑} ⊆ {𝑥 ∈ 𝐴 ∣ 𝜓}

Proof of Theorem ssrabi

Step	Hyp	Ref	Expression
1		ssrabi.1	. . 3 ⊢ (𝜑 → 𝜓)
2	1	a1i 11	. 2 ⊢ (𝑥 ∈ 𝐴 → (𝜑 → 𝜓))
3	2	ss2rabi 4031	1 ⊢ {𝑥 ∈ 𝐴 ∣ 𝜑} ⊆ {𝑥 ∈ 𝐴 ∣ 𝜓}

This proof depends on syntax axioms:   → wi 4   ∈ wcel 2146  {crab 3418   ⊆ wss 3906

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 1943  ax-6 2000  ax-7 2041  ax-9 2156  ax-ext 2737

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2744  df-cleq 2757  df-ral 3082  df-rab 3419  df-ss 3923

This theorem is used by:  refrelsredund4  39427