| 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 35218. 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 35064 | 1 ⊢ 𝐺 ∈ V |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1562 ∈ wcel 2144 Vcvv 3456 ∪ cun 3904 {csn 4584 〈cop 4590 ∪ ciun 4951 ‘cfv 6523 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 ax-sep 5248 ax-pr 5392 ax-un 7720 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-tru 1565 df-ex 1802 df-sb 2093 df-clab 2743 df-cleq 2756 df-clel 2839 df-v 3458 df-un 3911 df-ss 3923 df-sn 4585 df-pr 4587 df-uni 4868 |
| This theorem is referenced by: bnj600 35216 bnj908 35228 |
| Copyright terms: Public domain | W3C validator |