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 35262
Description: Technical lemma for bnj150 35273. 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 35260 . . 3 ((𝑅 FrSe 𝐴𝑥𝐴) → pred(𝑥, 𝐴, 𝑅) ∈ V)
2 dmsnopg 6213 . . 3 ( pred(𝑥, 𝐴, 𝑅) ∈ V → dom {⟨∅, pred(𝑥, 𝐴, 𝑅)⟩} = {∅})
31, 2syl 18 . 2 ((𝑅 FrSe 𝐴𝑥𝐴) → dom {⟨∅, pred(𝑥, 𝐴, 𝑅)⟩} = {∅})
4 bnj96.1 . . 3 𝐹 = {⟨∅, pred(𝑥, 𝐴, 𝑅)⟩}
54dmeqi 5893 . 2 dom 𝐹 = dom {⟨∅, pred(𝑥, 𝐴, 𝑅)⟩}
6 df1o2 8458 . 2 1o = {∅}
73, 5, 63eqtr4g 2822 1 ((𝑅 FrSe 𝐴𝑥𝐴) → dom 𝐹 = 1o)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 400   = wceq 1569  wcel 2142  Vcvv 3454  c0 4285  {csn 4588  cop 4594  dom cdm 5660  1oc1o 8444   predc-bnj14 35086   FrSe w-bnj15 35090
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-12 2212  ax-ext 2734  ax-sep 5256  ax-pr 5403
This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-sb 2096  df-clab 2741  df-cleq 2754  df-clel 2837  df-ral 3079  df-rab 3416  df-v 3456  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4487  df-sn 4589  df-pr 4591  df-op 4595  df-br 5109  df-dm 5670  df-suc 6366  df-1o 8451  df-bnj13 35089  df-bnj15 35091
This theorem is used by:  bnj150  35273
  Copyright terms: Public domain W3C validator