Users' Mathboxes Mathbox for Jonathan Ben-Naim < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  bnj918 Structured version   Visualization version   GIF version

Theorem bnj918 32147
Description: First-order logic and set theory. (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (New usage is discouraged.)
Hypothesis
Ref Expression
bnj918.1 𝐺 = (𝑓 ∪ {⟨𝑛, 𝐶⟩})
Assertion
Ref Expression
bnj918 𝐺 ∈ V

Proof of Theorem bnj918
StepHypRef Expression
1 bnj918.1 . 2 𝐺 = (𝑓 ∪ {⟨𝑛, 𝐶⟩})
2 vex 3444 . . 3 𝑓 ∈ V
3 snex 5297 . . 3 {⟨𝑛, 𝐶⟩} ∈ V
42, 3unex 7449 . 2 (𝑓 ∪ {⟨𝑛, 𝐶⟩}) ∈ V
51, 4eqeltri 2886 1 𝐺 ∈ V
Colors of variables: wff setvar class
Syntax hints:   = wceq 1538  wcel 2111  Vcvv 3441  cun 3879  {csn 4525  cop 4531
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-ext 2770  ax-sep 5167  ax-nul 5174  ax-pr 5295  ax-un 7441
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-tru 1541  df-ex 1782  df-sb 2070  df-clab 2777  df-cleq 2791  df-clel 2870  df-v 3443  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-nul 4244  df-sn 4526  df-pr 4528  df-uni 4801
This theorem is referenced by:  bnj528  32271  bnj929  32318  bnj965  32324  bnj910  32330  bnj985v  32335  bnj985  32336  bnj999  32340  bnj1018g  32345  bnj1018  32346  bnj907  32349
  Copyright terms: Public domain W3C validator