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 30245. 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 30090 | 1 ⊢ 𝐺 ∈ V |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1475 ∈ wcel 1977 Vcvv 3173 ∪ cun 3538 {csn 4125 〈cop 4131 ∪ ciun 4455 ‘cfv 5804 predc-bnj14 30007 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-sep 4709 ax-nul 4717 ax-pr 4833 ax-un 6847 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-rex 2902 df-v 3175 df-dif 3543 df-un 3545 df-nul 3875 df-sn 4126 df-pr 4128 df-uni 4373 |
This theorem is referenced by: bnj600 30243 bnj908 30255 |
Copyright terms: Public domain | W3C validator |