Theorem copsex2d 37980

Description: Implicit substitution deduction for ordered pairs. (Contributed by BJ, 25-Dec-2023.)

Hypotheses

Ref	Expression
copsex2d.xph	⊢ (𝜑 → ∀𝑥𝜑)
copsex2d.yph	⊢ (𝜑 → ∀𝑦𝜑)
copsex2d.xch	⊢ (𝜑 → Ⅎ𝑥𝜒)
copsex2d.ych	⊢ (𝜑 → Ⅎ𝑦𝜒)
copsex2d.exa	⊢ (𝜑 → 𝐴 ∈ 𝑈)
copsex2d.exb	⊢ (𝜑 → 𝐵 ∈ 𝑉)
copsex2d.is	⊢ ((𝜑 ∧ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)) → (𝜓 ↔ 𝜒))

Assertion

Ref	Expression
copsex2d	⊢ (𝜑 → (∃𝑥∃𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜓) ↔ 𝜒))

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

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

Proof of Theorem copsex2d

Step	Hyp	Ref	Expression
1		copsex2d.exa	. . 3 ⊢ (𝜑 → 𝐴 ∈ 𝑈)
2		elisset 2842	. . 3 ⊢ (𝐴 ∈ 𝑈 → ∃𝑥 𝑥 = 𝐴)
3	1, 2	syl 18	. 2 ⊢ (𝜑 → ∃𝑥 𝑥 = 𝐴)
4		copsex2d.exb	. . 3 ⊢ (𝜑 → 𝐵 ∈ 𝑉)
5		elisset 2842	. . 3 ⊢ (𝐵 ∈ 𝑉 → ∃𝑦 𝑦 = 𝐵)
6	4, 5	syl 18	. 2 ⊢ (𝜑 → ∃𝑦 𝑦 = 𝐵)
7		exdistrv 1988	. . 3 ⊢ (∃𝑥∃𝑦(𝑥 = 𝐴 ∧ 𝑦 = 𝐵) ↔ (∃𝑥 𝑥 = 𝐴 ∧ ∃𝑦 𝑦 = 𝐵))
8		copsex2d.xph	. . . 4 ⊢ (𝜑 → ∀𝑥𝜑)
9		nfe1 2187	. . . . . . 7 ⊢ Ⅎ𝑥∃𝑥∃𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜓)
10	9	a1i 11	. . . . . 6 ⊢ (𝜑 → Ⅎ𝑥∃𝑥∃𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜓))
11		copsex2d.xch	. . . . . 6 ⊢ (𝜑 → Ⅎ𝑥𝜒)
12	10, 11	nfbid 1935	. . . . 5 ⊢ (𝜑 → Ⅎ𝑥(∃𝑥∃𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜓) ↔ 𝜒))
13	12	19.9d 2239	. . . 4 ⊢ (𝜑 → (∃𝑥(∃𝑥∃𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜓) ↔ 𝜒) → (∃𝑥∃𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜓) ↔ 𝜒)))
14		copsex2d.yph	. . . . 5 ⊢ (𝜑 → ∀𝑦𝜑)
15		nfe1 2187	. . . . . . . . 9 ⊢ Ⅎ𝑦∃𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜓)
16	15	a1i 11	. . . . . . . 8 ⊢ (𝜑 → Ⅎ𝑦∃𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜓))
17	8, 16	bj-nfexd 37977	. . . . . . 7 ⊢ (𝜑 → Ⅎ𝑦∃𝑥∃𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜓))
18		copsex2d.ych	. . . . . . 7 ⊢ (𝜑 → Ⅎ𝑦𝜒)
19	17, 18	nfbid 1935	. . . . . 6 ⊢ (𝜑 → Ⅎ𝑦(∃𝑥∃𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜓) ↔ 𝜒))
20	19	19.9d 2239	. . . . 5 ⊢ (𝜑 → (∃𝑦(∃𝑥∃𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜓) ↔ 𝜒) → (∃𝑥∃𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜓) ↔ 𝜒)))
21		opeq12 4834	. . . . . . . . 9 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → ⟨𝑥, 𝑦⟩ = ⟨𝐴, 𝐵⟩)
22		copsexgw 5458	. . . . . . . . . . 11 ⊢ (⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ → (𝜓 ↔ ∃𝑥∃𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜓)))
23	22	bicomd 226	. . . . . . . . . 10 ⊢ (⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ → (∃𝑥∃𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜓) ↔ 𝜓))
24	23	eqcoms 2768	. . . . . . . . 9 ⊢ (⟨𝑥, 𝑦⟩ = ⟨𝐴, 𝐵⟩ → (∃𝑥∃𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜓) ↔ 𝜓))
25	21, 24	syl 18	. . . . . . . 8 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (∃𝑥∃𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜓) ↔ 𝜓))
26	25	adantl 487	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)) → (∃𝑥∃𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜓) ↔ 𝜓))
27		copsex2d.is	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)) → (𝜓 ↔ 𝜒))
28	26, 27	bitrd 282	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)) → (∃𝑥∃𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜓) ↔ 𝜒))
29	28	ex 418	. . . . 5 ⊢ (𝜑 → ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (∃𝑥∃𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜓) ↔ 𝜒)))
30	14, 20, 29	bj-exlimd 37429	. . . 4 ⊢ (𝜑 → (∃𝑦(𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (∃𝑥∃𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜓) ↔ 𝜒)))
31	8, 13, 30	bj-exlimd 37429	. . 3 ⊢ (𝜑 → (∃𝑥∃𝑦(𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (∃𝑥∃𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜓) ↔ 𝜒)))
32	7, 31	biimtrrid 246	. 2 ⊢ (𝜑 → ((∃𝑥 𝑥 = 𝐴 ∧ ∃𝑦 𝑦 = 𝐵) → (∃𝑥∃𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜓) ↔ 𝜒)))
33	3, 6, 32	mp2and 712	1 ⊢ (𝜑 → (∃𝑥∃𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜓) ↔ 𝜒))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401  ∀wal 1568   = wceq 1570  ∃wex 1812  Ⅎwnf 1816   ∈ wcel 2145  ⟨cop 4589

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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-sep 5248  ax-pr 5390

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-rab 3413  df-v 3452  df-dif 3901  df-un 3903  df-ss 3915  df-nul 4279  df-if 4482  df-sn 4584  df-pr 4586  df-op 4590

This theorem is used by:  copsex2b  37981  opelopabd  37982