Theorem spc2d 3563

Description: 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
spc2d	⊢ ((𝜑 ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊)) → (∀𝑥∀𝑦𝜓 → 𝜒))

Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝐵,𝑦   𝜑,𝑥,𝑦

Allowed substitution hints:   𝜓(𝑥, 𝑦)   𝜒(𝑥, 𝑦)   𝑉(𝑥, 𝑦)   𝑊(𝑥, 𝑦)

Proof of Theorem spc2d

Step	Hyp	Ref	Expression
1		2nalexn 1861	. . 3 ⊢ (¬ ∀𝑥∀𝑦𝜓 ↔ ∃𝑥∃𝑦 ¬ 𝜓)
2	1	con1bii 359	. 2 ⊢ (¬ ∃𝑥∃𝑦 ¬ 𝜓 ↔ ∀𝑥∀𝑦𝜓)
3		spc2ed.x	. . . . 5 ⊢ Ⅎ𝑥𝜒
4	3	nfn 1890	. . . 4 ⊢ Ⅎ𝑥 ¬ 𝜒
5		spc2ed.y	. . . . 5 ⊢ Ⅎ𝑦𝜒
6	5	nfn 1890	. . . 4 ⊢ Ⅎ𝑦 ¬ 𝜒
7		spc2ed.1	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)) → (𝜓 ↔ 𝜒))
8	7	notbid 321	. . . 4 ⊢ ((𝜑 ∧ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)) → (¬ 𝜓 ↔ ¬ 𝜒))
9	4, 6, 8	spc2ed 3562	. . 3 ⊢ ((𝜑 ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊)) → (¬ 𝜒 → ∃𝑥∃𝑦 ¬ 𝜓))
10	9	con1d 146	. 2 ⊢ ((𝜑 ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊)) → (¬ ∃𝑥∃𝑦 ¬ 𝜓 → 𝜒))
11	2, 10	biimtrrid 246	1 ⊢ ((𝜑 ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊)) → (∀𝑥∀𝑦𝜓 → 𝜒))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401  ∀wal 1568   = wceq 1570  ∃wex 1812  Ⅎwnf 1816   ∈ wcel 2146

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 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-12 2216

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-ex 1813  df-nf 1817  df-sb 2100  df-clab 2744  df-clel 2840

This theorem is used by: (None)