| Mathbox for Jonathan Ben-Naim |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > bnj1152 | Structured version Visualization version GIF version | ||
| Description: Technical lemma for bnj69 35145. This lemma may no longer be used or have become an indirect lemma of the theorem in question (i.e. a lemma of a lemma... of the theorem). (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| bnj1152 | ⊢ (𝑌 ∈ pred(𝑋, 𝐴, 𝑅) ↔ (𝑌 ∈ 𝐴 ∧ 𝑌𝑅𝑋)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | breq1 5100 | . 2 ⊢ (𝑦 = 𝑌 → (𝑦𝑅𝑋 ↔ 𝑌𝑅𝑋)) | |
| 2 | df-bnj14 34824 | . 2 ⊢ pred(𝑋, 𝐴, 𝑅) = {𝑦 ∈ 𝐴 ∣ 𝑦𝑅𝑋} | |
| 3 | 1, 2 | elrab2 3648 | 1 ⊢ (𝑌 ∈ pred(𝑋, 𝐴, 𝑅) ↔ (𝑌 ∈ 𝐴 ∧ 𝑌𝑅𝑋)) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 206 ∧ wa 395 ∈ wcel 2114 class class class wbr 5097 predc-bnj14 34823 |
| 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 2707 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-sb 2069 df-clab 2714 df-cleq 2727 df-clel 2810 df-rab 3399 df-v 3441 df-dif 3903 df-un 3905 df-ss 3917 df-nul 4285 df-if 4479 df-sn 4580 df-pr 4582 df-op 4586 df-br 5098 df-bnj14 34824 |
| This theorem is referenced by: bnj1175 35139 bnj1177 35141 bnj1388 35168 |
| Copyright terms: Public domain | W3C validator |