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 32801. 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 32646 | 1 ⊢ 𝐺 ∈ V |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1539 ∈ wcel 2108 Vcvv 3422 ∪ cun 3881 {csn 4558 〈cop 4564 ∪ ciun 4921 ‘cfv 6418 predc-bnj14 32567 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-ext 2709 ax-sep 5218 ax-nul 5225 ax-pr 5347 ax-un 7566 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-tru 1542 df-fal 1552 df-ex 1784 df-sb 2069 df-clab 2716 df-cleq 2730 df-clel 2817 df-v 3424 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4254 df-sn 4559 df-pr 4561 df-uni 4837 |
This theorem is referenced by: bnj600 32799 bnj908 32811 |
Copyright terms: Public domain | W3C validator |