Theorem dfid3 5549

Description: A stronger version of df-id 5546 that does not require 𝑥 and 𝑦 to be disjoint. This is not the definition since, in order to pass our definition soundness test, a definition has to have disjoint dummy variables, see conventions 30994. The proof can be instructive in showing how disjoint variable conditions may be eliminated, a task that is not necessarily obvious. (Contributed by NM, 5-Feb-2008.) (Revised by Mario Carneiro, 18-Nov-2016.)

Use df-id 5546 instead to make the semantics of the constructor df-opab 5168 clearer (in usages, 𝑥, 𝑦 will typically be dummy variables, so can be assumed disjoint). (New usage is discouraged.)

Assertion

Ref	Expression
dfid3	⊢ I = {⟨𝑥, 𝑦⟩ ∣ 𝑥 = 𝑦}

Proof of Theorem dfid3

Dummy variables 𝑧 𝑤 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-id 5546	. 2 ⊢ I = {⟨𝑥, 𝑧⟩ ∣ 𝑥 = 𝑧}
2		equcom 2051	. . . . . . . . . . 11 ⊢ (𝑥 = 𝑧 ↔ 𝑧 = 𝑥)
3	2	anbi1ci 638	. . . . . . . . . 10 ⊢ ((𝑤 = ⟨𝑥, 𝑧⟩ ∧ 𝑥 = 𝑧) ↔ (𝑧 = 𝑥 ∧ 𝑤 = ⟨𝑥, 𝑧⟩))
4	3	exbii 1881	. . . . . . . . 9 ⊢ (∃𝑧(𝑤 = ⟨𝑥, 𝑧⟩ ∧ 𝑥 = 𝑧) ↔ ∃𝑧(𝑧 = 𝑥 ∧ 𝑤 = ⟨𝑥, 𝑧⟩))
5		opeq2 4834	. . . . . . . . . . 11 ⊢ (𝑧 = 𝑥 → ⟨𝑥, 𝑧⟩ = ⟨𝑥, 𝑥⟩)
6	5	eqeq2d 2772	. . . . . . . . . 10 ⊢ (𝑧 = 𝑥 → (𝑤 = ⟨𝑥, 𝑧⟩ ↔ 𝑤 = ⟨𝑥, 𝑥⟩))
7	6	equsexvw 2038	. . . . . . . . 9 ⊢ (∃𝑧(𝑧 = 𝑥 ∧ 𝑤 = ⟨𝑥, 𝑧⟩) ↔ 𝑤 = ⟨𝑥, 𝑥⟩)
8		equid 2045	. . . . . . . . . 10 ⊢ 𝑥 = 𝑥
9	8	biantru 539	. . . . . . . . 9 ⊢ (𝑤 = ⟨𝑥, 𝑥⟩ ↔ (𝑤 = ⟨𝑥, 𝑥⟩ ∧ 𝑥 = 𝑥))
10	4, 7, 9	3bitri 300	. . . . . . . 8 ⊢ (∃𝑧(𝑤 = ⟨𝑥, 𝑧⟩ ∧ 𝑥 = 𝑧) ↔ (𝑤 = ⟨𝑥, 𝑥⟩ ∧ 𝑥 = 𝑥))
11	10	exbii 1881	. . . . . . 7 ⊢ (∃𝑥∃𝑧(𝑤 = ⟨𝑥, 𝑧⟩ ∧ 𝑥 = 𝑧) ↔ ∃𝑥(𝑤 = ⟨𝑥, 𝑥⟩ ∧ 𝑥 = 𝑥))
12		nfe1 2187	. . . . . . . 8 ⊢ Ⅎ𝑥∃𝑥(𝑤 = ⟨𝑥, 𝑥⟩ ∧ 𝑥 = 𝑥)
13	12	19.9 2242	. . . . . . 7 ⊢ (∃𝑥∃𝑥(𝑤 = ⟨𝑥, 𝑥⟩ ∧ 𝑥 = 𝑥) ↔ ∃𝑥(𝑤 = ⟨𝑥, 𝑥⟩ ∧ 𝑥 = 𝑥))
14	11, 13	bitr4i 281	. . . . . 6 ⊢ (∃𝑥∃𝑧(𝑤 = ⟨𝑥, 𝑧⟩ ∧ 𝑥 = 𝑧) ↔ ∃𝑥∃𝑥(𝑤 = ⟨𝑥, 𝑥⟩ ∧ 𝑥 = 𝑥))
15		opeq2 4834	. . . . . . . . . . 11 ⊢ (𝑥 = 𝑦 → ⟨𝑥, 𝑥⟩ = ⟨𝑥, 𝑦⟩)
16	15	eqeq2d 2772	. . . . . . . . . 10 ⊢ (𝑥 = 𝑦 → (𝑤 = ⟨𝑥, 𝑥⟩ ↔ 𝑤 = ⟨𝑥, 𝑦⟩))
17		equequ2 2059	. . . . . . . . . 10 ⊢ (𝑥 = 𝑦 → (𝑥 = 𝑥 ↔ 𝑥 = 𝑦))
18	16, 17	anbi12d 644	. . . . . . . . 9 ⊢ (𝑥 = 𝑦 → ((𝑤 = ⟨𝑥, 𝑥⟩ ∧ 𝑥 = 𝑥) ↔ (𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝑥 = 𝑦)))
19	18	sps 2222	. . . . . . . 8 ⊢ (∀𝑥 𝑥 = 𝑦 → ((𝑤 = ⟨𝑥, 𝑥⟩ ∧ 𝑥 = 𝑥) ↔ (𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝑥 = 𝑦)))
20	19	drex1 2471	. . . . . . 7 ⊢ (∀𝑥 𝑥 = 𝑦 → (∃𝑥(𝑤 = ⟨𝑥, 𝑥⟩ ∧ 𝑥 = 𝑥) ↔ ∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝑥 = 𝑦)))
21	20	drex2 2472	. . . . . 6 ⊢ (∀𝑥 𝑥 = 𝑦 → (∃𝑥∃𝑥(𝑤 = ⟨𝑥, 𝑥⟩ ∧ 𝑥 = 𝑥) ↔ ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝑥 = 𝑦)))
22	14, 21	bitrid 286	. . . . 5 ⊢ (∀𝑥 𝑥 = 𝑦 → (∃𝑥∃𝑧(𝑤 = ⟨𝑥, 𝑧⟩ ∧ 𝑥 = 𝑧) ↔ ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝑥 = 𝑦)))
23		nfnae 2464	. . . . . 6 ⊢ Ⅎ𝑥 ¬ ∀𝑥 𝑥 = 𝑦
24		nfnae 2464	. . . . . . 7 ⊢ Ⅎ𝑦 ¬ ∀𝑥 𝑥 = 𝑦
25		nfcvd 2924	. . . . . . . . 9 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → Ⅎ𝑦𝑤)
26		nfcvf2 2950	. . . . . . . . . 10 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → Ⅎ𝑦𝑥)
27		nfcvd 2924	. . . . . . . . . 10 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → Ⅎ𝑦𝑧)
28	26, 27	nfopd 4850	. . . . . . . . 9 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → Ⅎ𝑦⟨𝑥, 𝑧⟩)
29	25, 28	nfeqd 2933	. . . . . . . 8 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → Ⅎ𝑦 𝑤 = ⟨𝑥, 𝑧⟩)
30	26, 27	nfeqd 2933	. . . . . . . 8 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → Ⅎ𝑦 𝑥 = 𝑧)
31	29, 30	nfand 1930	. . . . . . 7 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → Ⅎ𝑦(𝑤 = ⟨𝑥, 𝑧⟩ ∧ 𝑥 = 𝑧))
32		opeq2 4834	. . . . . . . . . 10 ⊢ (𝑧 = 𝑦 → ⟨𝑥, 𝑧⟩ = ⟨𝑥, 𝑦⟩)
33	32	eqeq2d 2772	. . . . . . . . 9 ⊢ (𝑧 = 𝑦 → (𝑤 = ⟨𝑥, 𝑧⟩ ↔ 𝑤 = ⟨𝑥, 𝑦⟩))
34		equequ2 2059	. . . . . . . . 9 ⊢ (𝑧 = 𝑦 → (𝑥 = 𝑧 ↔ 𝑥 = 𝑦))
35	33, 34	anbi12d 644	. . . . . . . 8 ⊢ (𝑧 = 𝑦 → ((𝑤 = ⟨𝑥, 𝑧⟩ ∧ 𝑥 = 𝑧) ↔ (𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝑥 = 𝑦)))
36	35	a1i 11	. . . . . . 7 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → (𝑧 = 𝑦 → ((𝑤 = ⟨𝑥, 𝑧⟩ ∧ 𝑥 = 𝑧) ↔ (𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝑥 = 𝑦))))
37	24, 31, 36	cbvexd 2438	. . . . . 6 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → (∃𝑧(𝑤 = ⟨𝑥, 𝑧⟩ ∧ 𝑥 = 𝑧) ↔ ∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝑥 = 𝑦)))
38	23, 37	exbid 2260	. . . . 5 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → (∃𝑥∃𝑧(𝑤 = ⟨𝑥, 𝑧⟩ ∧ 𝑥 = 𝑧) ↔ ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝑥 = 𝑦)))
39	22, 38	pm2.61i 184	. . . 4 ⊢ (∃𝑥∃𝑧(𝑤 = ⟨𝑥, 𝑧⟩ ∧ 𝑥 = 𝑧) ↔ ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝑥 = 𝑦))
40	39	abbii 2828	. . 3 ⊢ {𝑤 ∣ ∃𝑥∃𝑧(𝑤 = ⟨𝑥, 𝑧⟩ ∧ 𝑥 = 𝑧)} = {𝑤 ∣ ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝑥 = 𝑦)}
41		df-opab 5168	. . 3 ⊢ {⟨𝑥, 𝑧⟩ ∣ 𝑥 = 𝑧} = {𝑤 ∣ ∃𝑥∃𝑧(𝑤 = ⟨𝑥, 𝑧⟩ ∧ 𝑥 = 𝑧)}
42		df-opab 5168	. . 3 ⊢ {⟨𝑥, 𝑦⟩ ∣ 𝑥 = 𝑦} = {𝑤 ∣ ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝑥 = 𝑦)}
43	40, 41, 42	3eqtr4i 2794	. 2 ⊢ {⟨𝑥, 𝑧⟩ ∣ 𝑥 = 𝑧} = {⟨𝑥, 𝑦⟩ ∣ 𝑥 = 𝑦}
44	1, 43	eqtri 2784	1 ⊢ I = {⟨𝑥, 𝑦⟩ ∣ 𝑥 = 𝑦}

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401  ∀wal 1568   = wceq 1570  ∃wex 1812  {cab 2739  ⟨cop 4590  {copab 5167   I cid 5545

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-13 2402  ax-ext 2733

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-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-opab 5168  df-id 5546

This theorem is used by: (None)