Theorem bnj528 34520

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

Syntax hints:   = wceq 1534   ∈ wcel 2099  Vcvv 3471   ∪ cun 3945  {csn 4629  ⟨cop 4635  ∪ ciun 4996  ‘cfv 6548   predc-bnj14 34319

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1906  ax-6 1964  ax-7 2004  ax-8 2101  ax-9 2109  ax-ext 2699  ax-sep 5299  ax-nul 5306  ax-pr 5429  ax-un 7740

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 847  df-tru 1537  df-fal 1547  df-ex 1775  df-sb 2061  df-clab 2706  df-cleq 2720  df-clel 2806  df-v 3473  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-nul 4324  df-sn 4630  df-pr 4632  df-uni 4909

This theorem is referenced by:  bnj600  34550  bnj908  34562