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 32039
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 3499 . . 3 𝑓 ∈ V
3 snex 5334 . . 3 {⟨𝑛, 𝐶⟩} ∈ V
42, 3unex 7471 . 2 (𝑓 ∪ {⟨𝑛, 𝐶⟩}) ∈ V
51, 4eqeltri 2911 1 𝐺 ∈ V
Colors of variables: wff setvar class
Syntax hints:   = wceq 1537  wcel 2114  Vcvv 3496  cun 3936  {csn 4569  cop 4575
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2795  ax-sep 5205  ax-nul 5212  ax-pr 5332  ax-un 7463
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-clab 2802  df-cleq 2816  df-clel 2895  df-nfc 2965  df-v 3498  df-dif 3941  df-un 3943  df-in 3945  df-ss 3954  df-nul 4294  df-sn 4570  df-pr 4572  df-uni 4841
This theorem is referenced by:  bnj528  32163  bnj929  32210  bnj965  32216  bnj910  32222  bnj985v  32227  bnj985  32228  bnj999  32232  bnj1018g  32237  bnj1018  32238  bnj907  32241
  Copyright terms: Public domain W3C validator