Theorem predrelss 6238

Description: Subset carries from relation to predecessor class. (Contributed by Scott Fenton, 25-Nov-2024.)

Assertion

Ref	Expression
predrelss	⊢ (𝑅 ⊆ 𝑆 → Pred(𝑅, 𝐴, 𝑋) ⊆ Pred(𝑆, 𝐴, 𝑋))

Proof of Theorem predrelss

Step	Hyp	Ref	Expression
1		cnvss 5779	. . 3 ⊢ (𝑅 ⊆ 𝑆 → ◡𝑅 ⊆ ◡𝑆)
2		imass1 6007	. . 3 ⊢ (◡𝑅 ⊆ ◡𝑆 → (◡𝑅 “ {𝑋}) ⊆ (◡𝑆 “ {𝑋}))
3		sslin 4174	. . 3 ⊢ ((◡𝑅 “ {𝑋}) ⊆ (◡𝑆 “ {𝑋}) → (𝐴 ∩ (◡𝑅 “ {𝑋})) ⊆ (𝐴 ∩ (◡𝑆 “ {𝑋})))
4	1, 2, 3	3syl 18	. 2 ⊢ (𝑅 ⊆ 𝑆 → (𝐴 ∩ (◡𝑅 “ {𝑋})) ⊆ (𝐴 ∩ (◡𝑆 “ {𝑋})))
5		df-pred 6200	. 2 ⊢ Pred(𝑅, 𝐴, 𝑋) = (𝐴 ∩ (◡𝑅 “ {𝑋}))
6		df-pred 6200	. 2 ⊢ Pred(𝑆, 𝐴, 𝑋) = (𝐴 ∩ (◡𝑆 “ {𝑋}))
7	4, 5, 6	3sstr4g 3971	1 ⊢ (𝑅 ⊆ 𝑆 → Pred(𝑅, 𝐴, 𝑋) ⊆ Pred(𝑆, 𝐴, 𝑋))

Syntax hints:   → wi 4   ∩ cin 3891   ⊆ wss 3892  {csn 4567  ^◡ccnv 5588   “ cima 5592  Predcpred 6199

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1975  ax-7 2015  ax-8 2112  ax-9 2120  ax-ext 2711

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1545  df-fal 1555  df-ex 1787  df-sb 2072  df-clab 2718  df-cleq 2732  df-clel 2818  df-rab 3075  df-v 3433  df-dif 3895  df-un 3897  df-in 3899  df-ss 3909  df-nul 4263  df-if 4466  df-sn 4568  df-pr 4570  df-op 4574  df-br 5080  df-opab 5142  df-cnv 5597  df-dm 5599  df-rn 5600  df-res 5601  df-ima 5602  df-pred 6200

This theorem is referenced by:  frmin  9499