Theorem reg2exmidlema 4449

Description: Lemma for reg2exmid 4451. 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 519	. . . . . . 7 |- ( ( ( u e. A /\ A. v e. A u C_ v ) /\ u = { (/) } ) -> A. v e. A u C_ v )
2		sseq1 3120	. . . . . . . . 9 |- ( u = { (/) } -> ( u C_ v <-> { (/) } C_ v ) )
3	2	ralbidv 2437	. . . . . . . 8 |- ( u = { (/) } -> ( A. v e. A u C_ v <-> A. v e. A { (/) } C_ v ) )
4	3	adantl 275	. . . . . . 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 146	. . . . . 6 |- ( ( ( u e. A /\ A. v e. A u C_ v ) /\ u = { (/) } ) -> A. v e. A { (/) } C_ v )
6		0ex 4055	. . . . . . . 8 |- (/) e. _V
7	6	snss 3649	. . . . . . 7 |- ( (/) e. v <-> { (/) } C_ v )
8	7	ralbii 2441	. . . . . 6 |- ( A. v e. A (/) e. v <-> A. v e. A { (/) } C_ v )
9	5, 8	sylibr 133	. . . . 5 |- ( ( ( u e. A /\ A. v e. A u C_ v ) /\ u = { (/) } ) -> A. v e. A (/) e. v )
10		noel 3367	. . . . . 6 |- -. (/) e. (/)
11		eqid 2139	. . . . . . . . . . . 12 |- (/) = (/)
12	11	jctl 312	. . . . . . . . . . 11 |- ( ph -> ( (/) = (/) /\ ph ) )
13	12	olcd 723	. . . . . . . . . 10 |- ( ph -> ( (/) = { (/) } \/ ( (/) = (/) /\ ph ) ) )
14	6	prid1 3629	. . . . . . . . . 10 |- (/) e. { (/) , { (/) } }
15	13, 14	jctil 310	. . . . . . . . 9 |- ( ph -> ( (/) e. { (/) , { (/) } } /\ ( (/) = { (/) } \/ ( (/) = (/) /\ ph ) ) ) )
16		eqeq1 2146	. . . . . . . . . . 11 |- ( x = (/) -> ( x = { (/) } <-> (/) = { (/) } ) )
17		eqeq1 2146	. . . . . . . . . . . 12 |- ( x = (/) -> ( x = (/) <-> (/) = (/) ) )
18	17	anbi1d 460	. . . . . . . . . . 11 |- ( x = (/) -> ( ( x = (/) /\ ph ) <-> ( (/) = (/) /\ ph ) ) )
19	16, 18	orbi12d 782	. . . . . . . . . 10 |- ( x = (/) -> ( ( x = { (/) } \/ ( x = (/) /\ ph ) ) <-> ( (/) = { (/) } \/ ( (/) = (/) /\ ph ) ) ) )
20		regexmidlemm.a	. . . . . . . . . 10 |- A = { x e. { (/) , { (/) } } | ( x = { (/) } \/ ( x = (/) /\ ph ) ) }
21	19, 20	elrab2 2843	. . . . . . . . 9 |- ( (/) e. A <-> ( (/) e. { (/) , { (/) } } /\ ( (/) = { (/) } \/ ( (/) = (/) /\ ph ) ) ) )
22	15, 21	sylibr 133	. . . . . . . 8 |- ( ph -> (/) e. A )
23		eleq2 2203	. . . . . . . . 9 |- ( v = (/) -> ( (/) e. v <-> (/) e. (/) ) )
24	23	rspcv 2785	. . . . . . . 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 653	. . . . 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 723	. . 3 |- ( ( ( u e. A /\ A. v e. A u C_ v ) /\ u = { (/) } ) -> ( ph \/ -. ph ) )
30		simprr 521	. . . 4 |- ( ( ( u e. A /\ A. v e. A u C_ v ) /\ ( u = (/) /\ ph ) ) -> ph )
31	30	orcd 722	. . 3 |- ( ( ( u e. A /\ A. v e. A u C_ v ) /\ ( u = (/) /\ ph ) ) -> ( ph \/ -. ph ) )
32		eqeq1 2146	. . . . . . 7 |- ( x = u -> ( x = { (/) } <-> u = { (/) } ) )
33		eqeq1 2146	. . . . . . . 8 |- ( x = u -> ( x = (/) <-> u = (/) ) )
34	33	anbi1d 460	. . . . . . 7 |- ( x = u -> ( ( x = (/) /\ ph ) <-> ( u = (/) /\ ph ) ) )
35	32, 34	orbi12d 782	. . . . . 6 |- ( x = u -> ( ( x = { (/) } \/ ( x = (/) /\ ph ) ) <-> ( u = { (/) } \/ ( u = (/) /\ ph ) ) ) )
36	35, 20	elrab2 2843	. . . . 5 |- ( u e. A <-> ( u e. { (/) , { (/) } } /\ ( u = { (/) } \/ ( u = (/) /\ ph ) ) ) )
37	36	simprbi 273	. . . 4 |- ( u e. A -> ( u = { (/) } \/ ( u = (/) /\ ph ) ) )
38	37	adantr 274	. . 3 |- ( ( u e. A /\ A. v e. A u C_ v ) -> ( u = { (/) } \/ ( u = (/) /\ ph ) ) )
39	29, 31, 38	mpjaodan 787	. 2 |- ( ( u e. A /\ A. v e. A u C_ v ) -> ( ph \/ -. ph ) )
40	39	rexlimiva 2544	1 |- ( E. u e. A A. v e. A u C_ v -> ( ph \/ -. ph ) )

Syntax hints:   -. wn 3   -> wi 4   /\ wa 103   <-> wb 104   \/ wo 697   = wceq 1331   e. wcel 1480   A.wral 2416   E.wrex 2417   {crab 2420   C_ wss 3071   (/)c0 3363   {csn 3527   {cpr 3528

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 603  ax-in2 604  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2121  ax-nul 4054

This theorem depends on definitions:  df-bi 116  df-tru 1334  df-nf 1437  df-sb 1736  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-ral 2421  df-rex 2422  df-rab 2425  df-v 2688  df-dif 3073  df-un 3075  df-in 3077  df-ss 3084  df-nul 3364  df-sn 3533  df-pr 3534

This theorem is referenced by:  reg2exmid  4451  reg3exmid  4494