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

Theorem raltp 4604
Description: Convert a universal quantification over an unordered triple to a conjunction. (Contributed by NM, 13-Sep-2011.) (Revised by Mario Carneiro, 23-Apr-2015.)
Hypotheses
Ref Expression
raltp.1 𝐴 ∈ V
raltp.2 𝐵 ∈ V
raltp.3 𝐶 ∈ V
raltp.4 (𝑥 = 𝐴 → (𝜑𝜓))
raltp.5 (𝑥 = 𝐵 → (𝜑𝜒))
raltp.6 (𝑥 = 𝐶 → (𝜑𝜃))
Assertion
Ref Expression
raltp (∀𝑥 ∈ {𝐴, 𝐵, 𝐶}𝜑 ↔ (𝜓𝜒𝜃))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝑥,𝐶   𝜓,𝑥   𝜒,𝑥   𝜃,𝑥
Allowed substitution hint:   𝜑(𝑥)

Proof of Theorem raltp
StepHypRef Expression
1 raltp.1 . 2 𝐴 ∈ V
2 raltp.2 . 2 𝐵 ∈ V
3 raltp.3 . 2 𝐶 ∈ V
4 raltp.4 . . 3 (𝑥 = 𝐴 → (𝜑𝜓))
5 raltp.5 . . 3 (𝑥 = 𝐵 → (𝜑𝜒))
6 raltp.6 . . 3 (𝑥 = 𝐶 → (𝜑𝜃))
74, 5, 6raltpg 4597 . 2 ((𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝐶 ∈ V) → (∀𝑥 ∈ {𝐴, 𝐵, 𝐶}𝜑 ↔ (𝜓𝜒𝜃)))
81, 2, 3, 7mp3an 1458 1 (∀𝑥 ∈ {𝐴, 𝐵, 𝐶}𝜑 ↔ (𝜓𝜒𝜃))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  w3a 1084   = wceq 1538  wcel 2112  wral 3109  Vcvv 3444  {ctp 4532
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 2114  ax-9 2122  ax-10 2143  ax-12 2176  ax-ext 2773
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-ex 1782  df-nf 1786  df-sb 2070  df-clab 2780  df-cleq 2794  df-clel 2873  df-ral 3114  df-v 3446  df-sbc 3724  df-un 3889  df-sn 4529  df-pr 4531  df-tp 4533
This theorem is referenced by:  fztpval  12968  2wlkdlem4  27717  2pthdlem1  27719  3wlkdlem5  27951  3wlkdlem10  27957  upgr3v3e3cycl  27968  poimirlem9  35059
  Copyright terms: Public domain W3C validator