Theorem netap 7373

Description: Negated equality on a set with decidable equality is a tight apartness. (Contributed by Jim Kingdon, 5-Feb-2025.)

Assertion

Ref	Expression
netap	⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 → {⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑢 ≠ 𝑣)} TAp 𝐴)

Distinct variable groups:   𝑢,𝐴,𝑣   𝑥,𝐴,𝑦

Proof of Theorem netap

Dummy variables 𝑎 𝑏 𝑐 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		opabssxp 4753	. . 3 ⊢ {⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑢 ≠ 𝑣)} ⊆ (𝐴 × 𝐴)
2	1	a1i 9	. 2 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 → {⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑢 ≠ 𝑣)} ⊆ (𝐴 × 𝐴))
3		neirr 2386	. . . . . 6 ⊢ ¬ 𝑎 ≠ 𝑎
4		df-br 4048	. . . . . . 7 ⊢ (𝑎{⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑢 ≠ 𝑣)}𝑎 ↔ ⟨𝑎, 𝑎⟩ ∈ {⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑢 ≠ 𝑣)})
5		neeq1 2390	. . . . . . . . 9 ⊢ (𝑢 = 𝑎 → (𝑢 ≠ 𝑣 ↔ 𝑎 ≠ 𝑣))
6		neeq2 2391	. . . . . . . . 9 ⊢ (𝑣 = 𝑎 → (𝑎 ≠ 𝑣 ↔ 𝑎 ≠ 𝑎))
7	5, 6	opelopab2 4321	. . . . . . . 8 ⊢ ((𝑎 ∈ 𝐴 ∧ 𝑎 ∈ 𝐴) → (⟨𝑎, 𝑎⟩ ∈ {⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑢 ≠ 𝑣)} ↔ 𝑎 ≠ 𝑎))
8	7	anidms 397	. . . . . . 7 ⊢ (𝑎 ∈ 𝐴 → (⟨𝑎, 𝑎⟩ ∈ {⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑢 ≠ 𝑣)} ↔ 𝑎 ≠ 𝑎))
9	4, 8	bitrid 192	. . . . . 6 ⊢ (𝑎 ∈ 𝐴 → (𝑎{⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑢 ≠ 𝑣)}𝑎 ↔ 𝑎 ≠ 𝑎))
10	3, 9	mtbiri 677	. . . . 5 ⊢ (𝑎 ∈ 𝐴 → ¬ 𝑎{⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑢 ≠ 𝑣)}𝑎)
11	10	rgen 2560	. . . 4 ⊢ ∀𝑎 ∈ 𝐴 ¬ 𝑎{⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑢 ≠ 𝑣)}𝑎
12	11	a1i 9	. . 3 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 → ∀𝑎 ∈ 𝐴 ¬ 𝑎{⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑢 ≠ 𝑣)}𝑎)
13		df-br 4048	. . . . . . . 8 ⊢ (𝑎{⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑢 ≠ 𝑣)}𝑏 ↔ ⟨𝑎, 𝑏⟩ ∈ {⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑢 ≠ 𝑣)})
14		neeq2 2391	. . . . . . . . 9 ⊢ (𝑣 = 𝑏 → (𝑎 ≠ 𝑣 ↔ 𝑎 ≠ 𝑏))
15	5, 14	opelopab2 4321	. . . . . . . 8 ⊢ ((𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐴) → (⟨𝑎, 𝑏⟩ ∈ {⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑢 ≠ 𝑣)} ↔ 𝑎 ≠ 𝑏))
16	13, 15	bitrid 192	. . . . . . 7 ⊢ ((𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐴) → (𝑎{⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑢 ≠ 𝑣)}𝑏 ↔ 𝑎 ≠ 𝑏))
17		df-br 4048	. . . . . . . 8 ⊢ (𝑏{⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑢 ≠ 𝑣)}𝑎 ↔ ⟨𝑏, 𝑎⟩ ∈ {⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑢 ≠ 𝑣)})
18		neeq1 2390	. . . . . . . . . . 11 ⊢ (𝑢 = 𝑏 → (𝑢 ≠ 𝑣 ↔ 𝑏 ≠ 𝑣))
19		neeq2 2391	. . . . . . . . . . 11 ⊢ (𝑣 = 𝑎 → (𝑏 ≠ 𝑣 ↔ 𝑏 ≠ 𝑎))
20	18, 19	opelopab2 4321	. . . . . . . . . 10 ⊢ ((𝑏 ∈ 𝐴 ∧ 𝑎 ∈ 𝐴) → (⟨𝑏, 𝑎⟩ ∈ {⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑢 ≠ 𝑣)} ↔ 𝑏 ≠ 𝑎))
21	20	ancoms 268	. . . . . . . . 9 ⊢ ((𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐴) → (⟨𝑏, 𝑎⟩ ∈ {⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑢 ≠ 𝑣)} ↔ 𝑏 ≠ 𝑎))
22		necom 2461	. . . . . . . . 9 ⊢ (𝑏 ≠ 𝑎 ↔ 𝑎 ≠ 𝑏)
23	21, 22	bitrdi 196	. . . . . . . 8 ⊢ ((𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐴) → (⟨𝑏, 𝑎⟩ ∈ {⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑢 ≠ 𝑣)} ↔ 𝑎 ≠ 𝑏))
24	17, 23	bitrid 192	. . . . . . 7 ⊢ ((𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐴) → (𝑏{⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑢 ≠ 𝑣)}𝑎 ↔ 𝑎 ≠ 𝑏))
25	16, 24	bitr4d 191	. . . . . 6 ⊢ ((𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐴) → (𝑎{⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑢 ≠ 𝑣)}𝑏 ↔ 𝑏{⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑢 ≠ 𝑣)}𝑎))
26	25	biimpd 144	. . . . 5 ⊢ ((𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐴) → (𝑎{⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑢 ≠ 𝑣)}𝑏 → 𝑏{⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑢 ≠ 𝑣)}𝑎))
27	26	rgen2 2593	. . . 4 ⊢ ∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐴 (𝑎{⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑢 ≠ 𝑣)}𝑏 → 𝑏{⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑢 ≠ 𝑣)}𝑎)
28	27	a1i 9	. . 3 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 → ∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐴 (𝑎{⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑢 ≠ 𝑣)}𝑏 → 𝑏{⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑢 ≠ 𝑣)}𝑎))
29	12, 28	jca 306	. 2 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 → (∀𝑎 ∈ 𝐴 ¬ 𝑎{⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑢 ≠ 𝑣)}𝑎 ∧ ∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐴 (𝑎{⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑢 ≠ 𝑣)}𝑏 → 𝑏{⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑢 ≠ 𝑣)}𝑎)))
30	16	3adant3 1020	. . . . . 6 ⊢ ((𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐴 ∧ 𝑐 ∈ 𝐴) → (𝑎{⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑢 ≠ 𝑣)}𝑏 ↔ 𝑎 ≠ 𝑏))
31	30	adantl 277	. . . . 5 ⊢ ((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ (𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐴 ∧ 𝑐 ∈ 𝐴)) → (𝑎{⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑢 ≠ 𝑣)}𝑏 ↔ 𝑎 ≠ 𝑏))
32		simpr 110	. . . . . . . . . . 11 ⊢ ((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ (𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐴 ∧ 𝑐 ∈ 𝐴)) ∧ 𝑎 ≠ 𝑏) ∧ 𝑎 = 𝑐) → 𝑎 = 𝑐)
33		simplr 528	. . . . . . . . . . 11 ⊢ ((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ (𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐴 ∧ 𝑐 ∈ 𝐴)) ∧ 𝑎 ≠ 𝑏) ∧ 𝑎 = 𝑐) → 𝑎 ≠ 𝑏)
34	32, 33	eqnetrrd 2403	. . . . . . . . . 10 ⊢ ((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ (𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐴 ∧ 𝑐 ∈ 𝐴)) ∧ 𝑎 ≠ 𝑏) ∧ 𝑎 = 𝑐) → 𝑐 ≠ 𝑏)
35	34	necomd 2463	. . . . . . . . 9 ⊢ ((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ (𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐴 ∧ 𝑐 ∈ 𝐴)) ∧ 𝑎 ≠ 𝑏) ∧ 𝑎 = 𝑐) → 𝑏 ≠ 𝑐)
36	35	olcd 736	. . . . . . . 8 ⊢ ((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ (𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐴 ∧ 𝑐 ∈ 𝐴)) ∧ 𝑎 ≠ 𝑏) ∧ 𝑎 = 𝑐) → (𝑎 ≠ 𝑐 ∨ 𝑏 ≠ 𝑐))
37		simpr 110	. . . . . . . . . 10 ⊢ ((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ (𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐴 ∧ 𝑐 ∈ 𝐴)) ∧ 𝑎 ≠ 𝑏) ∧ ¬ 𝑎 = 𝑐) → ¬ 𝑎 = 𝑐)
38	37	neqned 2384	. . . . . . . . 9 ⊢ ((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ (𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐴 ∧ 𝑐 ∈ 𝐴)) ∧ 𝑎 ≠ 𝑏) ∧ ¬ 𝑎 = 𝑐) → 𝑎 ≠ 𝑐)
39	38	orcd 735	. . . . . . . 8 ⊢ ((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ (𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐴 ∧ 𝑐 ∈ 𝐴)) ∧ 𝑎 ≠ 𝑏) ∧ ¬ 𝑎 = 𝑐) → (𝑎 ≠ 𝑐 ∨ 𝑏 ≠ 𝑐))
40		equequ2 1737	. . . . . . . . . . 11 ⊢ (𝑦 = 𝑐 → (𝑎 = 𝑦 ↔ 𝑎 = 𝑐))
41	40	dcbid 840	. . . . . . . . . 10 ⊢ (𝑦 = 𝑐 → (DECID 𝑎 = 𝑦 ↔ DECID 𝑎 = 𝑐))
42		equequ1 1736	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝑎 → (𝑥 = 𝑦 ↔ 𝑎 = 𝑦))
43	42	dcbid 840	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝑎 → (DECID 𝑥 = 𝑦 ↔ DECID 𝑎 = 𝑦))
44	43	ralbidv 2507	. . . . . . . . . . 11 ⊢ (𝑥 = 𝑎 → (∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ↔ ∀𝑦 ∈ 𝐴 DECID 𝑎 = 𝑦))
45		simpll 527	. . . . . . . . . . 11 ⊢ (((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ (𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐴 ∧ 𝑐 ∈ 𝐴)) ∧ 𝑎 ≠ 𝑏) → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦)
46		simplr1 1042	. . . . . . . . . . 11 ⊢ (((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ (𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐴 ∧ 𝑐 ∈ 𝐴)) ∧ 𝑎 ≠ 𝑏) → 𝑎 ∈ 𝐴)
47	44, 45, 46	rspcdva 2883	. . . . . . . . . 10 ⊢ (((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ (𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐴 ∧ 𝑐 ∈ 𝐴)) ∧ 𝑎 ≠ 𝑏) → ∀𝑦 ∈ 𝐴 DECID 𝑎 = 𝑦)
48		simplr3 1044	. . . . . . . . . 10 ⊢ (((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ (𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐴 ∧ 𝑐 ∈ 𝐴)) ∧ 𝑎 ≠ 𝑏) → 𝑐 ∈ 𝐴)
49	41, 47, 48	rspcdva 2883	. . . . . . . . 9 ⊢ (((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ (𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐴 ∧ 𝑐 ∈ 𝐴)) ∧ 𝑎 ≠ 𝑏) → DECID 𝑎 = 𝑐)
50		exmiddc 838	. . . . . . . . 9 ⊢ (DECID 𝑎 = 𝑐 → (𝑎 = 𝑐 ∨ ¬ 𝑎 = 𝑐))
51	49, 50	syl 14	. . . . . . . 8 ⊢ (((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ (𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐴 ∧ 𝑐 ∈ 𝐴)) ∧ 𝑎 ≠ 𝑏) → (𝑎 = 𝑐 ∨ ¬ 𝑎 = 𝑐))
52	36, 39, 51	mpjaodan 800	. . . . . . 7 ⊢ (((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ (𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐴 ∧ 𝑐 ∈ 𝐴)) ∧ 𝑎 ≠ 𝑏) → (𝑎 ≠ 𝑐 ∨ 𝑏 ≠ 𝑐))
53		df-br 4048	. . . . . . . . . 10 ⊢ (𝑎{⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑢 ≠ 𝑣)}𝑐 ↔ ⟨𝑎, 𝑐⟩ ∈ {⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑢 ≠ 𝑣)})
54		neeq2 2391	. . . . . . . . . . . 12 ⊢ (𝑣 = 𝑐 → (𝑎 ≠ 𝑣 ↔ 𝑎 ≠ 𝑐))
55	5, 54	opelopab2 4321	. . . . . . . . . . 11 ⊢ ((𝑎 ∈ 𝐴 ∧ 𝑐 ∈ 𝐴) → (⟨𝑎, 𝑐⟩ ∈ {⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑢 ≠ 𝑣)} ↔ 𝑎 ≠ 𝑐))
56	55	3adant2 1019	. . . . . . . . . 10 ⊢ ((𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐴 ∧ 𝑐 ∈ 𝐴) → (⟨𝑎, 𝑐⟩ ∈ {⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑢 ≠ 𝑣)} ↔ 𝑎 ≠ 𝑐))
57	53, 56	bitrid 192	. . . . . . . . 9 ⊢ ((𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐴 ∧ 𝑐 ∈ 𝐴) → (𝑎{⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑢 ≠ 𝑣)}𝑐 ↔ 𝑎 ≠ 𝑐))
58		df-br 4048	. . . . . . . . . 10 ⊢ (𝑏{⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑢 ≠ 𝑣)}𝑐 ↔ ⟨𝑏, 𝑐⟩ ∈ {⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑢 ≠ 𝑣)})
59		neeq2 2391	. . . . . . . . . . . 12 ⊢ (𝑣 = 𝑐 → (𝑏 ≠ 𝑣 ↔ 𝑏 ≠ 𝑐))
60	18, 59	opelopab2 4321	. . . . . . . . . . 11 ⊢ ((𝑏 ∈ 𝐴 ∧ 𝑐 ∈ 𝐴) → (⟨𝑏, 𝑐⟩ ∈ {⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑢 ≠ 𝑣)} ↔ 𝑏 ≠ 𝑐))
61	60	3adant1 1018	. . . . . . . . . 10 ⊢ ((𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐴 ∧ 𝑐 ∈ 𝐴) → (⟨𝑏, 𝑐⟩ ∈ {⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑢 ≠ 𝑣)} ↔ 𝑏 ≠ 𝑐))
62	58, 61	bitrid 192	. . . . . . . . 9 ⊢ ((𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐴 ∧ 𝑐 ∈ 𝐴) → (𝑏{⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑢 ≠ 𝑣)}𝑐 ↔ 𝑏 ≠ 𝑐))
63	57, 62	orbi12d 795	. . . . . . . 8 ⊢ ((𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐴 ∧ 𝑐 ∈ 𝐴) → ((𝑎{⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑢 ≠ 𝑣)}𝑐 ∨ 𝑏{⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑢 ≠ 𝑣)}𝑐) ↔ (𝑎 ≠ 𝑐 ∨ 𝑏 ≠ 𝑐)))
64	63	ad2antlr 489	. . . . . . 7 ⊢ (((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ (𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐴 ∧ 𝑐 ∈ 𝐴)) ∧ 𝑎 ≠ 𝑏) → ((𝑎{⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑢 ≠ 𝑣)}𝑐 ∨ 𝑏{⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑢 ≠ 𝑣)}𝑐) ↔ (𝑎 ≠ 𝑐 ∨ 𝑏 ≠ 𝑐)))
65	52, 64	mpbird 167	. . . . . 6 ⊢ (((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ (𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐴 ∧ 𝑐 ∈ 𝐴)) ∧ 𝑎 ≠ 𝑏) → (𝑎{⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑢 ≠ 𝑣)}𝑐 ∨ 𝑏{⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑢 ≠ 𝑣)}𝑐))
66	65	ex 115	. . . . 5 ⊢ ((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ (𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐴 ∧ 𝑐 ∈ 𝐴)) → (𝑎 ≠ 𝑏 → (𝑎{⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑢 ≠ 𝑣)}𝑐 ∨ 𝑏{⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑢 ≠ 𝑣)}𝑐)))
67	31, 66	sylbid 150	. . . 4 ⊢ ((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ (𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐴 ∧ 𝑐 ∈ 𝐴)) → (𝑎{⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑢 ≠ 𝑣)}𝑏 → (𝑎{⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑢 ≠ 𝑣)}𝑐 ∨ 𝑏{⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑢 ≠ 𝑣)}𝑐)))
68	67	ralrimivvva 2590	. . 3 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 → ∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐴 ∀𝑐 ∈ 𝐴 (𝑎{⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑢 ≠ 𝑣)}𝑏 → (𝑎{⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑢 ≠ 𝑣)}𝑐 ∨ 𝑏{⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑢 ≠ 𝑣)}𝑐)))
69	16	notbid 669	. . . . . . 7 ⊢ ((𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐴) → (¬ 𝑎{⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑢 ≠ 𝑣)}𝑏 ↔ ¬ 𝑎 ≠ 𝑏))
70		df-ne 2378	. . . . . . . 8 ⊢ (𝑎 ≠ 𝑏 ↔ ¬ 𝑎 = 𝑏)
71	70	notbii 670	. . . . . . 7 ⊢ (¬ 𝑎 ≠ 𝑏 ↔ ¬ ¬ 𝑎 = 𝑏)
72	69, 71	bitrdi 196	. . . . . 6 ⊢ ((𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐴) → (¬ 𝑎{⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑢 ≠ 𝑣)}𝑏 ↔ ¬ ¬ 𝑎 = 𝑏))
73	72	adantl 277	. . . . 5 ⊢ ((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ (𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐴)) → (¬ 𝑎{⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑢 ≠ 𝑣)}𝑏 ↔ ¬ ¬ 𝑎 = 𝑏))
74		equequ2 1737	. . . . . . . 8 ⊢ (𝑦 = 𝑏 → (𝑎 = 𝑦 ↔ 𝑎 = 𝑏))
75	74	dcbid 840	. . . . . . 7 ⊢ (𝑦 = 𝑏 → (DECID 𝑎 = 𝑦 ↔ DECID 𝑎 = 𝑏))
76		simpl 109	. . . . . . . 8 ⊢ ((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ (𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐴)) → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦)
77		simprl 529	. . . . . . . 8 ⊢ ((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ (𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐴)) → 𝑎 ∈ 𝐴)
78	44, 76, 77	rspcdva 2883	. . . . . . 7 ⊢ ((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ (𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐴)) → ∀𝑦 ∈ 𝐴 DECID 𝑎 = 𝑦)
79		simprr 531	. . . . . . 7 ⊢ ((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ (𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐴)) → 𝑏 ∈ 𝐴)
80	75, 78, 79	rspcdva 2883	. . . . . 6 ⊢ ((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ (𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐴)) → DECID 𝑎 = 𝑏)
81		notnotrdc 845	. . . . . 6 ⊢ (DECID 𝑎 = 𝑏 → (¬ ¬ 𝑎 = 𝑏 → 𝑎 = 𝑏))
82	80, 81	syl 14	. . . . 5 ⊢ ((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ (𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐴)) → (¬ ¬ 𝑎 = 𝑏 → 𝑎 = 𝑏))
83	73, 82	sylbid 150	. . . 4 ⊢ ((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ (𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐴)) → (¬ 𝑎{⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑢 ≠ 𝑣)}𝑏 → 𝑎 = 𝑏))
84	83	ralrimivva 2589	. . 3 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 → ∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐴 (¬ 𝑎{⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑢 ≠ 𝑣)}𝑏 → 𝑎 = 𝑏))
85	68, 84	jca 306	. 2 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 → (∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐴 ∀𝑐 ∈ 𝐴 (𝑎{⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑢 ≠ 𝑣)}𝑏 → (𝑎{⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑢 ≠ 𝑣)}𝑐 ∨ 𝑏{⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑢 ≠ 𝑣)}𝑐)) ∧ ∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐴 (¬ 𝑎{⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑢 ≠ 𝑣)}𝑏 → 𝑎 = 𝑏)))
86		dftap2 7370	. 2 ⊢ ({⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑢 ≠ 𝑣)} TAp 𝐴 ↔ ({⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑢 ≠ 𝑣)} ⊆ (𝐴 × 𝐴) ∧ (∀𝑎 ∈ 𝐴 ¬ 𝑎{⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑢 ≠ 𝑣)}𝑎 ∧ ∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐴 (𝑎{⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑢 ≠ 𝑣)}𝑏 → 𝑏{⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑢 ≠ 𝑣)}𝑎)) ∧ (∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐴 ∀𝑐 ∈ 𝐴 (𝑎{⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑢 ≠ 𝑣)}𝑏 → (𝑎{⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑢 ≠ 𝑣)}𝑐 ∨ 𝑏{⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑢 ≠ 𝑣)}𝑐)) ∧ ∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐴 (¬ 𝑎{⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑢 ≠ 𝑣)}𝑏 → 𝑎 = 𝑏))))
87	2, 29, 85, 86	syl3anbrc 1184	1 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 → {⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ 𝑢 ≠ 𝑣)} TAp 𝐴)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 104   ↔ wb 105   ∨ wo 710  DECID wdc 836   ∧ w3a 981   ∈ wcel 2177   ≠ wne 2377  ∀wral 2485   ⊆ wss 3167  ⟨cop 3637   class class class wbr 4047  {copab 4108   × cxp 4677   TAp wtap 7368

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 615  ax-in2 616  ax-io 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-14 2180  ax-ext 2188  ax-sep 4166  ax-pow 4222  ax-pr 4257

This theorem depends on definitions:  df-bi 117  df-dc 837  df-3an 983  df-tru 1376  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2193  df-cleq 2199  df-clel 2202  df-nfc 2338  df-ne 2378  df-ral 2490  df-v 2775  df-un 3171  df-in 3173  df-ss 3180  df-pw 3619  df-sn 3640  df-pr 3641  df-op 3643  df-br 4048  df-opab 4110  df-xp 4685  df-pap 7367  df-tap 7369

This theorem is referenced by:  2onetap  7374  exmidapne  7379