Theorem bnj528 34904

Description: Technical lemma for bnj852 34936. This lemma may no longer be used or have become an indirect lemma of the theorem in question (i.e. a lemma of a lemma... of the theorem). (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (New usage is discouraged.)

Hypothesis

Ref	Expression
bnj528.1	⊢ 𝐺 = (𝑓 ∪ {⟨𝑚, ∪ 𝑦 ∈ (𝑓‘𝑝) pred(𝑦, 𝐴, 𝑅)⟩})

Assertion

Ref	Expression
bnj528	⊢ 𝐺 ∈ V

Proof of Theorem bnj528

Step	Hyp	Ref	Expression
1		bnj528.1	. 2 ⊢ 𝐺 = (𝑓 ∪ {⟨𝑚, ∪ 𝑦 ∈ (𝑓‘𝑝) pred(𝑦, 𝐴, 𝑅)⟩})
2	1	bnj918 34781	1 ⊢ 𝐺 ∈ V

Syntax hints:   = wceq 1539   ∈ wcel 2107  Vcvv 3479   ∪ cun 3948  {csn 4625  ⟨cop 4631  ∪ ciun 4990  ‘cfv 6560   predc-bnj14 34703

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1794  ax-4 1808  ax-5 1909  ax-6 1966  ax-7 2006  ax-8 2109  ax-9 2117  ax-ext 2707  ax-sep 5295  ax-nul 5305  ax-pr 5431  ax-un 7756

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-tru 1542  df-fal 1552  df-ex 1779  df-sb 2064  df-clab 2714  df-cleq 2728  df-clel 2815  df-v 3481  df-dif 3953  df-un 3955  df-ss 3967  df-nul 4333  df-sn 4626  df-pr 4628  df-uni 4907

This theorem is referenced by:  bnj600  34934  bnj908  34946