![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > predss | Structured version Visualization version GIF version |
Description: The predecessor class of 𝐴 is a subset of 𝐴. (Contributed by Scott Fenton, 2-Feb-2011.) |
Ref | Expression |
---|---|
predss | ⊢ Pred(𝑅, 𝐴, 𝑋) ⊆ 𝐴 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-pred 6116 | . 2 ⊢ Pred(𝑅, 𝐴, 𝑋) = (𝐴 ∩ (◡𝑅 “ {𝑋})) | |
2 | inss1 4155 | . 2 ⊢ (𝐴 ∩ (◡𝑅 “ {𝑋})) ⊆ 𝐴 | |
3 | 1, 2 | eqsstri 3949 | 1 ⊢ Pred(𝑅, 𝐴, 𝑋) ⊆ 𝐴 |
Colors of variables: wff setvar class |
Syntax hints: ∩ cin 3880 ⊆ wss 3881 {csn 4525 ◡ccnv 5518 “ cima 5522 Predcpred 6115 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-ext 2770 |
This theorem depends on definitions: df-bi 210 df-an 400 df-ex 1782 df-sb 2070 df-clab 2777 df-cleq 2791 df-clel 2870 df-v 3443 df-in 3888 df-ss 3898 df-pred 6116 |
This theorem is referenced by: wfr3g 7936 wfrlem4 7941 wfrlem10 7947 nummin 32474 trpredlem1 33179 wsuclem 33225 frr3g 33234 fpr3g 33235 frrlem4 33239 frrlem13 33248 fpr1 33252 |
Copyright terms: Public domain | W3C validator |