Theorem ordtriexmid 4668

Description: Ordinal trichotomy implies the law of the excluded middle (that is, decidability of an arbitrary proposition).

This theorem is stated in "Constructive ordinals", [Crosilla], p. "Set-theoretic principles incompatible with intuitionistic logic".

Also see exmidontri 7598 which is much the same theorem but biconditionalized and using the EXMID notation. (Contributed by Mario Carneiro and Jim Kingdon, 14-Nov-2018.)

Hypothesis

Ref	Expression
ordtriexmid.1	|- A. x e. On A. y e. On ( x e. y \/ x = y \/ y e. x )

Assertion

Ref	Expression
ordtriexmid	|- ( ph \/ -. ph )

Distinct variable groups:   x, y   ph, x

Allowed substitution hint:   ph( y)

Proof of Theorem ordtriexmid

Dummy variable z is distinct from all other variables.

Step	Hyp	Ref	Expression
1		noel 3525	. . . 4 |- -. { z e. { (/) } | ph } e. (/)
2		ordtriexmidlem 4666	. . . . . 6 |- { z e. { (/) } | ph } e. On
3		eleq1 2301	. . . . . . . 8 |- ( x = { z e. { (/) } | ph } -> ( x e. (/) <-> { z e. { (/) } | ph } e. (/) ) )
4		eqeq1 2245	. . . . . . . 8 |- ( x = { z e. { (/) } | ph } -> ( x = (/) <-> { z e. { (/) } | ph } = (/) ) )
5		eleq2 2302	. . . . . . . 8 |- ( x = { z e. { (/) } | ph } -> ( (/) e. x <-> (/) e. { z e. { (/) } | ph } ) )
6	3, 4, 5	3orbi123d 1352	. . . . . . 7 |- ( x = { z e. { (/) } | ph } -> ( ( x e. (/) \/ x = (/) \/ (/) e. x ) <-> ( { z e. { (/) } | ph } e. (/) \/ { z e. { (/) } | ph } = (/) \/ (/) e. { z e. { (/) } | ph } ) ) )
7		0elon 4537	. . . . . . . 8 |- (/) e. On
8		0ex 4260	. . . . . . . . 9 |- (/) e. _V
9		eleq1 2301	. . . . . . . . . . 11 |- ( y = (/) -> ( y e. On <-> (/) e. On ) )
10	9	anbi2d 468	. . . . . . . . . 10 |- ( y = (/) -> ( ( x e. On /\ y e. On ) <-> ( x e. On /\ (/) e. On ) ) )
11		eleq2 2302	. . . . . . . . . . 11 |- ( y = (/) -> ( x e. y <-> x e. (/) ) )
12		eqeq2 2248	. . . . . . . . . . 11 |- ( y = (/) -> ( x = y <-> x = (/) ) )
13		eleq1 2301	. . . . . . . . . . 11 |- ( y = (/) -> ( y e. x <-> (/) e. x ) )
14	11, 12, 13	3orbi123d 1352	. . . . . . . . . 10 |- ( y = (/) -> ( ( x e. y \/ x = y \/ y e. x ) <-> ( x e. (/) \/ x = (/) \/ (/) e. x ) ) )
15	10, 14	imbi12d 234	. . . . . . . . 9 |- ( y = (/) -> ( ( ( x e. On /\ y e. On ) -> ( x e. y \/ x = y \/ y e. x ) ) <-> ( ( x e. On /\ (/) e. On ) -> ( x e. (/) \/ x = (/) \/ (/) e. x ) ) ) )
16		ordtriexmid.1	. . . . . . . . . 10 |- A. x e. On A. y e. On ( x e. y \/ x = y \/ y e. x )
17	16	rspec2 2639	. . . . . . . . 9 |- ( ( x e. On /\ y e. On ) -> ( x e. y \/ x = y \/ y e. x ) )
18	8, 15, 17	vtocl 2877	. . . . . . . 8 |- ( ( x e. On /\ (/) e. On ) -> ( x e. (/) \/ x = (/) \/ (/) e. x ) )
19	7, 18	mpan2 429	. . . . . . 7 |- ( x e. On -> ( x e. (/) \/ x = (/) \/ (/) e. x ) )
20	6, 19	vtoclga 2889	. . . . . 6 |- ( { z e. { (/) } | ph } e. On -> ( { z e. { (/) } | ph } e. (/) \/ { z e. { (/) } | ph } = (/) \/ (/) e. { z e. { (/) } | ph } ) )
21	2, 20	ax-mp 5	. . . . 5 |- ( { z e. { (/) } | ph } e. (/) \/ { z e. { (/) } | ph } = (/) \/ (/) e. { z e. { (/) } | ph } )
22		3orass 1012	. . . . 5 |- ( ( { z e. { (/) } | ph } e. (/) \/ { z e. { (/) } | ph } = (/) \/ (/) e. { z e. { (/) } | ph } ) <-> ( { z e. { (/) } | ph } e. (/) \/ ( { z e. { (/) } | ph } = (/) \/ (/) e. { z e. { (/) } | ph } ) ) )
23	21, 22	mpbi 145	. . . 4 |- ( { z e. { (/) } | ph } e. (/) \/ ( { z e. { (/) } | ph } = (/) \/ (/) e. { z e. { (/) } | ph } ) )
24	1, 23	mtpor 1474	. . 3 |- ( { z e. { (/) } | ph } = (/) \/ (/) e. { z e. { (/) } | ph } )
25		ordtriexmidlem2 4667	. . . 4 |- ( { z e. { (/) } | ph } = (/) -> -. ph )
26	8	snid 3740	. . . . . 6 |- (/) e. { (/) }
27		biidd 172	. . . . . . 7 |- ( z = (/) -> ( ph <-> ph ) )
28	27	elrab3 2983	. . . . . 6 |- ( (/) e. { (/) } -> ( (/) e. { z e. { (/) } | ph } <-> ph ) )
29	26, 28	ax-mp 5	. . . . 5 |- ( (/) e. { z e. { (/) } | ph } <-> ph )
30	29	biimpi 120	. . . 4 |- ( (/) e. { z e. { (/) } | ph } -> ph )
31	25, 30	orim12i 771	. . 3 |- ( ( { z e. { (/) } | ph } = (/) \/ (/) e. { z e. { (/) } | ph } ) -> ( -. ph \/ ph ) )
32	24, 31	ax-mp 5	. 2 |- ( -. ph \/ ph )
33		orcom 740	. 2 |- ( ( ph \/ -. ph ) <-> ( -. ph \/ ph ) )
34	32, 33	mpbir 146	1 |- ( ph \/ -. ph )

This proof depends on syntax axioms:   -. wn 3   -> wi 4   /\ wa 104   <-> wb 105   \/ wo 720   \/ w3o 1008   = wceq 1402   e. wcel 2209   A.wral 2528   {crab 2532   (/)c0 3520   {csn 3709   Oncon0 4508

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-nul 4259  ax-pow 4311

This proof depends on definitions:  df-bi 117  df-3or 1010  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-uni 3936  df-tr 4230  df-iord 4511  df-on 4513  df-suc 4516

This theorem is used by: (None)