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 35361
Description: Technical lemma for bnj150 35372. 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 35359 . . 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 5892 . 2 dom 𝐹 = dom {⟨∅, pred(𝑥, 𝐴, 𝑅)⟩}
6 df1o2 8465 . 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 401   = wceq 1570  wcel 2145  Vcvv 3453  c0 4282  {csn 4587  cop 4593  dom cdm 5659  1oc1o 8451   predc-bnj14 35185   FrSe w-bnj15 35189
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-12 2215  ax-ext 2734  ax-sep 5255  ax-pr 5402
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2741  df-cleq 2754  df-clel 2837  df-ral 3079  df-rab 3415  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-sn 4588  df-pr 4590  df-op 4594  df-br 5108  df-dm 5669  df-suc 6367  df-1o 8458  df-bnj13 35188  df-bnj15 35190
This theorem is used by:  bnj150  35372
  Copyright terms: Public domain W3C validator