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 32060
Description: Technical lemma for bnj852 32092. 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 31936 1 𝐺 ∈ V
Colors of variables: wff setvar class
Syntax hints:   = wceq 1528  wcel 2105  Vcvv 3492  cun 3931  {csn 4557  cop 4563   ciun 4910  cfv 6348   predc-bnj14 31857
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1787  ax-4 1801  ax-5 1902  ax-6 1961  ax-7 2006  ax-8 2107  ax-9 2115  ax-10 2136  ax-11 2151  ax-12 2167  ax-ext 2790  ax-sep 5194  ax-nul 5201  ax-pr 5320  ax-un 7450
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 842  df-tru 1531  df-ex 1772  df-nf 1776  df-sb 2061  df-clab 2797  df-cleq 2811  df-clel 2890  df-nfc 2960  df-rex 3141  df-v 3494  df-dif 3936  df-un 3938  df-nul 4289  df-sn 4558  df-pr 4560  df-uni 4831
This theorem is referenced by:  bnj600  32090  bnj908  32102
  Copyright terms: Public domain W3C validator