| 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 35186 | . 2 ⊢ pred(𝑋, 𝐴, 𝑅) = {𝑦 ∈ 𝐴 ∣ 𝑦𝑅𝑋} | |
| 2 | 1 | ssrab3 4033 | 1 ⊢ pred(𝑋, 𝐴, 𝑅) ⊆ 𝐴 |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ⊆ wss 3902 class class class wbr 5107 predc-bnj14 35185 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-ext 2734 |
| This proof depends on definitions: df-bi 210 df-an 402 df-ex 1813 df-sb 2100 df-clab 2741 df-cleq 2754 df-clel 2837 df-rab 3415 df-ss 3919 df-bnj14 35186 |
| This theorem is used by: bnj229 35380 bnj517 35381 bnj1128 35486 bnj1145 35489 bnj1137 35491 bnj1408 35532 bnj1417 35537 bnj1523 35567 |
| Copyright terms: Public domain | W3C validator |