| Mathbox for Jonathan Ben-Naim |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > bnj528 | Structured version Visualization version GIF version | ||
| Description: Technical lemma for bnj852 35618. 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 |
|---|---|
| bnj528.1 | ⊢ 𝐺 = (𝑓 ∪ {〈𝑚, ∪ 𝑦 ∈ (𝑓‘𝑝) pred(𝑦, 𝐴, 𝑅)〉}) |
| Ref | Expression |
|---|---|
| bnj528 | ⊢ 𝐺 ∈ V |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | bnj528.1 | . 2 ⊢ 𝐺 = (𝑓 ∪ {〈𝑚, ∪ 𝑦 ∈ (𝑓‘𝑝) pred(𝑦, 𝐴, 𝑅)〉}) | |
| 2 | 1 | bnj918 35464 | 1 ⊢ 𝐺 ∈ V |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1570 ∈ wcel 2147 Vcvv 3454 ∪ cun 4152 {csn 4588 〈cop 4838 ∪ ciun 4954 ‘cfv 6555 predc-bnj14 35386 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-ext 2735 ax-sep 5252 ax-pr 5395 ax-un 7772 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-tru 1573 df-ex 1813 df-sb 2102 df-clab 2742 df-cleq 2755 df-clel 2839 df-v 3456 df-ss 3901 df-un 4154 df-sn 4589 df-pr 4591 df-uni 4871 |
| This theorem is used by: bnj600 35616 bnj908 35628 |
| Copyright terms: Public domain | W3C validator |