Theorem ordtriexmidlem2 4444

Description: Lemma for decidability and ordinals. The set {𝑥 ∈ {∅} ∣ 𝜑} is a way of connecting statements about ordinals (such as trichotomy in ordtriexmid 4445 or weak linearity in ordsoexmid 4485) 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 3372	. . 3 ⊢ ¬ ∅ ∈ ∅
2		eleq2 2204	. . 3 ⊢ ({𝑥 ∈ {∅} ∣ 𝜑} = ∅ → (∅ ∈ {𝑥 ∈ {∅} ∣ 𝜑} ↔ ∅ ∈ ∅))
3	1, 2	mtbiri 665	. 2 ⊢ ({𝑥 ∈ {∅} ∣ 𝜑} = ∅ → ¬ ∅ ∈ {𝑥 ∈ {∅} ∣ 𝜑})
4		0ex 4063	. . . 4 ⊢ ∅ ∈ V
5	4	snid 3563	. . 3 ⊢ ∅ ∈ {∅}
6		biidd 171	. . . 4 ⊢ (𝑥 = ∅ → (𝜑 ↔ 𝜑))
7	6	elrab3 2845	. . 3 ⊢ (∅ ∈ {∅} → (∅ ∈ {𝑥 ∈ {∅} ∣ 𝜑} ↔ 𝜑))
8	5, 7	ax-mp 5	. 2 ⊢ (∅ ∈ {𝑥 ∈ {∅} ∣ 𝜑} ↔ 𝜑)
9	3, 8	sylnib 666	1 ⊢ ({𝑥 ∈ {∅} ∣ 𝜑} = ∅ → ¬ 𝜑)

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 104   = wceq 1332   ∈ wcel 1481  {crab 2421  ∅c0 3368  {csn 3532

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-io 699  ax-5 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-10 1484  ax-11 1485  ax-i12 1486  ax-bndl 1487  ax-4 1488  ax-17 1507  ax-i9 1511  ax-ial 1515  ax-i5r 1516  ax-ext 2122  ax-nul 4062

This theorem depends on definitions:  df-bi 116  df-tru 1335  df-nf 1438  df-sb 1737  df-clab 2127  df-cleq 2133  df-clel 2136  df-nfc 2271  df-rab 2426  df-v 2691  df-dif 3078  df-nul 3369  df-sn 3538

This theorem is referenced by:  ordtriexmid  4445  ordtri2orexmid  4446  ontr2exmid  4448  onsucsssucexmid  4450  ordsoexmid  4485  0elsucexmid  4488  ordpwsucexmid  4493