Theorem tapeq1 7250

Description: Equality theorem for tight apartness predicate. (Contributed by Jim Kingdon, 8-Feb-2025.)

Assertion

Ref	Expression
tapeq1	⊢ (𝑅 = 𝑆 → (𝑅 TAp 𝐴 ↔ 𝑆 TAp 𝐴))

Proof of Theorem tapeq1

Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		sseq1 3178	. . 3 ⊢ (𝑅 = 𝑆 → (𝑅 ⊆ (𝐴 × 𝐴) ↔ 𝑆 ⊆ (𝐴 × 𝐴)))
2		breq 4005	. . . . . 6 ⊢ (𝑅 = 𝑆 → (𝑥𝑅𝑥 ↔ 𝑥𝑆𝑥))
3	2	notbid 667	. . . . 5 ⊢ (𝑅 = 𝑆 → (¬ 𝑥𝑅𝑥 ↔ ¬ 𝑥𝑆𝑥))
4	3	ralbidv 2477	. . . 4 ⊢ (𝑅 = 𝑆 → (∀𝑥 ∈ 𝐴 ¬ 𝑥𝑅𝑥 ↔ ∀𝑥 ∈ 𝐴 ¬ 𝑥𝑆𝑥))
5		breq 4005	. . . . . 6 ⊢ (𝑅 = 𝑆 → (𝑥𝑅𝑦 ↔ 𝑥𝑆𝑦))
6		breq 4005	. . . . . 6 ⊢ (𝑅 = 𝑆 → (𝑦𝑅𝑥 ↔ 𝑦𝑆𝑥))
7	5, 6	imbi12d 234	. . . . 5 ⊢ (𝑅 = 𝑆 → ((𝑥𝑅𝑦 → 𝑦𝑅𝑥) ↔ (𝑥𝑆𝑦 → 𝑦𝑆𝑥)))
8	7	2ralbidv 2501	. . . 4 ⊢ (𝑅 = 𝑆 → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → 𝑦𝑅𝑥) ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑆𝑦 → 𝑦𝑆𝑥)))
9	4, 8	anbi12d 473	. . 3 ⊢ (𝑅 = 𝑆 → ((∀𝑥 ∈ 𝐴 ¬ 𝑥𝑅𝑥 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → 𝑦𝑅𝑥)) ↔ (∀𝑥 ∈ 𝐴 ¬ 𝑥𝑆𝑥 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑆𝑦 → 𝑦𝑆𝑥))))
10		breq 4005	. . . . . . . 8 ⊢ (𝑅 = 𝑆 → (𝑥𝑅𝑧 ↔ 𝑥𝑆𝑧))
11		breq 4005	. . . . . . . 8 ⊢ (𝑅 = 𝑆 → (𝑦𝑅𝑧 ↔ 𝑦𝑆𝑧))
12	10, 11	orbi12d 793	. . . . . . 7 ⊢ (𝑅 = 𝑆 → ((𝑥𝑅𝑧 ∨ 𝑦𝑅𝑧) ↔ (𝑥𝑆𝑧 ∨ 𝑦𝑆𝑧)))
13	5, 12	imbi12d 234	. . . . . 6 ⊢ (𝑅 = 𝑆 → ((𝑥𝑅𝑦 → (𝑥𝑅𝑧 ∨ 𝑦𝑅𝑧)) ↔ (𝑥𝑆𝑦 → (𝑥𝑆𝑧 ∨ 𝑦𝑆𝑧))))
14	13	ralbidv 2477	. . . . 5 ⊢ (𝑅 = 𝑆 → (∀𝑧 ∈ 𝐴 (𝑥𝑅𝑦 → (𝑥𝑅𝑧 ∨ 𝑦𝑅𝑧)) ↔ ∀𝑧 ∈ 𝐴 (𝑥𝑆𝑦 → (𝑥𝑆𝑧 ∨ 𝑦𝑆𝑧))))
15	14	2ralbidv 2501	. . . 4 ⊢ (𝑅 = 𝑆 → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐴 (𝑥𝑅𝑦 → (𝑥𝑅𝑧 ∨ 𝑦𝑅𝑧)) ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐴 (𝑥𝑆𝑦 → (𝑥𝑆𝑧 ∨ 𝑦𝑆𝑧))))
16	5	notbid 667	. . . . . 6 ⊢ (𝑅 = 𝑆 → (¬ 𝑥𝑅𝑦 ↔ ¬ 𝑥𝑆𝑦))
17	16	imbi1d 231	. . . . 5 ⊢ (𝑅 = 𝑆 → ((¬ 𝑥𝑅𝑦 → 𝑥 = 𝑦) ↔ (¬ 𝑥𝑆𝑦 → 𝑥 = 𝑦)))
18	17	2ralbidv 2501	. . . 4 ⊢ (𝑅 = 𝑆 → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (¬ 𝑥𝑅𝑦 → 𝑥 = 𝑦) ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (¬ 𝑥𝑆𝑦 → 𝑥 = 𝑦)))
19	15, 18	anbi12d 473	. . 3 ⊢ (𝑅 = 𝑆 → ((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐴 (𝑥𝑅𝑦 → (𝑥𝑅𝑧 ∨ 𝑦𝑅𝑧)) ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (¬ 𝑥𝑅𝑦 → 𝑥 = 𝑦)) ↔ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐴 (𝑥𝑆𝑦 → (𝑥𝑆𝑧 ∨ 𝑦𝑆𝑧)) ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (¬ 𝑥𝑆𝑦 → 𝑥 = 𝑦))))
20	1, 9, 19	3anbi123d 1312	. 2 ⊢ (𝑅 = 𝑆 → ((𝑅 ⊆ (𝐴 × 𝐴) ∧ (∀𝑥 ∈ 𝐴 ¬ 𝑥𝑅𝑥 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → 𝑦𝑅𝑥)) ∧ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐴 (𝑥𝑅𝑦 → (𝑥𝑅𝑧 ∨ 𝑦𝑅𝑧)) ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (¬ 𝑥𝑅𝑦 → 𝑥 = 𝑦))) ↔ (𝑆 ⊆ (𝐴 × 𝐴) ∧ (∀𝑥 ∈ 𝐴 ¬ 𝑥𝑆𝑥 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑆𝑦 → 𝑦𝑆𝑥)) ∧ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐴 (𝑥𝑆𝑦 → (𝑥𝑆𝑧 ∨ 𝑦𝑆𝑧)) ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (¬ 𝑥𝑆𝑦 → 𝑥 = 𝑦)))))
21		dftap2 7249	. 2 ⊢ (𝑅 TAp 𝐴 ↔ (𝑅 ⊆ (𝐴 × 𝐴) ∧ (∀𝑥 ∈ 𝐴 ¬ 𝑥𝑅𝑥 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → 𝑦𝑅𝑥)) ∧ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐴 (𝑥𝑅𝑦 → (𝑥𝑅𝑧 ∨ 𝑦𝑅𝑧)) ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (¬ 𝑥𝑅𝑦 → 𝑥 = 𝑦))))
22		dftap2 7249	. 2 ⊢ (𝑆 TAp 𝐴 ↔ (𝑆 ⊆ (𝐴 × 𝐴) ∧ (∀𝑥 ∈ 𝐴 ¬ 𝑥𝑆𝑥 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑆𝑦 → 𝑦𝑆𝑥)) ∧ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐴 (𝑥𝑆𝑦 → (𝑥𝑆𝑧 ∨ 𝑦𝑆𝑧)) ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (¬ 𝑥𝑆𝑦 → 𝑥 = 𝑦))))
23	20, 21, 22	3bitr4g 223	1 ⊢ (𝑅 = 𝑆 → (𝑅 TAp 𝐴 ↔ 𝑆 TAp 𝐴))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 104   ↔ wb 105   ∨ wo 708   ∧ w3a 978   = wceq 1353  ∀wral 2455   ⊆ wss 3129   class class class wbr 4003   × cxp 4624   TAp wtap 7247

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 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-11 1506  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-ext 2159

This theorem depends on definitions:  df-bi 117  df-3an 980  df-nf 1461  df-sb 1763  df-clab 2164  df-cleq 2170  df-clel 2173  df-ral 2460  df-in 3135  df-ss 3142  df-br 4004  df-pap 7246  df-tap 7248

This theorem is referenced by:  2omotaplemst  7256  exmidapne  7258  exmidmotap  7259