Theorem ordtriexmidlem2 4611

Description: Lemma for decidability and ordinals. The set {𝑥 ∈ {∅} ∣ 𝜑} is a way of connecting statements about ordinals (such as trichotomy in ordtriexmid 4612 or weak linearity in ordsoexmid 4653) with a proposition 𝜑. Our lemma helps connect that set to excluded middle. (Contributed by Jim Kingdon, 28-Jan-2019.)

Assertion

Ref	Expression
ordtriexmidlem2	⊢ ({𝑥 ∈ {∅} ∣ 𝜑} = ∅ → ¬ 𝜑)

Distinct variable group:   𝜑,𝑥

Proof of Theorem ordtriexmidlem2

Step	Hyp	Ref	Expression
1		noel 3495	. . 3 ⊢ ¬ ∅ ∈ ∅
2		eleq2 2293	. . 3 ⊢ ({𝑥 ∈ {∅} ∣ 𝜑} = ∅ → (∅ ∈ {𝑥 ∈ {∅} ∣ 𝜑} ↔ ∅ ∈ ∅))
3	1, 2	mtbiri 679	. 2 ⊢ ({𝑥 ∈ {∅} ∣ 𝜑} = ∅ → ¬ ∅ ∈ {𝑥 ∈ {∅} ∣ 𝜑})
4		0ex 4210	. . . 4 ⊢ ∅ ∈ V
5	4	snid 3697	. . 3 ⊢ ∅ ∈ {∅}
6		biidd 172	. . . 4 ⊢ (𝑥 = ∅ → (𝜑 ↔ 𝜑))
7	6	elrab3 2960	. . 3 ⊢ (∅ ∈ {∅} → (∅ ∈ {𝑥 ∈ {∅} ∣ 𝜑} ↔ 𝜑))
8	5, 7	ax-mp 5	. 2 ⊢ (∅ ∈ {𝑥 ∈ {∅} ∣ 𝜑} ↔ 𝜑)
9	3, 8	sylnib 680	1 ⊢ ({𝑥 ∈ {∅} ∣ 𝜑} = ∅ → ¬ 𝜑)

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 105   = wceq 1395   ∈ wcel 2200  {crab 2512  ∅c0 3491  {csn 3666

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-ext 2211  ax-nul 4209

This theorem depends on definitions:  df-bi 117  df-tru 1398  df-nf 1507  df-sb 1809  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-rab 2517  df-v 2801  df-dif 3199  df-nul 3492  df-sn 3672

This theorem is referenced by:  ordtriexmid  4612  ontriexmidim  4613  ordtri2orexmid  4614  ontr2exmid  4616  onsucsssucexmid  4618  ordsoexmid  4653  0elsucexmid  4656  ordpwsucexmid  4661