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

Theorem spc3egv 3561
Description: Existential specialization with three quantifiers, using implicit substitution. (Contributed by NM, 12-May-2008.) Avoid ax-10 2180 and ax-11 2197. (Revised by GG, 20-Aug-2023.) (Proof shortened by Wolf Lammen, 25-Aug-2023.)
Hypothesis
Ref Expression
spc3egv.1 ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵 ∧ 𝑧 = 𝐶) → (𝜑 ↔ 𝜓))
Assertion
Ref Expression
spc3egv ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → (𝜓 → ∃𝑥∃𝑦∃𝑧𝜑))
Distinct variable groups:   𝑥,𝑦,𝑧,𝐴   𝑥,𝐵,𝑦,𝑧   𝑥,𝐶,𝑦,𝑧   𝜓,𝑥,𝑦,𝑧
Allowed substitution hints:   𝜑(𝑥, 𝑦, 𝑧)   𝑉(𝑥, 𝑦, 𝑧)   𝑊(𝑥, 𝑦, 𝑧)   𝑋(𝑥, 𝑦, 𝑧)

Proof of Theorem spc3egv
StepHypRef Expression
1 elex 3475 . 2 (𝐴 ∈ 𝑉 → 𝐴 ∈ V)
2 elex 3475 . 2 (𝐵 ∈ 𝑊 → 𝐵 ∈ V)
3 elex 3475 . 2 (𝐶 ∈ 𝑋 → 𝐶 ∈ V)
4 simp1 1154 . . 3 ((𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝐶 ∈ V) → 𝐴 ∈ V)
5 spc3egv.1 . . . . . . . . . . 11 ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵 ∧ 𝑧 = 𝐶) → (𝜑 ↔ 𝜓))
653coml 1145 . . . . . . . . . 10 ((𝑦 = 𝐵 ∧ 𝑧 = 𝐶 ∧ 𝑥 = 𝐴) → (𝜑 ↔ 𝜓))
763expa 1136 . . . . . . . . 9 (((𝑦 = 𝐵 ∧ 𝑧 = 𝐶) ∧ 𝑥 = 𝐴) → (𝜑 ↔ 𝜓))
87pm5.74da 816 . . . . . . . 8 ((𝑦 = 𝐵 ∧ 𝑧 = 𝐶) → ((𝑥 = 𝐴 → 𝜑) ↔ (𝑥 = 𝐴 → 𝜓)))
98spc2egv 3557 . . . . . . 7 ((𝐵 ∈ V ∧ 𝐶 ∈ V) → ((𝑥 = 𝐴 → 𝜓) → ∃𝑦∃𝑧(𝑥 = 𝐴 → 𝜑)))
10 19.37v 2032 . . . . . . . . 9 (∃𝑧(𝑥 = 𝐴 → 𝜑) ↔ (𝑥 = 𝐴 → ∃𝑧𝜑))
1110exbii 1881 . . . . . . . 8 (∃𝑦∃𝑧(𝑥 = 𝐴 → 𝜑) ↔ ∃𝑦(𝑥 = 𝐴 → ∃𝑧𝜑))
12 19.37v 2032 . . . . . . . 8 (∃𝑦(𝑥 = 𝐴 → ∃𝑧𝜑) ↔ (𝑥 = 𝐴 → ∃𝑦∃𝑧𝜑))
1311, 12bitri 278 . . . . . . 7 (∃𝑦∃𝑧(𝑥 = 𝐴 → 𝜑) ↔ (𝑥 = 𝐴 → ∃𝑦∃𝑧𝜑))
149, 13imbitrdi 254 . . . . . 6 ((𝐵 ∈ V ∧ 𝐶 ∈ V) → ((𝑥 = 𝐴 → 𝜓) → (𝑥 = 𝐴 → ∃𝑦∃𝑧𝜑)))
1514pm2.86d 109 . . . . 5 ((𝐵 ∈ V ∧ 𝐶 ∈ V) → (𝑥 = 𝐴 → (𝜓 → ∃𝑦∃𝑧𝜑)))
16153adant1 1148 . . . 4 ((𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝐶 ∈ V) → (𝑥 = 𝐴 → (𝜓 → ∃𝑦∃𝑧𝜑)))
1716imp 412 . . 3 (((𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝐶 ∈ V) ∧ 𝑥 = 𝐴) → (𝜓 → ∃𝑦∃𝑧𝜑))
184, 17spcimedv 3553 . 2 ((𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝐶 ∈ V) → (𝜓 → ∃𝑥∃𝑦∃𝑧𝜑))
191, 2, 3, 18syl3an 1178 1 ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → (𝜓 → ∃𝑥∃𝑦∃𝑧𝜑))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570  ∃wex 1812   ∈ wcel 2147  Vcvv 3454
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735
This proof depends on definitions:  df-bi 210  df-an 402  df-3an 1105  df-tru 1573  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-v 3456
This theorem is used by:  spc3gv  3562  dihjatcclem4  42744  fundcmpsurbijinjpreimafv  48762  fundcmpsurinjALT  48767
  Copyright terms: Public domain W3C validator