| Mathbox for Jonathan Ben-Naim |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > bnj213 | Structured version Visualization version GIF version | ||
| Description: First-order logic and set theory. (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| bnj213 | ⊢ pred(𝑋, 𝐴, 𝑅) ⊆ 𝐴 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-bnj14 34872 | . 2 ⊢ pred(𝑋, 𝐴, 𝑅) = {𝑦 ∈ 𝐴 ∣ 𝑦𝑅𝑋} | |
| 2 | 1 | ssrab3 4036 | 1 ⊢ pred(𝑋, 𝐴, 𝑅) ⊆ 𝐴 |
| Colors of variables: wff setvar class |
| Syntax hints: ⊆ wss 3903 class class class wbr 5100 predc-bnj14 34871 |
| 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 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-ext 2709 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-ex 1782 df-sb 2069 df-clab 2716 df-cleq 2729 df-clel 2812 df-rab 3402 df-ss 3920 df-bnj14 34872 |
| This theorem is referenced by: bnj229 35066 bnj517 35067 bnj1128 35172 bnj1145 35175 bnj1137 35177 bnj1408 35218 bnj1417 35223 bnj1523 35253 |
| Copyright terms: Public domain | W3C validator |