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

Theorem spc2ed 3555
Description: Existential specialization with 2 quantifiers, using implicit substitution. (Contributed by Thierry Arnoux, 23-Aug-2017.)
Hypotheses
Ref Expression
spc2ed.x Ⅎ𝑥𝜒
spc2ed.y Ⅎ𝑦𝜒
spc2ed.1 ((𝜑 ∧ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)) → (𝜓 ↔ 𝜒))
Assertion
Ref Expression
spc2ed ((𝜑 ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊)) → (𝜒 → ∃𝑥∃𝑦𝜓))
Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝐵,𝑦   𝜑,𝑥,𝑦
Allowed substitution hints:   𝜓(𝑥, 𝑦)   𝜒(𝑥, 𝑦)   𝑉(𝑥, 𝑦)   𝑊(𝑥, 𝑦)

Proof of Theorem spc2ed
StepHypRef Expression
1 elisset 2842 . . . 4 (𝐴 ∈ 𝑉 → ∃𝑥 𝑥 = 𝐴)
2 elisset 2842 . . . 4 (𝐵 ∈ 𝑊 → ∃𝑦 𝑦 = 𝐵)
31, 2anim12i 625 . . 3 ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (∃𝑥 𝑥 = 𝐴 ∧ ∃𝑦 𝑦 = 𝐵))
4 exdistrv 1987 . . 3 (∃𝑥∃𝑦(𝑥 = 𝐴 ∧ 𝑦 = 𝐵) ↔ (∃𝑥 𝑥 = 𝐴 ∧ ∃𝑦 𝑦 = 𝐵))
53, 4sylibr 237 . 2 ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ∃𝑥∃𝑦(𝑥 = 𝐴 ∧ 𝑦 = 𝐵))
6 nfv 1946 . . . . 5 Ⅎ𝑥𝜑
7 spc2ed.x . . . . 5 Ⅎ𝑥𝜒
86, 7nfan 1931 . . . 4 Ⅎ𝑥(𝜑 ∧ 𝜒)
9 nfv 1946 . . . . . 6 Ⅎ𝑦𝜑
10 spc2ed.y . . . . . 6 Ⅎ𝑦𝜒
119, 10nfan 1931 . . . . 5 Ⅎ𝑦(𝜑 ∧ 𝜒)
12 anass 474 . . . . . . . 8 (((𝜒 ∧ 𝜑) ∧ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)) ↔ (𝜒 ∧ (𝜑 ∧ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵))))
13 ancom 466 . . . . . . . . 9 ((𝜒 ∧ 𝜑) ↔ (𝜑 ∧ 𝜒))
1413anbi1i 636 . . . . . . . 8 (((𝜒 ∧ 𝜑) ∧ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)) ↔ ((𝜑 ∧ 𝜒) ∧ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)))
1512, 14bitr3i 280 . . . . . . 7 ((𝜒 ∧ (𝜑 ∧ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵))) ↔ ((𝜑 ∧ 𝜒) ∧ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)))
16 spc2ed.1 . . . . . . . 8 ((𝜑 ∧ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)) → (𝜓 ↔ 𝜒))
1716biimparc 485 . . . . . . 7 ((𝜒 ∧ (𝜑 ∧ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵))) → 𝜓)
1815, 17sylbir 238 . . . . . 6 (((𝜑 ∧ 𝜒) ∧ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)) → 𝜓)
1918ex 418 . . . . 5 ((𝜑 ∧ 𝜒) → ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → 𝜓))
2011, 19eximd 2252 . . . 4 ((𝜑 ∧ 𝜒) → (∃𝑦(𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → ∃𝑦𝜓))
218, 20eximd 2252 . . 3 ((𝜑 ∧ 𝜒) → (∃𝑥∃𝑦(𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → ∃𝑥∃𝑦𝜓))
2221impancom 457 . 2 ((𝜑 ∧ ∃𝑥∃𝑦(𝑥 = 𝐴 ∧ 𝑦 = 𝐵)) → (𝜒 → ∃𝑥∃𝑦𝜓))
235, 22sylan2 605 1 ((𝜑 ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊)) → (𝜒 → ∃𝑥∃𝑦𝜓))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1569  ∃wex 1811  Ⅎwnf 1815   ∈ wcel 2144
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-12 2212
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1572  df-ex 1812  df-nf 1816  df-sb 2099  df-clab 2739  df-clel 2835
This theorem is used by:  spc2d  3556  or2expropbilem1  48196  ich2exprop  48647  reuopreuprim  48702
  Copyright terms: Public domain W3C validator