Theorem ontr2exmid 4536

Description: An ordinal transitivity law which implies excluded middle. (Contributed by Jim Kingdon, 17-Sep-2021.)

Hypothesis

Ref	Expression
ontr2exmid.1	⊢ ∀𝑥 ∈ On ∀𝑦∀𝑧 ∈ On ((𝑥 ⊆ 𝑦 ∧ 𝑦 ∈ 𝑧) → 𝑥 ∈ 𝑧)

Assertion

Ref	Expression
ontr2exmid	⊢ (𝜑 ∨ ¬ 𝜑)

Distinct variable group:   𝜑,𝑥,𝑦,𝑧

Proof of Theorem ontr2exmid

Dummy variable 𝑤 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		ssrab2 3252	. . . . 5 ⊢ {𝑤 ∈ {∅} ∣ 𝜑} ⊆ {∅}
2		p0ex 4200	. . . . . 6 ⊢ {∅} ∈ V
3	2	prid2 3711	. . . . 5 ⊢ {∅} ∈ {∅, {∅}}
4		2ordpr 4535	. . . . . . 7 ⊢ Ord {∅, {∅}}
5		pp0ex 4201	. . . . . . . 8 ⊢ {∅, {∅}} ∈ V
6	5	elon 4386	. . . . . . 7 ⊢ ({∅, {∅}} ∈ On ↔ Ord {∅, {∅}})
7	4, 6	mpbir 146	. . . . . 6 ⊢ {∅, {∅}} ∈ On
8		ordtriexmidlem 4530	. . . . . . . 8 ⊢ {𝑤 ∈ {∅} ∣ 𝜑} ∈ On
9		ontr2exmid.1	. . . . . . . 8 ⊢ ∀𝑥 ∈ On ∀𝑦∀𝑧 ∈ On ((𝑥 ⊆ 𝑦 ∧ 𝑦 ∈ 𝑧) → 𝑥 ∈ 𝑧)
10		sseq1 3190	. . . . . . . . . . . . 13 ⊢ (𝑥 = {𝑤 ∈ {∅} ∣ 𝜑} → (𝑥 ⊆ 𝑦 ↔ {𝑤 ∈ {∅} ∣ 𝜑} ⊆ 𝑦))
11	10	anbi1d 465	. . . . . . . . . . . 12 ⊢ (𝑥 = {𝑤 ∈ {∅} ∣ 𝜑} → ((𝑥 ⊆ 𝑦 ∧ 𝑦 ∈ 𝑧) ↔ ({𝑤 ∈ {∅} ∣ 𝜑} ⊆ 𝑦 ∧ 𝑦 ∈ 𝑧)))
12		eleq1 2250	. . . . . . . . . . . 12 ⊢ (𝑥 = {𝑤 ∈ {∅} ∣ 𝜑} → (𝑥 ∈ 𝑧 ↔ {𝑤 ∈ {∅} ∣ 𝜑} ∈ 𝑧))
13	11, 12	imbi12d 234	. . . . . . . . . . 11 ⊢ (𝑥 = {𝑤 ∈ {∅} ∣ 𝜑} → (((𝑥 ⊆ 𝑦 ∧ 𝑦 ∈ 𝑧) → 𝑥 ∈ 𝑧) ↔ (({𝑤 ∈ {∅} ∣ 𝜑} ⊆ 𝑦 ∧ 𝑦 ∈ 𝑧) → {𝑤 ∈ {∅} ∣ 𝜑} ∈ 𝑧)))
14	13	ralbidv 2487	. . . . . . . . . 10 ⊢ (𝑥 = {𝑤 ∈ {∅} ∣ 𝜑} → (∀𝑧 ∈ On ((𝑥 ⊆ 𝑦 ∧ 𝑦 ∈ 𝑧) → 𝑥 ∈ 𝑧) ↔ ∀𝑧 ∈ On (({𝑤 ∈ {∅} ∣ 𝜑} ⊆ 𝑦 ∧ 𝑦 ∈ 𝑧) → {𝑤 ∈ {∅} ∣ 𝜑} ∈ 𝑧)))
15	14	albidv 1834	. . . . . . . . 9 ⊢ (𝑥 = {𝑤 ∈ {∅} ∣ 𝜑} → (∀𝑦∀𝑧 ∈ On ((𝑥 ⊆ 𝑦 ∧ 𝑦 ∈ 𝑧) → 𝑥 ∈ 𝑧) ↔ ∀𝑦∀𝑧 ∈ On (({𝑤 ∈ {∅} ∣ 𝜑} ⊆ 𝑦 ∧ 𝑦 ∈ 𝑧) → {𝑤 ∈ {∅} ∣ 𝜑} ∈ 𝑧)))
16	15	rspcv 2849	. . . . . . . 8 ⊢ ({𝑤 ∈ {∅} ∣ 𝜑} ∈ On → (∀𝑥 ∈ On ∀𝑦∀𝑧 ∈ On ((𝑥 ⊆ 𝑦 ∧ 𝑦 ∈ 𝑧) → 𝑥 ∈ 𝑧) → ∀𝑦∀𝑧 ∈ On (({𝑤 ∈ {∅} ∣ 𝜑} ⊆ 𝑦 ∧ 𝑦 ∈ 𝑧) → {𝑤 ∈ {∅} ∣ 𝜑} ∈ 𝑧)))
17	8, 9, 16	mp2 16	. . . . . . 7 ⊢ ∀𝑦∀𝑧 ∈ On (({𝑤 ∈ {∅} ∣ 𝜑} ⊆ 𝑦 ∧ 𝑦 ∈ 𝑧) → {𝑤 ∈ {∅} ∣ 𝜑} ∈ 𝑧)
18		sseq2 3191	. . . . . . . . . . 11 ⊢ (𝑦 = {∅} → ({𝑤 ∈ {∅} ∣ 𝜑} ⊆ 𝑦 ↔ {𝑤 ∈ {∅} ∣ 𝜑} ⊆ {∅}))
19		eleq1 2250	. . . . . . . . . . 11 ⊢ (𝑦 = {∅} → (𝑦 ∈ 𝑧 ↔ {∅} ∈ 𝑧))
20	18, 19	anbi12d 473	. . . . . . . . . 10 ⊢ (𝑦 = {∅} → (({𝑤 ∈ {∅} ∣ 𝜑} ⊆ 𝑦 ∧ 𝑦 ∈ 𝑧) ↔ ({𝑤 ∈ {∅} ∣ 𝜑} ⊆ {∅} ∧ {∅} ∈ 𝑧)))
21	20	imbi1d 231	. . . . . . . . 9 ⊢ (𝑦 = {∅} → ((({𝑤 ∈ {∅} ∣ 𝜑} ⊆ 𝑦 ∧ 𝑦 ∈ 𝑧) → {𝑤 ∈ {∅} ∣ 𝜑} ∈ 𝑧) ↔ (({𝑤 ∈ {∅} ∣ 𝜑} ⊆ {∅} ∧ {∅} ∈ 𝑧) → {𝑤 ∈ {∅} ∣ 𝜑} ∈ 𝑧)))
22	21	ralbidv 2487	. . . . . . . 8 ⊢ (𝑦 = {∅} → (∀𝑧 ∈ On (({𝑤 ∈ {∅} ∣ 𝜑} ⊆ 𝑦 ∧ 𝑦 ∈ 𝑧) → {𝑤 ∈ {∅} ∣ 𝜑} ∈ 𝑧) ↔ ∀𝑧 ∈ On (({𝑤 ∈ {∅} ∣ 𝜑} ⊆ {∅} ∧ {∅} ∈ 𝑧) → {𝑤 ∈ {∅} ∣ 𝜑} ∈ 𝑧)))
23	2, 22	spcv 2843	. . . . . . 7 ⊢ (∀𝑦∀𝑧 ∈ On (({𝑤 ∈ {∅} ∣ 𝜑} ⊆ 𝑦 ∧ 𝑦 ∈ 𝑧) → {𝑤 ∈ {∅} ∣ 𝜑} ∈ 𝑧) → ∀𝑧 ∈ On (({𝑤 ∈ {∅} ∣ 𝜑} ⊆ {∅} ∧ {∅} ∈ 𝑧) → {𝑤 ∈ {∅} ∣ 𝜑} ∈ 𝑧))
24	17, 23	ax-mp 5	. . . . . 6 ⊢ ∀𝑧 ∈ On (({𝑤 ∈ {∅} ∣ 𝜑} ⊆ {∅} ∧ {∅} ∈ 𝑧) → {𝑤 ∈ {∅} ∣ 𝜑} ∈ 𝑧)
25		eleq2 2251	. . . . . . . . 9 ⊢ (𝑧 = {∅, {∅}} → ({∅} ∈ 𝑧 ↔ {∅} ∈ {∅, {∅}}))
26	25	anbi2d 464	. . . . . . . 8 ⊢ (𝑧 = {∅, {∅}} → (({𝑤 ∈ {∅} ∣ 𝜑} ⊆ {∅} ∧ {∅} ∈ 𝑧) ↔ ({𝑤 ∈ {∅} ∣ 𝜑} ⊆ {∅} ∧ {∅} ∈ {∅, {∅}})))
27		eleq2 2251	. . . . . . . 8 ⊢ (𝑧 = {∅, {∅}} → ({𝑤 ∈ {∅} ∣ 𝜑} ∈ 𝑧 ↔ {𝑤 ∈ {∅} ∣ 𝜑} ∈ {∅, {∅}}))
28	26, 27	imbi12d 234	. . . . . . 7 ⊢ (𝑧 = {∅, {∅}} → ((({𝑤 ∈ {∅} ∣ 𝜑} ⊆ {∅} ∧ {∅} ∈ 𝑧) → {𝑤 ∈ {∅} ∣ 𝜑} ∈ 𝑧) ↔ (({𝑤 ∈ {∅} ∣ 𝜑} ⊆ {∅} ∧ {∅} ∈ {∅, {∅}}) → {𝑤 ∈ {∅} ∣ 𝜑} ∈ {∅, {∅}})))
29	28	rspcv 2849	. . . . . 6 ⊢ ({∅, {∅}} ∈ On → (∀𝑧 ∈ On (({𝑤 ∈ {∅} ∣ 𝜑} ⊆ {∅} ∧ {∅} ∈ 𝑧) → {𝑤 ∈ {∅} ∣ 𝜑} ∈ 𝑧) → (({𝑤 ∈ {∅} ∣ 𝜑} ⊆ {∅} ∧ {∅} ∈ {∅, {∅}}) → {𝑤 ∈ {∅} ∣ 𝜑} ∈ {∅, {∅}})))
30	7, 24, 29	mp2 16	. . . . 5 ⊢ (({𝑤 ∈ {∅} ∣ 𝜑} ⊆ {∅} ∧ {∅} ∈ {∅, {∅}}) → {𝑤 ∈ {∅} ∣ 𝜑} ∈ {∅, {∅}})
31	1, 3, 30	mp2an 426	. . . 4 ⊢ {𝑤 ∈ {∅} ∣ 𝜑} ∈ {∅, {∅}}
32		elpri 3627	. . . 4 ⊢ ({𝑤 ∈ {∅} ∣ 𝜑} ∈ {∅, {∅}} → ({𝑤 ∈ {∅} ∣ 𝜑} = ∅ ∨ {𝑤 ∈ {∅} ∣ 𝜑} = {∅}))
33	31, 32	ax-mp 5	. . 3 ⊢ ({𝑤 ∈ {∅} ∣ 𝜑} = ∅ ∨ {𝑤 ∈ {∅} ∣ 𝜑} = {∅})
34		ordtriexmidlem2 4531	. . . 4 ⊢ ({𝑤 ∈ {∅} ∣ 𝜑} = ∅ → ¬ 𝜑)
35		0ex 4142	. . . . 5 ⊢ ∅ ∈ V
36		biidd 172	. . . . 5 ⊢ (𝑤 = ∅ → (𝜑 ↔ 𝜑))
37	35, 36	rabsnt 3679	. . . 4 ⊢ ({𝑤 ∈ {∅} ∣ 𝜑} = {∅} → 𝜑)
38	34, 37	orim12i 760	. . 3 ⊢ (({𝑤 ∈ {∅} ∣ 𝜑} = ∅ ∨ {𝑤 ∈ {∅} ∣ 𝜑} = {∅}) → (¬ 𝜑 ∨ 𝜑))
39	33, 38	ax-mp 5	. 2 ⊢ (¬ 𝜑 ∨ 𝜑)
40		orcom 729	. 2 ⊢ ((¬ 𝜑 ∨ 𝜑) ↔ (𝜑 ∨ ¬ 𝜑))
41	39, 40	mpbi 145	1 ⊢ (𝜑 ∨ ¬ 𝜑)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 104   ∨ wo 709  ∀wal 1361   = wceq 1363   ∈ wcel 2158  ∀wral 2465  {crab 2469   ⊆ wss 3141  ∅c0 3434  {csn 3604  {cpr 3605  Ord word 4374  Oncon0 4375

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 615  ax-in2 616  ax-io 710  ax-5 1457  ax-7 1458  ax-gen 1459  ax-ie1 1503  ax-ie2 1504  ax-8 1514  ax-10 1515  ax-11 1516  ax-i12 1517  ax-bndl 1519  ax-4 1520  ax-17 1536  ax-i9 1540  ax-ial 1544  ax-i5r 1545  ax-14 2161  ax-ext 2169  ax-sep 4133  ax-nul 4141  ax-pow 4186

This theorem depends on definitions:  df-bi 117  df-3an 981  df-tru 1366  df-nf 1471  df-sb 1773  df-clab 2174  df-cleq 2180  df-clel 2183  df-nfc 2318  df-ral 2470  df-rex 2471  df-rab 2474  df-v 2751  df-dif 3143  df-un 3145  df-in 3147  df-ss 3154  df-nul 3435  df-pw 3589  df-sn 3610  df-pr 3611  df-uni 3822  df-tr 4114  df-iord 4378  df-on 4380  df-suc 4383

This theorem is referenced by: (None)