Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > predpredss | Structured version Visualization version GIF version |
Description: If 𝐴 is a subset of 𝐵, then their predecessor classes are also subsets. (Contributed by Scott Fenton, 2-Feb-2011.) |
Ref | Expression |
---|---|
predpredss | ⊢ (𝐴 ⊆ 𝐵 → Pred(𝑅, 𝐴, 𝑋) ⊆ Pred(𝑅, 𝐵, 𝑋)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ssrin 4164 | . 2 ⊢ (𝐴 ⊆ 𝐵 → (𝐴 ∩ (◡𝑅 “ {𝑋})) ⊆ (𝐵 ∩ (◡𝑅 “ {𝑋}))) | |
2 | df-pred 6191 | . 2 ⊢ Pred(𝑅, 𝐴, 𝑋) = (𝐴 ∩ (◡𝑅 “ {𝑋})) | |
3 | df-pred 6191 | . 2 ⊢ Pred(𝑅, 𝐵, 𝑋) = (𝐵 ∩ (◡𝑅 “ {𝑋})) | |
4 | 1, 2, 3 | 3sstr4g 3962 | 1 ⊢ (𝐴 ⊆ 𝐵 → Pred(𝑅, 𝐴, 𝑋) ⊆ Pred(𝑅, 𝐵, 𝑋)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∩ cin 3882 ⊆ wss 3883 {csn 4558 ◡ccnv 5579 “ cima 5583 Predcpred 6190 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-ext 2709 |
This theorem depends on definitions: df-bi 206 df-an 396 df-tru 1542 df-ex 1784 df-sb 2069 df-clab 2716 df-cleq 2730 df-clel 2817 df-v 3424 df-in 3890 df-ss 3900 df-pred 6191 |
This theorem is referenced by: preddowncl 6224 wfrlem8OLD 8118 |
Copyright terms: Public domain | W3C validator |