| Mathbox for Jonathan Ben-Naim |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > bnj95 | Structured version Visualization version GIF version | ||
| Description: Technical lemma for bnj124 35268. 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 |
|---|---|
| bnj95.1 | ⊢ 𝐹 = {〈∅, pred(𝑥, 𝐴, 𝑅)〉} |
| Ref | Expression |
|---|---|
| bnj95 | ⊢ 𝐹 ∈ V |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | bnj95.1 | . 2 ⊢ 𝐹 = {〈∅, pred(𝑥, 𝐴, 𝑅)〉} | |
| 2 | snex 5409 | . 2 ⊢ {〈∅, pred(𝑥, 𝐴, 𝑅)〉} ∈ V | |
| 3 | 1, 2 | eqeltri 2858 | 1 ⊢ 𝐹 ∈ V |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1569 ∈ wcel 2142 Vcvv 3454 ∅c0 4285 {csn 4588 〈cop 4594 predc-bnj14 35086 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-8 2144 ax-9 2152 ax-ext 2734 ax-sep 5256 ax-pr 5403 |
| This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-tru 1572 df-ex 1809 df-sb 2096 df-clab 2741 df-cleq 2754 df-clel 2837 df-v 3456 df-un 3909 df-sn 4589 df-pr 4591 |
| This theorem is used by: bnj124 35268 bnj125 35269 bnj126 35270 bnj150 35273 |
| Copyright terms: Public domain | W3C validator |