Theorem brcgr3 36546

Description: Binary relation form of the three-place congruence predicate. (Contributed by Scott Fenton, 4-Oct-2013.)

Assertion

Ref	Expression
brcgr3	⊢ ((𝑁 ∈ ℕ ∧ (𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁) ∧ 𝐶 ∈ (𝔼‘𝑁)) ∧ (𝐷 ∈ (𝔼‘𝑁) ∧ 𝐸 ∈ (𝔼‘𝑁) ∧ 𝐹 ∈ (𝔼‘𝑁))) → (⟨𝐴, ⟨𝐵, 𝐶⟩⟩Cgr3⟨𝐷, ⟨𝐸, 𝐹⟩⟩ ↔ (⟨𝐴, 𝐵⟩Cgr⟨𝐷, 𝐸⟩ ∧ ⟨𝐴, 𝐶⟩Cgr⟨𝐷, 𝐹⟩ ∧ ⟨𝐵, 𝐶⟩Cgr⟨𝐸, 𝐹⟩)))

Proof of Theorem brcgr3

Dummy variables 𝑎 𝑏 𝑐 𝑑 𝑒 𝑓 𝑛 𝑝 𝑞 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		opeq1 4837	. . . 4 ⊢ (𝑎 = 𝐴 → ⟨𝑎, 𝑏⟩ = ⟨𝐴, 𝑏⟩)
2	1	breq1d 5118	. . 3 ⊢ (𝑎 = 𝐴 → (⟨𝑎, 𝑏⟩Cgr⟨𝑑, 𝑒⟩ ↔ ⟨𝐴, 𝑏⟩Cgr⟨𝑑, 𝑒⟩))
3		opeq1 4837	. . . 4 ⊢ (𝑎 = 𝐴 → ⟨𝑎, 𝑐⟩ = ⟨𝐴, 𝑐⟩)
4	3	breq1d 5118	. . 3 ⊢ (𝑎 = 𝐴 → (⟨𝑎, 𝑐⟩Cgr⟨𝑑, 𝑓⟩ ↔ ⟨𝐴, 𝑐⟩Cgr⟨𝑑, 𝑓⟩))
5	2, 4	3anbi12d 1464	. 2 ⊢ (𝑎 = 𝐴 → ((⟨𝑎, 𝑏⟩Cgr⟨𝑑, 𝑒⟩ ∧ ⟨𝑎, 𝑐⟩Cgr⟨𝑑, 𝑓⟩ ∧ ⟨𝑏, 𝑐⟩Cgr⟨𝑒, 𝑓⟩) ↔ (⟨𝐴, 𝑏⟩Cgr⟨𝑑, 𝑒⟩ ∧ ⟨𝐴, 𝑐⟩Cgr⟨𝑑, 𝑓⟩ ∧ ⟨𝑏, 𝑐⟩Cgr⟨𝑒, 𝑓⟩)))
6		opeq2 4838	. . . 4 ⊢ (𝑏 = 𝐵 → ⟨𝐴, 𝑏⟩ = ⟨𝐴, 𝐵⟩)
7	6	breq1d 5118	. . 3 ⊢ (𝑏 = 𝐵 → (⟨𝐴, 𝑏⟩Cgr⟨𝑑, 𝑒⟩ ↔ ⟨𝐴, 𝐵⟩Cgr⟨𝑑, 𝑒⟩))
8		opeq1 4837	. . . 4 ⊢ (𝑏 = 𝐵 → ⟨𝑏, 𝑐⟩ = ⟨𝐵, 𝑐⟩)
9	8	breq1d 5118	. . 3 ⊢ (𝑏 = 𝐵 → (⟨𝑏, 𝑐⟩Cgr⟨𝑒, 𝑓⟩ ↔ ⟨𝐵, 𝑐⟩Cgr⟨𝑒, 𝑓⟩))
10	7, 9	3anbi13d 1465	. 2 ⊢ (𝑏 = 𝐵 → ((⟨𝐴, 𝑏⟩Cgr⟨𝑑, 𝑒⟩ ∧ ⟨𝐴, 𝑐⟩Cgr⟨𝑑, 𝑓⟩ ∧ ⟨𝑏, 𝑐⟩Cgr⟨𝑒, 𝑓⟩) ↔ (⟨𝐴, 𝐵⟩Cgr⟨𝑑, 𝑒⟩ ∧ ⟨𝐴, 𝑐⟩Cgr⟨𝑑, 𝑓⟩ ∧ ⟨𝐵, 𝑐⟩Cgr⟨𝑒, 𝑓⟩)))
11		opeq2 4838	. . . 4 ⊢ (𝑐 = 𝐶 → ⟨𝐴, 𝑐⟩ = ⟨𝐴, 𝐶⟩)
12	11	breq1d 5118	. . 3 ⊢ (𝑐 = 𝐶 → (⟨𝐴, 𝑐⟩Cgr⟨𝑑, 𝑓⟩ ↔ ⟨𝐴, 𝐶⟩Cgr⟨𝑑, 𝑓⟩))
13		opeq2 4838	. . . 4 ⊢ (𝑐 = 𝐶 → ⟨𝐵, 𝑐⟩ = ⟨𝐵, 𝐶⟩)
14	13	breq1d 5118	. . 3 ⊢ (𝑐 = 𝐶 → (⟨𝐵, 𝑐⟩Cgr⟨𝑒, 𝑓⟩ ↔ ⟨𝐵, 𝐶⟩Cgr⟨𝑒, 𝑓⟩))
15	12, 14	3anbi23d 1466	. 2 ⊢ (𝑐 = 𝐶 → ((⟨𝐴, 𝐵⟩Cgr⟨𝑑, 𝑒⟩ ∧ ⟨𝐴, 𝑐⟩Cgr⟨𝑑, 𝑓⟩ ∧ ⟨𝐵, 𝑐⟩Cgr⟨𝑒, 𝑓⟩) ↔ (⟨𝐴, 𝐵⟩Cgr⟨𝑑, 𝑒⟩ ∧ ⟨𝐴, 𝐶⟩Cgr⟨𝑑, 𝑓⟩ ∧ ⟨𝐵, 𝐶⟩Cgr⟨𝑒, 𝑓⟩)))
16		opeq1 4837	. . . 4 ⊢ (𝑑 = 𝐷 → ⟨𝑑, 𝑒⟩ = ⟨𝐷, 𝑒⟩)
17	16	breq2d 5120	. . 3 ⊢ (𝑑 = 𝐷 → (⟨𝐴, 𝐵⟩Cgr⟨𝑑, 𝑒⟩ ↔ ⟨𝐴, 𝐵⟩Cgr⟨𝐷, 𝑒⟩))
18		opeq1 4837	. . . 4 ⊢ (𝑑 = 𝐷 → ⟨𝑑, 𝑓⟩ = ⟨𝐷, 𝑓⟩)
19	18	breq2d 5120	. . 3 ⊢ (𝑑 = 𝐷 → (⟨𝐴, 𝐶⟩Cgr⟨𝑑, 𝑓⟩ ↔ ⟨𝐴, 𝐶⟩Cgr⟨𝐷, 𝑓⟩))
20	17, 19	3anbi12d 1464	. 2 ⊢ (𝑑 = 𝐷 → ((⟨𝐴, 𝐵⟩Cgr⟨𝑑, 𝑒⟩ ∧ ⟨𝐴, 𝐶⟩Cgr⟨𝑑, 𝑓⟩ ∧ ⟨𝐵, 𝐶⟩Cgr⟨𝑒, 𝑓⟩) ↔ (⟨𝐴, 𝐵⟩Cgr⟨𝐷, 𝑒⟩ ∧ ⟨𝐴, 𝐶⟩Cgr⟨𝐷, 𝑓⟩ ∧ ⟨𝐵, 𝐶⟩Cgr⟨𝑒, 𝑓⟩)))
21		opeq2 4838	. . . 4 ⊢ (𝑒 = 𝐸 → ⟨𝐷, 𝑒⟩ = ⟨𝐷, 𝐸⟩)
22	21	breq2d 5120	. . 3 ⊢ (𝑒 = 𝐸 → (⟨𝐴, 𝐵⟩Cgr⟨𝐷, 𝑒⟩ ↔ ⟨𝐴, 𝐵⟩Cgr⟨𝐷, 𝐸⟩))
23		opeq1 4837	. . . 4 ⊢ (𝑒 = 𝐸 → ⟨𝑒, 𝑓⟩ = ⟨𝐸, 𝑓⟩)
24	23	breq2d 5120	. . 3 ⊢ (𝑒 = 𝐸 → (⟨𝐵, 𝐶⟩Cgr⟨𝑒, 𝑓⟩ ↔ ⟨𝐵, 𝐶⟩Cgr⟨𝐸, 𝑓⟩))
25	22, 24	3anbi13d 1465	. 2 ⊢ (𝑒 = 𝐸 → ((⟨𝐴, 𝐵⟩Cgr⟨𝐷, 𝑒⟩ ∧ ⟨𝐴, 𝐶⟩Cgr⟨𝐷, 𝑓⟩ ∧ ⟨𝐵, 𝐶⟩Cgr⟨𝑒, 𝑓⟩) ↔ (⟨𝐴, 𝐵⟩Cgr⟨𝐷, 𝐸⟩ ∧ ⟨𝐴, 𝐶⟩Cgr⟨𝐷, 𝑓⟩ ∧ ⟨𝐵, 𝐶⟩Cgr⟨𝐸, 𝑓⟩)))
26		opeq2 4838	. . . 4 ⊢ (𝑓 = 𝐹 → ⟨𝐷, 𝑓⟩ = ⟨𝐷, 𝐹⟩)
27	26	breq2d 5120	. . 3 ⊢ (𝑓 = 𝐹 → (⟨𝐴, 𝐶⟩Cgr⟨𝐷, 𝑓⟩ ↔ ⟨𝐴, 𝐶⟩Cgr⟨𝐷, 𝐹⟩))
28		opeq2 4838	. . . 4 ⊢ (𝑓 = 𝐹 → ⟨𝐸, 𝑓⟩ = ⟨𝐸, 𝐹⟩)
29	28	breq2d 5120	. . 3 ⊢ (𝑓 = 𝐹 → (⟨𝐵, 𝐶⟩Cgr⟨𝐸, 𝑓⟩ ↔ ⟨𝐵, 𝐶⟩Cgr⟨𝐸, 𝐹⟩))
30	27, 29	3anbi23d 1466	. 2 ⊢ (𝑓 = 𝐹 → ((⟨𝐴, 𝐵⟩Cgr⟨𝐷, 𝐸⟩ ∧ ⟨𝐴, 𝐶⟩Cgr⟨𝐷, 𝑓⟩ ∧ ⟨𝐵, 𝐶⟩Cgr⟨𝐸, 𝑓⟩) ↔ (⟨𝐴, 𝐵⟩Cgr⟨𝐷, 𝐸⟩ ∧ ⟨𝐴, 𝐶⟩Cgr⟨𝐷, 𝐹⟩ ∧ ⟨𝐵, 𝐶⟩Cgr⟨𝐸, 𝐹⟩)))
31		fveq2 6881	. 2 ⊢ (𝑛 = 𝑁 → (𝔼‘𝑛) = (𝔼‘𝑁))
32		df-cgr3 36541	. 2 ⊢ Cgr3 = {⟨𝑝, 𝑞⟩ ∣ ∃𝑛 ∈ ℕ ∃𝑎 ∈ (𝔼‘𝑛)∃𝑏 ∈ (𝔼‘𝑛)∃𝑐 ∈ (𝔼‘𝑛)∃𝑑 ∈ (𝔼‘𝑛)∃𝑒 ∈ (𝔼‘𝑛)∃𝑓 ∈ (𝔼‘𝑛)(𝑝 = ⟨𝑎, ⟨𝑏, 𝑐⟩⟩ ∧ 𝑞 = ⟨𝑑, ⟨𝑒, 𝑓⟩⟩ ∧ (⟨𝑎, 𝑏⟩Cgr⟨𝑑, 𝑒⟩ ∧ ⟨𝑎, 𝑐⟩Cgr⟨𝑑, 𝑓⟩ ∧ ⟨𝑏, 𝑐⟩Cgr⟨𝑒, 𝑓⟩))}
33	5, 10, 15, 20, 25, 30, 31, 32	br6 36257	1 ⊢ ((𝑁 ∈ ℕ ∧ (𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁) ∧ 𝐶 ∈ (𝔼‘𝑁)) ∧ (𝐷 ∈ (𝔼‘𝑁) ∧ 𝐸 ∈ (𝔼‘𝑁) ∧ 𝐹 ∈ (𝔼‘𝑁))) → (⟨𝐴, ⟨𝐵, 𝐶⟩⟩Cgr3⟨𝐷, ⟨𝐸, 𝐹⟩⟩ ↔ (⟨𝐴, 𝐵⟩Cgr⟨𝐷, 𝐸⟩ ∧ ⟨𝐴, 𝐶⟩Cgr⟨𝐷, 𝐹⟩ ∧ ⟨𝐵, 𝐶⟩Cgr⟨𝐸, 𝐹⟩)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ w3a 1102   = wceq 1569   ∈ wcel 2142  ⟨cop 4594   class class class wbr 5108  ‘cfv 6536  ℕcn 12239  𝔼cee 29248  Cgrccgr 29250  Cgr3ccgr3 36536

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-ext 2734  ax-sep 5256  ax-pr 5403

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-sb 2096  df-clab 2741  df-cleq 2754  df-clel 2837  df-ral 3079  df-rex 3089  df-rab 3416  df-v 3456  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4487  df-sn 4589  df-pr 4591  df-op 4595  df-uni 4872  df-br 5109  df-opab 5173  df-iota 6492  df-fv 6544  df-cgr3 36541

This theorem is used by:  cgr3permute3  36547  cgr3permute1  36548  cgr3tr4  36552  cgr3com  36553  cgr3rflx  36554  cgrxfr  36555  btwnxfr  36556  lineext  36576  brofs2  36577  brifs2  36578  endofsegid  36585  btwnconn1lem4  36590  btwnconn1lem8  36594  btwnconn1lem11  36597  brsegle2  36609  seglecgr12im  36610  segletr  36614