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

Theorem spc3gv 2645
 Description: Specialization with 3 quantifiers, using implicit substitution. (Contributed by NM, 12-May-2008.)
Hypothesis
Ref Expression
spc3egv.1 ((𝑥 = 𝐴𝑦 = 𝐵𝑧 = 𝐶) → (𝜑𝜓))
Assertion
Ref Expression
spc3gv ((𝐴𝑉𝐵𝑊𝐶𝑋) → (∀𝑥𝑦𝑧𝜑𝜓))
Distinct variable groups:   𝑥,𝑦,𝑧,𝐴   𝑥,𝐵,𝑦,𝑧   𝑥,𝐶,𝑦,𝑧   𝜓,𝑥,𝑦,𝑧
Allowed substitution hints:   𝜑(𝑥,𝑦,𝑧)   𝑉(𝑥,𝑦,𝑧)   𝑊(𝑥,𝑦,𝑧)   𝑋(𝑥,𝑦,𝑧)

Proof of Theorem spc3gv
StepHypRef Expression
1 elisset 2568 . . . 4 (𝐴𝑉 → ∃𝑥 𝑥 = 𝐴)
2 elisset 2568 . . . 4 (𝐵𝑊 → ∃𝑦 𝑦 = 𝐵)
3 elisset 2568 . . . 4 (𝐶𝑋 → ∃𝑧 𝑧 = 𝐶)
41, 2, 33anim123i 1089 . . 3 ((𝐴𝑉𝐵𝑊𝐶𝑋) → (∃𝑥 𝑥 = 𝐴 ∧ ∃𝑦 𝑦 = 𝐵 ∧ ∃𝑧 𝑧 = 𝐶))
5 eeeanv 1808 . . 3 (∃𝑥𝑦𝑧(𝑥 = 𝐴𝑦 = 𝐵𝑧 = 𝐶) ↔ (∃𝑥 𝑥 = 𝐴 ∧ ∃𝑦 𝑦 = 𝐵 ∧ ∃𝑧 𝑧 = 𝐶))
64, 5sylibr 137 . 2 ((𝐴𝑉𝐵𝑊𝐶𝑋) → ∃𝑥𝑦𝑧(𝑥 = 𝐴𝑦 = 𝐵𝑧 = 𝐶))
7 spc3egv.1 . . . . . . . 8 ((𝑥 = 𝐴𝑦 = 𝐵𝑧 = 𝐶) → (𝜑𝜓))
87biimpcd 148 . . . . . . 7 (𝜑 → ((𝑥 = 𝐴𝑦 = 𝐵𝑧 = 𝐶) → 𝜓))
982alimi 1345 . . . . . 6 (∀𝑦𝑧𝜑 → ∀𝑦𝑧((𝑥 = 𝐴𝑦 = 𝐵𝑧 = 𝐶) → 𝜓))
109alimi 1344 . . . . 5 (∀𝑥𝑦𝑧𝜑 → ∀𝑥𝑦𝑧((𝑥 = 𝐴𝑦 = 𝐵𝑧 = 𝐶) → 𝜓))
11 exim 1490 . . . . . 6 (∀𝑧((𝑥 = 𝐴𝑦 = 𝐵𝑧 = 𝐶) → 𝜓) → (∃𝑧(𝑥 = 𝐴𝑦 = 𝐵𝑧 = 𝐶) → ∃𝑧𝜓))
12112alimi 1345 . . . . 5 (∀𝑥𝑦𝑧((𝑥 = 𝐴𝑦 = 𝐵𝑧 = 𝐶) → 𝜓) → ∀𝑥𝑦(∃𝑧(𝑥 = 𝐴𝑦 = 𝐵𝑧 = 𝐶) → ∃𝑧𝜓))
1310, 12syl 14 . . . 4 (∀𝑥𝑦𝑧𝜑 → ∀𝑥𝑦(∃𝑧(𝑥 = 𝐴𝑦 = 𝐵𝑧 = 𝐶) → ∃𝑧𝜓))
14 exim 1490 . . . . 5 (∀𝑦(∃𝑧(𝑥 = 𝐴𝑦 = 𝐵𝑧 = 𝐶) → ∃𝑧𝜓) → (∃𝑦𝑧(𝑥 = 𝐴𝑦 = 𝐵𝑧 = 𝐶) → ∃𝑦𝑧𝜓))
1514alimi 1344 . . . 4 (∀𝑥𝑦(∃𝑧(𝑥 = 𝐴𝑦 = 𝐵𝑧 = 𝐶) → ∃𝑧𝜓) → ∀𝑥(∃𝑦𝑧(𝑥 = 𝐴𝑦 = 𝐵𝑧 = 𝐶) → ∃𝑦𝑧𝜓))
16 exim 1490 . . . 4 (∀𝑥(∃𝑦𝑧(𝑥 = 𝐴𝑦 = 𝐵𝑧 = 𝐶) → ∃𝑦𝑧𝜓) → (∃𝑥𝑦𝑧(𝑥 = 𝐴𝑦 = 𝐵𝑧 = 𝐶) → ∃𝑥𝑦𝑧𝜓))
1713, 15, 163syl 17 . . 3 (∀𝑥𝑦𝑧𝜑 → (∃𝑥𝑦𝑧(𝑥 = 𝐴𝑦 = 𝐵𝑧 = 𝐶) → ∃𝑥𝑦𝑧𝜓))
18 19.9v 1751 . . . 4 (∃𝑥𝑦𝑧𝜓 ↔ ∃𝑦𝑧𝜓)
19 19.9v 1751 . . . 4 (∃𝑦𝑧𝜓 ↔ ∃𝑧𝜓)
20 19.9v 1751 . . . 4 (∃𝑧𝜓𝜓)
2118, 19, 203bitri 195 . . 3 (∃𝑥𝑦𝑧𝜓𝜓)
2217, 21syl6ib 150 . 2 (∀𝑥𝑦𝑧𝜑 → (∃𝑥𝑦𝑧(𝑥 = 𝐴𝑦 = 𝐵𝑧 = 𝐶) → 𝜓))
236, 22syl5com 26 1 ((𝐴𝑉𝐵𝑊𝐶𝑋) → (∀𝑥𝑦𝑧𝜑𝜓))
 Colors of variables: wff set class Syntax hints:   → wi 4   ↔ wb 98   ∧ w3a 885  ∀wal 1241   = wceq 1243  ∃wex 1381   ∈ wcel 1393 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-4 1400  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-ext 2022 This theorem depends on definitions:  df-bi 110  df-3an 887  df-nf 1350  df-sb 1646  df-clab 2027  df-cleq 2033  df-clel 2036  df-v 2559 This theorem is referenced by:  funopg  4934
 Copyright terms: Public domain W3C validator