Theorem brco3f1o 44057

Description: Conditions allowing the decomposition of a binary relation. (Contributed by RP, 8-Jun-2021.)

Hypotheses

Ref	Expression
brco3f1o.c	⊢ (𝜑 → 𝐶:𝑌–1-1-onto→𝑍)
brco3f1o.d	⊢ (𝜑 → 𝐷:𝑋–1-1-onto→𝑌)
brco3f1o.e	⊢ (𝜑 → 𝐸:𝑊–1-1-onto→𝑋)
brco3f1o.r	⊢ (𝜑 → 𝐴(𝐶 ∘ (𝐷 ∘ 𝐸))𝐵)

Assertion

Ref	Expression
brco3f1o	⊢ (𝜑 → ((◡𝐶‘𝐵)𝐶𝐵 ∧ (◡𝐷‘(◡𝐶‘𝐵))𝐷(◡𝐶‘𝐵) ∧ 𝐴𝐸(◡𝐷‘(◡𝐶‘𝐵))))

Proof of Theorem brco3f1o

Step	Hyp	Ref	Expression
1		brco3f1o.e	. . . 4 ⊢ (𝜑 → 𝐸:𝑊–1-1-onto→𝑋)
2		f1ocnv 6830	. . . 4 ⊢ (𝐸:𝑊–1-1-onto→𝑋 → ◡𝐸:𝑋–1-1-onto→𝑊)
3		f1ofn 6819	. . . 4 ⊢ (◡𝐸:𝑋–1-1-onto→𝑊 → ◡𝐸 Fn 𝑋)
4	1, 2, 3	3syl 18	. . 3 ⊢ (𝜑 → ◡𝐸 Fn 𝑋)
5		brco3f1o.d	. . . 4 ⊢ (𝜑 → 𝐷:𝑋–1-1-onto→𝑌)
6		f1ocnv 6830	. . . 4 ⊢ (𝐷:𝑋–1-1-onto→𝑌 → ◡𝐷:𝑌–1-1-onto→𝑋)
7		f1of 6818	. . . 4 ⊢ (◡𝐷:𝑌–1-1-onto→𝑋 → ◡𝐷:𝑌⟶𝑋)
8	5, 6, 7	3syl 18	. . 3 ⊢ (𝜑 → ◡𝐷:𝑌⟶𝑋)
9		brco3f1o.c	. . . 4 ⊢ (𝜑 → 𝐶:𝑌–1-1-onto→𝑍)
10		f1ocnv 6830	. . . 4 ⊢ (𝐶:𝑌–1-1-onto→𝑍 → ◡𝐶:𝑍–1-1-onto→𝑌)
11		f1of 6818	. . . 4 ⊢ (◡𝐶:𝑍–1-1-onto→𝑌 → ◡𝐶:𝑍⟶𝑌)
12	9, 10, 11	3syl 18	. . 3 ⊢ (𝜑 → ◡𝐶:𝑍⟶𝑌)
13		brco3f1o.r	. . . 4 ⊢ (𝜑 → 𝐴(𝐶 ∘ (𝐷 ∘ 𝐸))𝐵)
14		relco 6095	. . . . . 6 ⊢ Rel ((𝐶 ∘ 𝐷) ∘ 𝐸)
15	14	relbrcnv 6094	. . . . 5 ⊢ (𝐵◡((𝐶 ∘ 𝐷) ∘ 𝐸)𝐴 ↔ 𝐴((𝐶 ∘ 𝐷) ∘ 𝐸)𝐵)
16		cnvco 5865	. . . . . . 7 ⊢ ◡((𝐶 ∘ 𝐷) ∘ 𝐸) = (◡𝐸 ∘ ◡(𝐶 ∘ 𝐷))
17		cnvco 5865	. . . . . . . 8 ⊢ ◡(𝐶 ∘ 𝐷) = (◡𝐷 ∘ ◡𝐶)
18	17	coeq2i 5840	. . . . . . 7 ⊢ (◡𝐸 ∘ ◡(𝐶 ∘ 𝐷)) = (◡𝐸 ∘ (◡𝐷 ∘ ◡𝐶))
19	16, 18	eqtri 2758	. . . . . 6 ⊢ ◡((𝐶 ∘ 𝐷) ∘ 𝐸) = (◡𝐸 ∘ (◡𝐷 ∘ ◡𝐶))
20	19	breqi 5125	. . . . 5 ⊢ (𝐵◡((𝐶 ∘ 𝐷) ∘ 𝐸)𝐴 ↔ 𝐵(◡𝐸 ∘ (◡𝐷 ∘ ◡𝐶))𝐴)
21		coass 6254	. . . . . 6 ⊢ ((𝐶 ∘ 𝐷) ∘ 𝐸) = (𝐶 ∘ (𝐷 ∘ 𝐸))
22	21	breqi 5125	. . . . 5 ⊢ (𝐴((𝐶 ∘ 𝐷) ∘ 𝐸)𝐵 ↔ 𝐴(𝐶 ∘ (𝐷 ∘ 𝐸))𝐵)
23	15, 20, 22	3bitr3ri 302	. . . 4 ⊢ (𝐴(𝐶 ∘ (𝐷 ∘ 𝐸))𝐵 ↔ 𝐵(◡𝐸 ∘ (◡𝐷 ∘ ◡𝐶))𝐴)
24	13, 23	sylib 218	. . 3 ⊢ (𝜑 → 𝐵(◡𝐸 ∘ (◡𝐷 ∘ ◡𝐶))𝐴)
25	4, 8, 12, 24	brcofffn 44055	. 2 ⊢ (𝜑 → (𝐵◡𝐶(◡𝐶‘𝐵) ∧ (◡𝐶‘𝐵)◡𝐷(◡𝐷‘(◡𝐶‘𝐵)) ∧ (◡𝐷‘(◡𝐶‘𝐵))◡𝐸𝐴))
26		f1orel 6821	. . . 4 ⊢ (𝐶:𝑌–1-1-onto→𝑍 → Rel 𝐶)
27		relbrcnvg 6092	. . . 4 ⊢ (Rel 𝐶 → (𝐵◡𝐶(◡𝐶‘𝐵) ↔ (◡𝐶‘𝐵)𝐶𝐵))
28	9, 26, 27	3syl 18	. . 3 ⊢ (𝜑 → (𝐵◡𝐶(◡𝐶‘𝐵) ↔ (◡𝐶‘𝐵)𝐶𝐵))
29		f1orel 6821	. . . 4 ⊢ (𝐷:𝑋–1-1-onto→𝑌 → Rel 𝐷)
30		relbrcnvg 6092	. . . 4 ⊢ (Rel 𝐷 → ((◡𝐶‘𝐵)◡𝐷(◡𝐷‘(◡𝐶‘𝐵)) ↔ (◡𝐷‘(◡𝐶‘𝐵))𝐷(◡𝐶‘𝐵)))
31	5, 29, 30	3syl 18	. . 3 ⊢ (𝜑 → ((◡𝐶‘𝐵)◡𝐷(◡𝐷‘(◡𝐶‘𝐵)) ↔ (◡𝐷‘(◡𝐶‘𝐵))𝐷(◡𝐶‘𝐵)))
32		f1orel 6821	. . . 4 ⊢ (𝐸:𝑊–1-1-onto→𝑋 → Rel 𝐸)
33		relbrcnvg 6092	. . . 4 ⊢ (Rel 𝐸 → ((◡𝐷‘(◡𝐶‘𝐵))◡𝐸𝐴 ↔ 𝐴𝐸(◡𝐷‘(◡𝐶‘𝐵))))
34	1, 32, 33	3syl 18	. . 3 ⊢ (𝜑 → ((◡𝐷‘(◡𝐶‘𝐵))◡𝐸𝐴 ↔ 𝐴𝐸(◡𝐷‘(◡𝐶‘𝐵))))
35	28, 31, 34	3anbi123d 1438	. 2 ⊢ (𝜑 → ((𝐵◡𝐶(◡𝐶‘𝐵) ∧ (◡𝐶‘𝐵)◡𝐷(◡𝐷‘(◡𝐶‘𝐵)) ∧ (◡𝐷‘(◡𝐶‘𝐵))◡𝐸𝐴) ↔ ((◡𝐶‘𝐵)𝐶𝐵 ∧ (◡𝐷‘(◡𝐶‘𝐵))𝐷(◡𝐶‘𝐵) ∧ 𝐴𝐸(◡𝐷‘(◡𝐶‘𝐵)))))
36	25, 35	mpbid 232	1 ⊢ (𝜑 → ((◡𝐶‘𝐵)𝐶𝐵 ∧ (◡𝐷‘(◡𝐶‘𝐵))𝐷(◡𝐶‘𝐵) ∧ 𝐴𝐸(◡𝐷‘(◡𝐶‘𝐵))))

Syntax hints:   → wi 4   ↔ wb 206   ∧ w3a 1086   class class class wbr 5119  ^◡ccnv 5653   ∘ ccom 5658  Rel wrel 5659   Fn wfn 6526  ⟶wf 6527  –1-1-onto→wf1o 6530  ‘cfv 6531

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2707  ax-sep 5266  ax-nul 5276  ax-pr 5402

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2539  df-eu 2568  df-clab 2714  df-cleq 2727  df-clel 2809  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3061  df-rab 3416  df-v 3461  df-dif 3929  df-un 3931  df-in 3933  df-ss 3943  df-nul 4309  df-if 4501  df-sn 4602  df-pr 4604  df-op 4608  df-uni 4884  df-br 5120  df-opab 5182  df-id 5548  df-xp 5660  df-rel 5661  df-cnv 5662  df-co 5663  df-dm 5664  df-rn 5665  df-res 5666  df-ima 5667  df-iota 6484  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539

This theorem is referenced by: (None)