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

Theorem bnj96 35162
Description: Technical lemma for bnj150 35173. 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.) (Revised by Mario Carneiro, 6-May-2015.) (New usage is discouraged.)
Hypothesis
Ref Expression
bnj96.1 𝐹 = {⟨∅, pred(𝑥, 𝐴, 𝑅)⟩}
Assertion
Ref Expression
bnj96 ((𝑅 FrSe 𝐴𝑥𝐴) → dom 𝐹 = 1o)
Distinct variable groups:   𝑥,𝐴   𝑥,𝑅
Allowed substitution hint:   𝐹(𝑥)

Proof of Theorem bnj96
StepHypRef Expression
1 bnj93 35160 . . 3 ((𝑅 FrSe 𝐴𝑥𝐴) → pred(𝑥, 𝐴, 𝑅) ∈ V)
2 dmsnopg 6202 . . 3 ( pred(𝑥, 𝐴, 𝑅) ∈ V → dom {⟨∅, pred(𝑥, 𝐴, 𝑅)⟩} = {∅})
31, 2syl 17 . 2 ((𝑅 FrSe 𝐴𝑥𝐴) → dom {⟨∅, pred(𝑥, 𝐴, 𝑅)⟩} = {∅})
4 bnj96.1 . . 3 𝐹 = {⟨∅, pred(𝑥, 𝐴, 𝑅)⟩}
54dmeqi 5882 . 2 dom 𝐹 = dom {⟨∅, pred(𝑥, 𝐴, 𝑅)⟩}
6 df1o2 8446 . 2 1o = {∅}
73, 5, 63eqtr4g 2824 1 ((𝑅 FrSe 𝐴𝑥𝐴) → dom 𝐹 = 1o)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 399   = wceq 1562  wcel 2144  Vcvv 3456  c0 4287  {csn 4584  cop 4590  dom cdm 5649  1oc1o 8432   predc-bnj14 34986   FrSe w-bnj15 34990
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1817  ax-4 1831  ax-5 1932  ax-6 1989  ax-7 2030  ax-8 2146  ax-9 2154  ax-12 2214  ax-ext 2736  ax-sep 5248  ax-pr 5392
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1101  df-tru 1565  df-fal 1575  df-ex 1802  df-sb 2093  df-clab 2743  df-cleq 2756  df-clel 2839  df-ral 3079  df-rab 3417  df-v 3458  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4288  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-br 5103  df-dm 5659  df-suc 6354  df-1o 8439  df-bnj13 34989  df-bnj15 34991
This theorem is referenced by:  bnj150  35173
  Copyright terms: Public domain W3C validator