Theorem bnj528 34879

Description: Technical lemma for bnj852 34911. 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 34756	1 ⊢ 𝐺 ∈ V

Syntax hints:   = wceq 1540   ∈ wcel 2109  Vcvv 3447   ∪ cun 3912  {csn 4589  ⟨cop 4595  ∪ ciun 4955  ‘cfv 6511   predc-bnj14 34678

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 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-ext 2701  ax-sep 5251  ax-nul 5261  ax-pr 5387  ax-un 7711

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-tru 1543  df-fal 1553  df-ex 1780  df-sb 2066  df-clab 2708  df-cleq 2721  df-clel 2803  df-v 3449  df-dif 3917  df-un 3919  df-ss 3931  df-nul 4297  df-sn 4590  df-pr 4592  df-uni 4872

This theorem is referenced by:  bnj600  34909  bnj908  34921