Theorem bnj1071 32359

Description: Technical lemma for bnj69 32392. 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.) (New usage is discouraged.)

Hypothesis

Ref	Expression
bnj1071.7	⊢ 𝐷 = (ω ∖ {∅})

Assertion

Ref	Expression
bnj1071	⊢ (𝑛 ∈ 𝐷 → E Fr 𝑛)

Proof of Theorem bnj1071

Step	Hyp	Ref	Expression
1		bnj1071.7	. . 3 ⊢ 𝐷 = (ω ∖ {∅})
2	1	bnj923 32149	. 2 ⊢ (𝑛 ∈ 𝐷 → 𝑛 ∈ ω)
3		nnord 7568	. 2 ⊢ (𝑛 ∈ ω → Ord 𝑛)
4		ordfr 6174	. 2 ⊢ (Ord 𝑛 → E Fr 𝑛)
5	2, 3, 4	3syl 18	1 ⊢ (𝑛 ∈ 𝐷 → E Fr 𝑛)

Syntax hints:   → wi 4   = wceq 1538   ∈ wcel 2111   ∖ cdif 3878  ∅c0 4243  {csn 4525   E cep 5429   Fr wfr 5475  Ord word 6158  ωcom 7560

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-sep 5167  ax-nul 5174  ax-pr 5295  ax-un 7441

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3or 1085  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-ral 3111  df-rex 3112  df-rab 3115  df-v 3443  df-sbc 3721  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-pss 3900  df-nul 4244  df-if 4426  df-sn 4526  df-pr 4528  df-tp 4530  df-op 4532  df-uni 4801  df-br 5031  df-opab 5093  df-tr 5137  df-eprel 5430  df-po 5438  df-so 5439  df-fr 5478  df-we 5480  df-ord 6162  df-on 6163  df-lim 6164  df-suc 6165  df-om 7561

This theorem is referenced by:  bnj1030  32369  bnj1133  32371