Theorem bnj918 34909

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

Step	Hyp	Ref	Expression
1		bnj918.1	. 2 ⊢ 𝐺 = (𝑓 ∪ {⟨𝑛, 𝐶⟩})
2		vex 3433	. . 3 ⊢ 𝑓 ∈ V
3		snex 5381	. . 3 ⊢ {⟨𝑛, 𝐶⟩} ∈ V
4	2, 3	unex 7698	. 2 ⊢ (𝑓 ∪ {⟨𝑛, 𝐶⟩}) ∈ V
5	1, 4	eqeltri 2832	1 ⊢ 𝐺 ∈ V

Syntax hints:   = wceq 1542   ∈ wcel 2114  Vcvv 3429   ∪ cun 3887  {csn 4567  ⟨cop 4573

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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-ext 2708  ax-sep 5231  ax-pr 5375  ax-un 7689

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-tru 1545  df-ex 1782  df-sb 2069  df-clab 2715  df-cleq 2728  df-clel 2811  df-v 3431  df-un 3894  df-ss 3906  df-sn 4568  df-pr 4570  df-uni 4851

This theorem is referenced by:  bnj528  35031  bnj929  35078  bnj965  35084  bnj910  35090  bnj985v  35095  bnj985  35096  bnj999  35100  bnj1018g  35105  bnj1018  35106  bnj907  35109