Theorem grothprimlem 10244

Description: Lemma for grothprim 10245. Expand the membership of an unordered pair into primitives. (Contributed by NM, 29-Mar-2007.)

Assertion

Ref	Expression
grothprimlem	⊢ ({𝑢, 𝑣} ∈ 𝑤 ↔ ∃𝑔(𝑔 ∈ 𝑤 ∧ ∀ℎ(ℎ ∈ 𝑔 ↔ (ℎ = 𝑢 ∨ ℎ = 𝑣))))

Distinct variable group:   𝑤,𝑣,𝑢,ℎ,𝑔

Proof of Theorem grothprimlem

Step	Hyp	Ref	Expression
1		dfpr2 4544	. . 3 ⊢ {𝑢, 𝑣} = {ℎ ∣ (ℎ = 𝑢 ∨ ℎ = 𝑣)}
2	1	eleq1i 2880	. 2 ⊢ ({𝑢, 𝑣} ∈ 𝑤 ↔ {ℎ ∣ (ℎ = 𝑢 ∨ ℎ = 𝑣)} ∈ 𝑤)
3		clabel 2934	. 2 ⊢ ({ℎ ∣ (ℎ = 𝑢 ∨ ℎ = 𝑣)} ∈ 𝑤 ↔ ∃𝑔(𝑔 ∈ 𝑤 ∧ ∀ℎ(ℎ ∈ 𝑔 ↔ (ℎ = 𝑢 ∨ ℎ = 𝑣))))
4	2, 3	bitri 278	1 ⊢ ({𝑢, 𝑣} ∈ 𝑤 ↔ ∃𝑔(𝑔 ∈ 𝑤 ∧ ∀ℎ(ℎ ∈ 𝑔 ↔ (ℎ = 𝑢 ∨ ℎ = 𝑣))))

Syntax hints:   ↔ wb 209   ∧ wa 399   ∨ wo 844  ∀wal 1536  ∃wex 1781   ∈ wcel 2111  {cab 2776  {cpr 4527

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-clab 2777  df-cleq 2791  df-clel 2870  df-v 3443  df-un 3886  df-sn 4526  df-pr 4528

This theorem is referenced by:  grothprim  10245