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 4210 | . 2 ⊢ (𝐴 ⊆ 𝐵 → (𝐴 ∩ (◡𝑅 “ {𝑋})) ⊆ (𝐵 ∩ (◡𝑅 “ {𝑋}))) | |
2 | df-pred 6148 | . 2 ⊢ Pred(𝑅, 𝐴, 𝑋) = (𝐴 ∩ (◡𝑅 “ {𝑋})) | |
3 | df-pred 6148 | . 2 ⊢ Pred(𝑅, 𝐵, 𝑋) = (𝐵 ∩ (◡𝑅 “ {𝑋})) | |
4 | 1, 2, 3 | 3sstr4g 4012 | 1 ⊢ (𝐴 ⊆ 𝐵 → Pred(𝑅, 𝐴, 𝑋) ⊆ Pred(𝑅, 𝐵, 𝑋)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∩ cin 3935 ⊆ wss 3936 {csn 4567 ◡ccnv 5554 “ cima 5558 Predcpred 6147 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-v 3496 df-in 3943 df-ss 3952 df-pred 6148 |
This theorem is referenced by: preddowncl 6175 wfrlem8 7962 |
Copyright terms: Public domain | W3C validator |