Theorem reg2exmidlema 4277

Description: Lemma for reg2exmid 4279. If A has a minimal element (expressed by C_), excluded middle follows. (Contributed by Jim Kingdon, 2-Oct-2021.)

Hypothesis

Ref	Expression
regexmidlemm.a	|- A = { x e. { (/) , { (/) } } | ( x = { (/) } \/ ( x = (/) /\ ph ) ) }

Assertion

Ref	Expression
reg2exmidlema	|- ( E. u e. A A. v e. A u C_ v -> ( ph \/ -. ph ) )

Distinct variable groups:   ph, x   v, A   ph, u, x   v, u

Allowed substitution hints:   ph( v)   A( x, u)

Proof of Theorem reg2exmidlema

Step	Hyp	Ref	Expression
1		simplr 496	. . . . . . 7 |- ( ( ( u e. A /\ A. v e. A u C_ v ) /\ u = { (/) } ) -> A. v e. A u C_ v )
2		sseq1 3020	. . . . . . . . 9 |- ( u = { (/) } -> ( u C_ v <-> { (/) } C_ v ) )
3	2	ralbidv 2368	. . . . . . . 8 |- ( u = { (/) } -> ( A. v e. A u C_ v <-> A. v e. A { (/) } C_ v ) )
4	3	adantl 271	. . . . . . 7 |- ( ( ( u e. A /\ A. v e. A u C_ v ) /\ u = { (/) } ) -> ( A. v e. A u C_ v <-> A. v e. A { (/) } C_ v ) )
5	1, 4	mpbid 145	. . . . . 6 |- ( ( ( u e. A /\ A. v e. A u C_ v ) /\ u = { (/) } ) -> A. v e. A { (/) } C_ v )
6		0ex 3905	. . . . . . . 8 |- (/) e. _V
7	6	snss 3516	. . . . . . 7 |- ( (/) e. v <-> { (/) } C_ v )
8	7	ralbii 2372	. . . . . 6 |- ( A. v e. A (/) e. v <-> A. v e. A { (/) } C_ v )
9	5, 8	sylibr 132	. . . . 5 |- ( ( ( u e. A /\ A. v e. A u C_ v ) /\ u = { (/) } ) -> A. v e. A (/) e. v )
10		noel 3255	. . . . . 6 |- -. (/) e. (/)
11		eqid 2081	. . . . . . . . . . . 12 |- (/) = (/)
12	11	jctl 307	. . . . . . . . . . 11 |- ( ph -> ( (/) = (/) /\ ph ) )
13	12	olcd 685	. . . . . . . . . 10 |- ( ph -> ( (/) = { (/) } \/ ( (/) = (/) /\ ph ) ) )
14	6	prid1 3498	. . . . . . . . . 10 |- (/) e. { (/) , { (/) } }
15	13, 14	jctil 305	. . . . . . . . 9 |- ( ph -> ( (/) e. { (/) , { (/) } } /\ ( (/) = { (/) } \/ ( (/) = (/) /\ ph ) ) ) )
16		eqeq1 2087	. . . . . . . . . . 11 |- ( x = (/) -> ( x = { (/) } <-> (/) = { (/) } ) )
17		eqeq1 2087	. . . . . . . . . . . 12 |- ( x = (/) -> ( x = (/) <-> (/) = (/) ) )
18	17	anbi1d 452	. . . . . . . . . . 11 |- ( x = (/) -> ( ( x = (/) /\ ph ) <-> ( (/) = (/) /\ ph ) ) )
19	16, 18	orbi12d 739	. . . . . . . . . 10 |- ( x = (/) -> ( ( x = { (/) } \/ ( x = (/) /\ ph ) ) <-> ( (/) = { (/) } \/ ( (/) = (/) /\ ph ) ) ) )
20		regexmidlemm.a	. . . . . . . . . 10 |- A = { x e. { (/) , { (/) } } | ( x = { (/) } \/ ( x = (/) /\ ph ) ) }
21	19, 20	elrab2 2751	. . . . . . . . 9 |- ( (/) e. A <-> ( (/) e. { (/) , { (/) } } /\ ( (/) = { (/) } \/ ( (/) = (/) /\ ph ) ) ) )
22	15, 21	sylibr 132	. . . . . . . 8 |- ( ph -> (/) e. A )
23		eleq2 2142	. . . . . . . . 9 |- ( v = (/) -> ( (/) e. v <-> (/) e. (/) ) )
24	23	rspcv 2697	. . . . . . . 8 |- ( (/) e. A -> ( A. v e. A (/) e. v -> (/) e. (/) ) )
25	22, 24	syl 14	. . . . . . 7 |- ( ph -> ( A. v e. A (/) e. v -> (/) e. (/) ) )
26	25	com12 30	. . . . . 6 |- ( A. v e. A (/) e. v -> ( ph -> (/) e. (/) ) )
27	10, 26	mtoi 622	. . . . 5 |- ( A. v e. A (/) e. v -> -. ph )
28	9, 27	syl 14	. . . 4 |- ( ( ( u e. A /\ A. v e. A u C_ v ) /\ u = { (/) } ) -> -. ph )
29	28	olcd 685	. . 3 |- ( ( ( u e. A /\ A. v e. A u C_ v ) /\ u = { (/) } ) -> ( ph \/ -. ph ) )
30		simprr 498	. . . 4 |- ( ( ( u e. A /\ A. v e. A u C_ v ) /\ ( u = (/) /\ ph ) ) -> ph )
31	30	orcd 684	. . 3 |- ( ( ( u e. A /\ A. v e. A u C_ v ) /\ ( u = (/) /\ ph ) ) -> ( ph \/ -. ph ) )
32		eqeq1 2087	. . . . . . 7 |- ( x = u -> ( x = { (/) } <-> u = { (/) } ) )
33		eqeq1 2087	. . . . . . . 8 |- ( x = u -> ( x = (/) <-> u = (/) ) )
34	33	anbi1d 452	. . . . . . 7 |- ( x = u -> ( ( x = (/) /\ ph ) <-> ( u = (/) /\ ph ) ) )
35	32, 34	orbi12d 739	. . . . . 6 |- ( x = u -> ( ( x = { (/) } \/ ( x = (/) /\ ph ) ) <-> ( u = { (/) } \/ ( u = (/) /\ ph ) ) ) )
36	35, 20	elrab2 2751	. . . . 5 |- ( u e. A <-> ( u e. { (/) , { (/) } } /\ ( u = { (/) } \/ ( u = (/) /\ ph ) ) ) )
37	36	simprbi 269	. . . 4 |- ( u e. A -> ( u = { (/) } \/ ( u = (/) /\ ph ) ) )
38	37	adantr 270	. . 3 |- ( ( u e. A /\ A. v e. A u C_ v ) -> ( u = { (/) } \/ ( u = (/) /\ ph ) ) )
39	29, 31, 38	mpjaodan 744	. 2 |- ( ( u e. A /\ A. v e. A u C_ v ) -> ( ph \/ -. ph ) )
40	39	rexlimiva 2472	1 |- ( E. u e. A A. v e. A u C_ v -> ( ph \/ -. ph ) )

Syntax hints:   -. wn 3   -> wi 4   /\ wa 102   <-> wb 103   \/ wo 661   = wceq 1284   e. wcel 1433   A.wral 2348   E.wrex 2349   {crab 2352   C_ wss 2973   (/)c0 3251   {csn 3398   {cpr 3399

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-in1 576  ax-in2 577  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063  ax-nul 3904

This theorem depends on definitions:  df-bi 115  df-tru 1287  df-nf 1390  df-sb 1686  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-ral 2353  df-rex 2354  df-rab 2357  df-v 2603  df-dif 2975  df-un 2977  df-in 2979  df-ss 2986  df-nul 3252  df-sn 3404  df-pr 3405

This theorem is referenced by:  reg2exmid  4279  reg3exmid  4322