ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  raltpg GIF version

Theorem raltpg 3451
Description: Convert a quantification over a triple to a conjunction. (Contributed by NM, 17-Sep-2011.) (Revised by Mario Carneiro, 23-Apr-2015.)
Hypotheses
Ref Expression
ralprg.1 (𝑥 = 𝐴 → (𝜑𝜓))
ralprg.2 (𝑥 = 𝐵 → (𝜑𝜒))
raltpg.3 (𝑥 = 𝐶 → (𝜑𝜃))
Assertion
Ref Expression
raltpg ((𝐴𝑉𝐵𝑊𝐶𝑋) → (∀𝑥 ∈ {𝐴, 𝐵, 𝐶}𝜑 ↔ (𝜓𝜒𝜃)))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝑥,𝐶   𝜓,𝑥   𝜒,𝑥   𝜃,𝑥
Allowed substitution hints:   𝜑(𝑥)   𝑉(𝑥)   𝑊(𝑥)   𝑋(𝑥)

Proof of Theorem raltpg
StepHypRef Expression
1 ralprg.1 . . . . 5 (𝑥 = 𝐴 → (𝜑𝜓))
2 ralprg.2 . . . . 5 (𝑥 = 𝐵 → (𝜑𝜒))
31, 2ralprg 3449 . . . 4 ((𝐴𝑉𝐵𝑊) → (∀𝑥 ∈ {𝐴, 𝐵}𝜑 ↔ (𝜓𝜒)))
4 raltpg.3 . . . . 5 (𝑥 = 𝐶 → (𝜑𝜃))
54ralsng 3439 . . . 4 (𝐶𝑋 → (∀𝑥 ∈ {𝐶}𝜑𝜃))
63, 5bi2anan9 548 . . 3 (((𝐴𝑉𝐵𝑊) ∧ 𝐶𝑋) → ((∀𝑥 ∈ {𝐴, 𝐵}𝜑 ∧ ∀𝑥 ∈ {𝐶}𝜑) ↔ ((𝜓𝜒) ∧ 𝜃)))
763impa 1110 . 2 ((𝐴𝑉𝐵𝑊𝐶𝑋) → ((∀𝑥 ∈ {𝐴, 𝐵}𝜑 ∧ ∀𝑥 ∈ {𝐶}𝜑) ↔ ((𝜓𝜒) ∧ 𝜃)))
8 df-tp 3411 . . . 4 {𝐴, 𝐵, 𝐶} = ({𝐴, 𝐵} ∪ {𝐶})
98raleqi 2526 . . 3 (∀𝑥 ∈ {𝐴, 𝐵, 𝐶}𝜑 ↔ ∀𝑥 ∈ ({𝐴, 𝐵} ∪ {𝐶})𝜑)
10 ralunb 3152 . . 3 (∀𝑥 ∈ ({𝐴, 𝐵} ∪ {𝐶})𝜑 ↔ (∀𝑥 ∈ {𝐴, 𝐵}𝜑 ∧ ∀𝑥 ∈ {𝐶}𝜑))
119, 10bitri 177 . 2 (∀𝑥 ∈ {𝐴, 𝐵, 𝐶}𝜑 ↔ (∀𝑥 ∈ {𝐴, 𝐵}𝜑 ∧ ∀𝑥 ∈ {𝐶}𝜑))
12 df-3an 898 . 2 ((𝜓𝜒𝜃) ↔ ((𝜓𝜒) ∧ 𝜃))
137, 11, 123bitr4g 216 1 ((𝐴𝑉𝐵𝑊𝐶𝑋) → (∀𝑥 ∈ {𝐴, 𝐵, 𝐶}𝜑 ↔ (𝜓𝜒𝜃)))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 101  wb 102  w3a 896   = wceq 1259  wcel 1409  wral 2323  cun 2943  {csn 3403  {cpr 3404  {ctp 3405
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 103  ax-ia2 104  ax-ia3 105  ax-io 640  ax-5 1352  ax-7 1353  ax-gen 1354  ax-ie1 1398  ax-ie2 1399  ax-8 1411  ax-10 1412  ax-11 1413  ax-i12 1414  ax-bndl 1415  ax-4 1416  ax-17 1435  ax-i9 1439  ax-ial 1443  ax-i5r 1444  ax-ext 2038
This theorem depends on definitions:  df-bi 114  df-3an 898  df-tru 1262  df-nf 1366  df-sb 1662  df-clab 2043  df-cleq 2049  df-clel 2052  df-nfc 2183  df-ral 2328  df-v 2576  df-sbc 2788  df-un 2950  df-sn 3409  df-pr 3410  df-tp 3411
This theorem is referenced by:  raltp  3455
  Copyright terms: Public domain W3C validator