MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  el7g Structured version   Visualization version   GIF version

Theorem el7g 4651
Description: Members of a set with seven elements. Lemma for usgrexmpl2nb0 48947 etc. (Contributed by AV, 9-Aug-2025.)
Assertion
Ref Expression
el7g (𝑋𝑉 → (𝑋 ∈ ({𝐴} ∪ ({𝐵, 𝐶, 𝐷} ∪ {𝐸, 𝐹, 𝐺})) ↔ (𝑋 = 𝐴 ∨ ((𝑋 = 𝐵𝑋 = 𝐶𝑋 = 𝐷) ∨ (𝑋 = 𝐸𝑋 = 𝐹𝑋 = 𝐺)))))

Proof of Theorem el7g
StepHypRef Expression
1 elun 4100 . 2 (𝑋 ∈ ({𝐴} ∪ ({𝐵, 𝐶, 𝐷} ∪ {𝐸, 𝐹, 𝐺})) ↔ (𝑋 ∈ {𝐴} ∨ 𝑋 ∈ ({𝐵, 𝐶, 𝐷} ∪ {𝐸, 𝐹, 𝐺})))
2 elsng 4598 . . 3 (𝑋𝑉 → (𝑋 ∈ {𝐴} ↔ 𝑋 = 𝐴))
3 elun 4100 . . . 4 (𝑋 ∈ ({𝐵, 𝐶, 𝐷} ∪ {𝐸, 𝐹, 𝐺}) ↔ (𝑋 ∈ {𝐵, 𝐶, 𝐷} ∨ 𝑋 ∈ {𝐸, 𝐹, 𝐺}))
4 eltpg 4647 . . . . 5 (𝑋𝑉 → (𝑋 ∈ {𝐵, 𝐶, 𝐷} ↔ (𝑋 = 𝐵𝑋 = 𝐶𝑋 = 𝐷)))
5 eltpg 4647 . . . . 5 (𝑋𝑉 → (𝑋 ∈ {𝐸, 𝐹, 𝐺} ↔ (𝑋 = 𝐸𝑋 = 𝐹𝑋 = 𝐺)))
64, 5orbi12d 932 . . . 4 (𝑋𝑉 → ((𝑋 ∈ {𝐵, 𝐶, 𝐷} ∨ 𝑋 ∈ {𝐸, 𝐹, 𝐺}) ↔ ((𝑋 = 𝐵𝑋 = 𝐶𝑋 = 𝐷) ∨ (𝑋 = 𝐸𝑋 = 𝐹𝑋 = 𝐺))))
73, 6bitrid 286 . . 3 (𝑋𝑉 → (𝑋 ∈ ({𝐵, 𝐶, 𝐷} ∪ {𝐸, 𝐹, 𝐺}) ↔ ((𝑋 = 𝐵𝑋 = 𝐶𝑋 = 𝐷) ∨ (𝑋 = 𝐸𝑋 = 𝐹𝑋 = 𝐺))))
82, 7orbi12d 932 . 2 (𝑋𝑉 → ((𝑋 ∈ {𝐴} ∨ 𝑋 ∈ ({𝐵, 𝐶, 𝐷} ∪ {𝐸, 𝐹, 𝐺})) ↔ (𝑋 = 𝐴 ∨ ((𝑋 = 𝐵𝑋 = 𝐶𝑋 = 𝐷) ∨ (𝑋 = 𝐸𝑋 = 𝐹𝑋 = 𝐺)))))
91, 8bitrid 286 1 (𝑋𝑉 → (𝑋 ∈ ({𝐴} ∪ ({𝐵, 𝐶, 𝐷} ∪ {𝐸, 𝐹, 𝐺})) ↔ (𝑋 = 𝐴 ∨ ((𝑋 = 𝐵𝑋 = 𝐶𝑋 = 𝐷) ∨ (𝑋 = 𝐸𝑋 = 𝐹𝑋 = 𝐺)))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wb 209  wo 861  w3o 1102   = wceq 1570  wcel 2145  cun 3897  {csn 4584  {ctp 4588
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2732
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-v 3452  df-un 3904  df-sn 4585  df-pr 4587  df-tp 4589
This theorem is used by:  usgrexmpl2nb0  48947  usgrexmpl2nb1  48948  usgrexmpl2nb2  48949  usgrexmpl2nb3  48950  usgrexmpl2nb4  48951  usgrexmpl2nb5  48952
  Copyright terms: Public domain W3C validator