![]() |
Mathbox for Jonathan Ben-Naim |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > bnj918 | Structured version Visualization version GIF version |
Description: First-order logic and set theory. (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (New usage is discouraged.) |
Ref | Expression |
---|---|
bnj918.1 | ⊢ 𝐺 = (𝑓 ∪ {〈𝑛, 𝐶〉}) |
Ref | Expression |
---|---|
bnj918 | ⊢ 𝐺 ∈ V |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | bnj918.1 | . 2 ⊢ 𝐺 = (𝑓 ∪ {〈𝑛, 𝐶〉}) | |
2 | vex 3470 | . . 3 ⊢ 𝑓 ∈ V | |
3 | snex 5421 | . . 3 ⊢ {〈𝑛, 𝐶〉} ∈ V | |
4 | 2, 3 | unex 7726 | . 2 ⊢ (𝑓 ∪ {〈𝑛, 𝐶〉}) ∈ V |
5 | 1, 4 | eqeltri 2821 | 1 ⊢ 𝐺 ∈ V |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1533 ∈ wcel 2098 Vcvv 3466 ∪ cun 3938 {csn 4620 〈cop 4626 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-ext 2695 ax-sep 5289 ax-nul 5296 ax-pr 5417 ax-un 7718 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-tru 1536 df-fal 1546 df-ex 1774 df-sb 2060 df-clab 2702 df-cleq 2716 df-clel 2802 df-v 3468 df-dif 3943 df-un 3945 df-in 3947 df-ss 3957 df-nul 4315 df-sn 4621 df-pr 4623 df-uni 4900 |
This theorem is referenced by: bnj528 34389 bnj929 34436 bnj965 34442 bnj910 34448 bnj985v 34453 bnj985 34454 bnj999 34458 bnj1018g 34463 bnj1018 34464 bnj907 34467 |
Copyright terms: Public domain | W3C validator |