Users' Mathboxes Mathbox for Jonathan Ben-Naim < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  bnj528 Structured version   Visualization version   GIF version

Theorem bnj528 35071
Description: Technical lemma for bnj852 35103. 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
StepHypRef Expression
1 bnj528.1 . 2 𝐺 = (𝑓 ∪ {⟨𝑚, 𝑦 ∈ (𝑓𝑝) pred(𝑦, 𝐴, 𝑅)⟩})
21bnj918 34949 1 𝐺 ∈ V
Colors of variables: wff setvar class
Syntax hints:   = wceq 1547  wcel 2119  Vcvv 3431  cun 3881  {csn 4555  cop 4561   ciun 4921  cfv 6485   predc-bnj14 34871
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-ext 2711  ax-sep 5218  ax-pr 5362  ax-un 7678
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-tru 1550  df-ex 1787  df-sb 2074  df-clab 2718  df-cleq 2731  df-clel 2814  df-v 3433  df-un 3888  df-ss 3900  df-sn 4556  df-pr 4558  df-uni 4839
This theorem is referenced by:  bnj600  35101  bnj908  35113
  Copyright terms: Public domain W3C validator