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 32041
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 3500 . . 3 𝑓 ∈ V
3 snex 5335 . . 3 {⟨𝑛, 𝐶⟩} ∈ V
42, 3unex 7472 . 2 (𝑓 ∪ {⟨𝑛, 𝐶⟩}) ∈ V
51, 4eqeltri 2912 1 𝐺 ∈ V
Colors of variables: wff setvar class
Syntax hints:   = wceq 1536  wcel 2113  Vcvv 3497  cun 3937  {csn 4570  cop 4576
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1969  ax-7 2014  ax-8 2115  ax-9 2123  ax-10 2144  ax-11 2160  ax-12 2176  ax-ext 2796  ax-sep 5206  ax-nul 5213  ax-pr 5333  ax-un 7464
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-tru 1539  df-ex 1780  df-nf 1784  df-sb 2069  df-clab 2803  df-cleq 2817  df-clel 2896  df-nfc 2966  df-v 3499  df-dif 3942  df-un 3944  df-in 3946  df-ss 3955  df-nul 4295  df-sn 4571  df-pr 4573  df-uni 4842
This theorem is referenced by:  bnj528  32165  bnj929  32212  bnj965  32218  bnj910  32224  bnj985v  32229  bnj985  32230  bnj999  32234  bnj1018g  32239  bnj1018  32240  bnj907  32243
  Copyright terms: Public domain W3C validator