Theorem regexmidlemm 4565

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

Hypothesis

Ref	Expression
regexmidlemm.a	⊢ 𝐴 = {𝑥 ∈ {∅, {∅}} ∣ (𝑥 = {∅} ∨ (𝑥 = ∅ ∧ 𝜑))}

Assertion

Ref	Expression
regexmidlemm	⊢ ∃𝑦 𝑦 ∈ 𝐴

Distinct variable groups:   𝑦,𝐴   𝜑,𝑥,𝑦

Allowed substitution hint:   𝐴(𝑥)

Proof of Theorem regexmidlemm

Step	Hyp	Ref	Expression
1		p0ex 4218	. . . 4 ⊢ {∅} ∈ V
2	1	prid2 3726	. . 3 ⊢ {∅} ∈ {∅, {∅}}
3		eqid 2193	. . . 4 ⊢ {∅} = {∅}
4	3	orci 732	. . 3 ⊢ ({∅} = {∅} ∨ ({∅} = ∅ ∧ 𝜑))
5		eqeq1 2200	. . . . 5 ⊢ (𝑥 = {∅} → (𝑥 = {∅} ↔ {∅} = {∅}))
6		eqeq1 2200	. . . . . 6 ⊢ (𝑥 = {∅} → (𝑥 = ∅ ↔ {∅} = ∅))
7	6	anbi1d 465	. . . . 5 ⊢ (𝑥 = {∅} → ((𝑥 = ∅ ∧ 𝜑) ↔ ({∅} = ∅ ∧ 𝜑)))
8	5, 7	orbi12d 794	. . . 4 ⊢ (𝑥 = {∅} → ((𝑥 = {∅} ∨ (𝑥 = ∅ ∧ 𝜑)) ↔ ({∅} = {∅} ∨ ({∅} = ∅ ∧ 𝜑))))
9		regexmidlemm.a	. . . 4 ⊢ 𝐴 = {𝑥 ∈ {∅, {∅}} ∣ (𝑥 = {∅} ∨ (𝑥 = ∅ ∧ 𝜑))}
10	8, 9	elrab2 2920	. . 3 ⊢ ({∅} ∈ 𝐴 ↔ ({∅} ∈ {∅, {∅}} ∧ ({∅} = {∅} ∨ ({∅} = ∅ ∧ 𝜑))))
11	2, 4, 10	mpbir2an 944	. 2 ⊢ {∅} ∈ 𝐴
12		elex2 2776	. 2 ⊢ ({∅} ∈ 𝐴 → ∃𝑦 𝑦 ∈ 𝐴)
13	11, 12	ax-mp 5	1 ⊢ ∃𝑦 𝑦 ∈ 𝐴

Syntax hints:   ∧ wa 104   ∨ wo 709   = wceq 1364  ∃wex 1503   ∈ wcel 2164  {crab 2476  ∅c0 3447  {csn 3619  {cpr 3620

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 4148  ax-nul 4156  ax-pow 4204

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 3156  df-un 3158  df-in 3160  df-ss 3167  df-nul 3448  df-pw 3604  df-sn 3625  df-pr 3626

This theorem is referenced by:  regexmid  4568  reg2exmid  4569  reg3exmid  4613  nnregexmid  4654