Theorem regexmidlemm 4564

Description: Lemma for regexmid 4567. A is inhabited. (Contributed by Jim Kingdon, 3-Sep-2019.)

Hypothesis

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

Assertion

Ref	Expression
regexmidlemm	|- E. y y e. A

Distinct variable groups:   y, A   ph, x, y

Allowed substitution hint:   A( x)

Proof of Theorem regexmidlemm

Step	Hyp	Ref	Expression
1		p0ex 4217	. . . 4 |- { (/) } e. _V
2	1	prid2 3725	. . 3 |- { (/) } e. { (/) , { (/) } }
3		eqid 2193	. . . 4 |- { (/) } = { (/) }
4	3	orci 732	. . 3 |- ( { (/) } = { (/) } \/ ( { (/) } = (/) /\ ph ) )
5		eqeq1 2200	. . . . 5 |- ( x = { (/) } -> ( x = { (/) } <-> { (/) } = { (/) } ) )
6		eqeq1 2200	. . . . . 6 |- ( x = { (/) } -> ( x = (/) <-> { (/) } = (/) ) )
7	6	anbi1d 465	. . . . 5 |- ( x = { (/) } -> ( ( x = (/) /\ ph ) <-> ( { (/) } = (/) /\ ph ) ) )
8	5, 7	orbi12d 794	. . . 4 |- ( x = { (/) } -> ( ( x = { (/) } \/ ( x = (/) /\ ph ) ) <-> ( { (/) } = { (/) } \/ ( { (/) } = (/) /\ ph ) ) ) )
9		regexmidlemm.a	. . . 4 |- A = { x e. { (/) , { (/) } } | ( x = { (/) } \/ ( x = (/) /\ ph ) ) }
10	8, 9	elrab2 2919	. . 3 |- ( { (/) } e. A <-> ( { (/) } e. { (/) , { (/) } } /\ ( { (/) } = { (/) } \/ ( { (/) } = (/) /\ ph ) ) ) )
11	2, 4, 10	mpbir2an 944	. 2 |- { (/) } e. A
12		elex2 2776	. 2 |- ( { (/) } e. A -> E. y y e. A )
13	11, 12	ax-mp 5	1 |- E. y y e. A

Syntax hints:   /\ wa 104   \/ wo 709   = wceq 1364   E.wex 1503   e. wcel 2164   {crab 2476   (/)c0 3446   {csn 3618   {cpr 3619

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-14 2167  ax-ext 2175  ax-sep 4147  ax-nul 4155  ax-pow 4203

This theorem depends on definitions:  df-bi 117  df-tru 1367  df-nf 1472  df-sb 1774  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-rab 2481  df-v 2762  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-nul 3447  df-pw 3603  df-sn 3624  df-pr 3625

This theorem is referenced by:  regexmid  4567  reg2exmid  4568  reg3exmid  4612  nnregexmid  4653