| 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 34987 | . 2 ⊢ pred(𝑋, 𝐴, 𝑅) = {𝑦 ∈ 𝐴 ∣ 𝑦𝑅𝑋} | |
| 2 | 1 | ssrab3 4037 | 1 ⊢ pred(𝑋, 𝐴, 𝑅) ⊆ 𝐴 |
| Colors of variables: wff setvar class |
| Syntax hints: ⊆ wss 3906 class class class wbr 5102 predc-bnj14 34986 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1817 ax-4 1831 ax-5 1932 ax-6 1989 ax-7 2030 ax-8 2146 ax-9 2154 ax-ext 2736 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-ex 1802 df-sb 2093 df-clab 2743 df-cleq 2756 df-clel 2839 df-rab 3417 df-ss 3923 df-bnj14 34987 |
| This theorem is referenced by: bnj229 35181 bnj517 35182 bnj1128 35287 bnj1145 35290 bnj1137 35292 bnj1408 35333 bnj1417 35338 bnj1523 35368 |
| Copyright terms: Public domain | W3C validator |