Theorem onintexmid 4587

Description: If the intersection (infimum) of an inhabited class of ordinal numbers belongs to the class, excluded middle follows. The hypothesis would be provable given excluded middle. (Contributed by Mario Carneiro and Jim Kingdon, 29-Aug-2021.)

Hypothesis

Ref	Expression
onintexmid.onint	|- ( ( y C_ On /\ E. x x e. y ) -> |^| y e. y )

Assertion

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

Distinct variable group:   x, y

Allowed substitution hints:   ph( x, y)

Proof of Theorem onintexmid

Dummy variables u v are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		prssi 3765	. . . . . 6 |- ( ( u e. On /\ v e. On ) -> { u , v } C_ On )
2		prmg 3728	. . . . . . 7 |- ( u e. On -> E. x x e. { u , v } )
3	2	adantr 276	. . . . . 6 |- ( ( u e. On /\ v e. On ) -> E. x x e. { u , v } )
4		zfpair2 4225	. . . . . . 7 |- { u , v } e. _V
5		sseq1 3193	. . . . . . . . 9 |- ( y = { u , v } -> ( y C_ On <-> { u , v } C_ On ) )
6		eleq2 2253	. . . . . . . . . 10 |- ( y = { u , v } -> ( x e. y <-> x e. { u , v } ) )
7	6	exbidv 1836	. . . . . . . . 9 |- ( y = { u , v } -> ( E. x x e. y <-> E. x x e. { u , v } ) )
8	5, 7	anbi12d 473	. . . . . . . 8 |- ( y = { u , v } -> ( ( y C_ On /\ E. x x e. y ) <-> ( { u , v } C_ On /\ E. x x e. { u , v } ) ) )
9		inteq 3862	. . . . . . . . 9 |- ( y = { u , v } -> |^| y = |^| { u , v } )
10		id 19	. . . . . . . . 9 |- ( y = { u , v } -> y = { u , v } )
11	9, 10	eleq12d 2260	. . . . . . . 8 |- ( y = { u , v } -> ( |^| y e. y <-> |^| { u , v } e. { u , v } ) )
12	8, 11	imbi12d 234	. . . . . . 7 |- ( y = { u , v } -> ( ( ( y C_ On /\ E. x x e. y ) -> |^| y e. y ) <-> ( ( { u , v } C_ On /\ E. x x e. { u , v } ) -> |^| { u , v } e. { u , v } ) ) )
13		onintexmid.onint	. . . . . . 7 |- ( ( y C_ On /\ E. x x e. y ) -> |^| y e. y )
14	4, 12, 13	vtocl 2806	. . . . . 6 |- ( ( { u , v } C_ On /\ E. x x e. { u , v } ) -> |^| { u , v } e. { u , v } )
15	1, 3, 14	syl2anc 411	. . . . 5 |- ( ( u e. On /\ v e. On ) -> |^| { u , v } e. { u , v } )
16		elpri 3630	. . . . 5 |- ( |^| { u , v } e. { u , v } -> ( |^| { u , v } = u \/ |^| { u , v } = v ) )
17	15, 16	syl 14	. . . 4 |- ( ( u e. On /\ v e. On ) -> ( |^| { u , v } = u \/ |^| { u , v } = v ) )
18		incom 3342	. . . . . . 7 |- ( v i^i u ) = ( u i^i v )
19	18	eqeq1i 2197	. . . . . 6 |- ( ( v i^i u ) = u <-> ( u i^i v ) = u )
20		dfss1 3354	. . . . . 6 |- ( u C_ v <-> ( v i^i u ) = u )
21		vex 2755	. . . . . . . 8 |- u e. _V
22		vex 2755	. . . . . . . 8 |- v e. _V
23	21, 22	intpr 3891	. . . . . . 7 |- |^| { u , v } = ( u i^i v )
24	23	eqeq1i 2197	. . . . . 6 |- ( |^| { u , v } = u <-> ( u i^i v ) = u )
25	19, 20, 24	3bitr4ri 213	. . . . 5 |- ( |^| { u , v } = u <-> u C_ v )
26	23	eqeq1i 2197	. . . . . 6 |- ( |^| { u , v } = v <-> ( u i^i v ) = v )
27		dfss1 3354	. . . . . 6 |- ( v C_ u <-> ( u i^i v ) = v )
28	26, 27	bitr4i 187	. . . . 5 |- ( |^| { u , v } = v <-> v C_ u )
29	25, 28	orbi12i 765	. . . 4 |- ( ( |^| { u , v } = u \/ |^| { u , v } = v ) <-> ( u C_ v \/ v C_ u ) )
30	17, 29	sylib 122	. . 3 |- ( ( u e. On /\ v e. On ) -> ( u C_ v \/ v C_ u ) )
31	30	rgen2a 2544	. 2 |- A. u e. On A. v e. On ( u C_ v \/ v C_ u )
32	31	ordtri2or2exmid 4585	1 |- ( ph \/ -. ph )

Syntax hints:   -. wn 3   -> wi 4   /\ wa 104   \/ wo 709   = wceq 1364   E.wex 1503   e. wcel 2160   i^i cin 3143   C_ wss 3144   {cpr 3608   |^|cint 3859   Oncon0 4378

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 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2162  ax-14 2163  ax-ext 2171  ax-sep 4136  ax-nul 4144  ax-pow 4189  ax-pr 4224  ax-un 4448  ax-setind 4551

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1472  df-sb 1774  df-clab 2176  df-cleq 2182  df-clel 2185  df-nfc 2321  df-ne 2361  df-ral 2473  df-rex 2474  df-rab 2477  df-v 2754  df-dif 3146  df-un 3148  df-in 3150  df-ss 3157  df-nul 3438  df-pw 3592  df-sn 3613  df-pr 3614  df-uni 3825  df-int 3860  df-tr 4117  df-iord 4381  df-on 4383  df-suc 4386

This theorem is referenced by: (None)