Metamath Proof Explorer


Theorem bnj96

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

Ref Expression
Hypothesis bnj96.1 ⊢ F = ∅ pred x A R
Assertion bnj96 ⊢ R FrSe A ∧ x ∈ A → dom ⁡ F = 1 𝑜

Proof

Step Hyp Ref Expression
1 bnj96.1 ⊢ F = ∅ pred x A R
2 bnj93 ⊢ R FrSe A ∧ x ∈ A → pred x A R ∈ V
3 dmsnopg ⊢ pred x A R ∈ V → dom ⁡ ∅ pred x A R = ∅
4 2 3 syl ⊢ R FrSe A ∧ x ∈ A → dom ⁡ ∅ pred x A R = ∅
5 1 dmeqi ⊢ dom ⁡ F = dom ⁡ ∅ pred x A R
6 df1o2 ⊢ 1 𝑜 = ∅
7 4 5 6 3eqtr4g ⊢ R FrSe A ∧ x ∈ A → dom ⁡ F = 1 𝑜