Theorem bnj96 35496

Description: Technical lemma for bnj150 35507. 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

Step	Hyp	Ref	Expression
1		bnj93 35494	. . 3 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → pred(𝑥, 𝐴, 𝑅) ∈ V)
2		dmsnopg 6215	. . 3 ⊢ ( pred(𝑥, 𝐴, 𝑅) ∈ V → dom {⟨∅, pred(𝑥, 𝐴, 𝑅)⟩} = {∅})
3	1, 2	syl 18	. 2 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → dom {⟨∅, pred(𝑥, 𝐴, 𝑅)⟩} = {∅})
4		bnj96.1	. . 3 ⊢ 𝐹 = {⟨∅, pred(𝑥, 𝐴, 𝑅)⟩}
5	4	dmeqi 5886	. 2 ⊢ dom 𝐹 = dom {⟨∅, pred(𝑥, 𝐴, 𝑅)⟩}
6		df1o2 8484	. 2 ⊢ 1o = {∅}
7	3, 5, 6	3eqtr4g 2821	1 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → dom 𝐹 = 1o)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  Vcvv 3451  ∅c0 4279  {csn 4584  ⟨cop 4590  dom cdm 5651  1_oc1o 8470   predc-bnj14 35320   FrSe w-bnj15 35324

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 2213  ax-ext 2733  ax-sep 5249  ax-pr 5391

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 2740  df-cleq 2753  df-clel 2836  df-ral 3078  df-rab 3414  df-v 3453  df-dif 3900  df-un 3902  df-in 3904  df-ss 3915  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-br 5104  df-dm 5661  df-suc 6369  df-1o 8477  df-bnj13 35323  df-bnj15 35325

This theorem is used by:  bnj150  35507