Theorem 0elsucexmid 4565

Description: If the successor of any ordinal class contains the empty set, excluded middle follows. (Contributed by Jim Kingdon, 3-Sep-2021.)

Hypothesis

Ref	Expression
0elsucexmid.1	⊢ ∀𝑥 ∈ On ∅ ∈ suc 𝑥

Assertion

Ref	Expression
0elsucexmid	⊢ (𝜑 ∨ ¬ 𝜑)

Distinct variable group:   𝜑,𝑥

Proof of Theorem 0elsucexmid

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		ordtriexmidlem 4519	. . . 4 ⊢ {𝑦 ∈ {∅} ∣ 𝜑} ∈ On
2		0elsucexmid.1	. . . 4 ⊢ ∀𝑥 ∈ On ∅ ∈ suc 𝑥
3		suceq 4403	. . . . . 6 ⊢ (𝑥 = {𝑦 ∈ {∅} ∣ 𝜑} → suc 𝑥 = suc {𝑦 ∈ {∅} ∣ 𝜑})
4	3	eleq2d 2247	. . . . 5 ⊢ (𝑥 = {𝑦 ∈ {∅} ∣ 𝜑} → (∅ ∈ suc 𝑥 ↔ ∅ ∈ suc {𝑦 ∈ {∅} ∣ 𝜑}))
5	4	rspcv 2838	. . . 4 ⊢ ({𝑦 ∈ {∅} ∣ 𝜑} ∈ On → (∀𝑥 ∈ On ∅ ∈ suc 𝑥 → ∅ ∈ suc {𝑦 ∈ {∅} ∣ 𝜑}))
6	1, 2, 5	mp2 16	. . 3 ⊢ ∅ ∈ suc {𝑦 ∈ {∅} ∣ 𝜑}
7		0ex 4131	. . . 4 ⊢ ∅ ∈ V
8	7	elsuc 4407	. . 3 ⊢ (∅ ∈ suc {𝑦 ∈ {∅} ∣ 𝜑} ↔ (∅ ∈ {𝑦 ∈ {∅} ∣ 𝜑} ∨ ∅ = {𝑦 ∈ {∅} ∣ 𝜑}))
9	6, 8	mpbi 145	. 2 ⊢ (∅ ∈ {𝑦 ∈ {∅} ∣ 𝜑} ∨ ∅ = {𝑦 ∈ {∅} ∣ 𝜑})
10	7	snid 3624	. . . . 5 ⊢ ∅ ∈ {∅}
11		biidd 172	. . . . . 6 ⊢ (𝑦 = ∅ → (𝜑 ↔ 𝜑))
12	11	elrab3 2895	. . . . 5 ⊢ (∅ ∈ {∅} → (∅ ∈ {𝑦 ∈ {∅} ∣ 𝜑} ↔ 𝜑))
13	10, 12	ax-mp 5	. . . 4 ⊢ (∅ ∈ {𝑦 ∈ {∅} ∣ 𝜑} ↔ 𝜑)
14	13	biimpi 120	. . 3 ⊢ (∅ ∈ {𝑦 ∈ {∅} ∣ 𝜑} → 𝜑)
15		ordtriexmidlem2 4520	. . . 4 ⊢ ({𝑦 ∈ {∅} ∣ 𝜑} = ∅ → ¬ 𝜑)
16	15	eqcoms 2180	. . 3 ⊢ (∅ = {𝑦 ∈ {∅} ∣ 𝜑} → ¬ 𝜑)
17	14, 16	orim12i 759	. 2 ⊢ ((∅ ∈ {𝑦 ∈ {∅} ∣ 𝜑} ∨ ∅ = {𝑦 ∈ {∅} ∣ 𝜑}) → (𝜑 ∨ ¬ 𝜑))
18	9, 17	ax-mp 5	1 ⊢ (𝜑 ∨ ¬ 𝜑)

Syntax hints:  ¬ wn 3   ↔ wb 105   ∨ wo 708   = wceq 1353   ∈ wcel 2148  ∀wral 2455  {crab 2459  ∅c0 3423  {csn 3593  Oncon0 4364  suc csuc 4366

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 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-14 2151  ax-ext 2159  ax-sep 4122  ax-nul 4130  ax-pow 4175

This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1461  df-sb 1763  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ral 2460  df-rex 2461  df-rab 2464  df-v 2740  df-dif 3132  df-un 3134  df-in 3136  df-ss 3143  df-nul 3424  df-pw 3578  df-sn 3599  df-uni 3811  df-tr 4103  df-iord 4367  df-on 4369  df-suc 4372

This theorem is referenced by: (None)