Theorem onintexmid 4700

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 3857	. . . . . 6 |- ( ( u e. On /\ v e. On ) -> { u , v } C_ On )
2		prmg 3819	. . . . . . 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 4328	. . . . . . 7 |- { u , v } e. _V
5		sseq1 3265	. . . . . . . . 9 |- ( y = { u , v } -> ( y C_ On <-> { u , v } C_ On ) )
6		eleq2 2298	. . . . . . . . . 10 |- ( y = { u , v } -> ( x e. y <-> x e. { u , v } ) )
7	6	exbidv 1874	. . . . . . . . 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 3957	. . . . . . . . 9 |- ( y = { u , v } -> |^| y = |^| { u , v } )
10		id 19	. . . . . . . . 9 |- ( y = { u , v } -> y = { u , v } )
11	9, 10	eleq12d 2305	. . . . . . . 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 2871	. . . . . 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 3717	. . . . 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 3415	. . . . . . 7 |- ( v i^i u ) = ( u i^i v )
19	18	eqeq1i 2242	. . . . . 6 |- ( ( v i^i u ) = u <-> ( u i^i v ) = u )
20		dfss1 3429	. . . . . 6 |- ( u C_ v <-> ( v i^i u ) = u )
21		vex 2818	. . . . . . . 8 |- u e. _V
22		vex 2818	. . . . . . . 8 |- v e. _V
23	21, 22	intpr 3986	. . . . . . 7 |- |^| { u , v } = ( u i^i v )
24	23	eqeq1i 2242	. . . . . 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 2242	. . . . . 6 |- ( |^| { u , v } = v <-> ( u i^i v ) = v )
27		dfss1 3429	. . . . . 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 772	. . . 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 2598	. 2 |- A. u e. On A. v e. On ( u C_ v \/ v C_ u )
32	31	ordtri2or2exmid 4698	1 |- ( ph \/ -. ph )

Syntax hints:   -. wn 3   -> wi 4   /\ wa 104   \/ wo 716   = wceq 1398   E.wex 1541   e. wcel 2205   i^i cin 3213   C_ wss 3214   {cpr 3695   |^|cint 3954   Oncon0 4489

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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-sep 4233  ax-nul 4241  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-setind 4664

This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-ral 2527  df-rex 2528  df-rab 2531  df-v 2817  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-nul 3513  df-pw 3676  df-sn 3700  df-pr 3701  df-uni 3920  df-int 3955  df-tr 4214  df-iord 4492  df-on 4494  df-suc 4497

This theorem is referenced by: (None)