Theorem brco3f1o 44792

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 6837	. . . 4 ⊢ (𝐸:𝑊–1-1-onto→𝑋 → ◡𝐸:𝑋–1-1-onto→𝑊)
3		f1ofn 6825	. . . 4 ⊢ (◡𝐸:𝑋–1-1-onto→𝑊 → ◡𝐸 Fn 𝑋)
4	1, 2, 3	3syl 19	. . 3 ⊢ (𝜑 → ◡𝐸 Fn 𝑋)
5		brco3f1o.d	. . . 4 ⊢ (𝜑 → 𝐷:𝑋–1-1-onto→𝑌)
6		f1ocnv 6837	. . . 4 ⊢ (𝐷:𝑋–1-1-onto→𝑌 → ◡𝐷:𝑌–1-1-onto→𝑋)
7		f1of 6824	. . . 4 ⊢ (◡𝐷:𝑌–1-1-onto→𝑋 → ◡𝐷:𝑌⟶𝑋)
8	5, 6, 7	3syl 19	. . 3 ⊢ (𝜑 → ◡𝐷:𝑌⟶𝑋)
9		brco3f1o.c	. . . 4 ⊢ (𝜑 → 𝐶:𝑌–1-1-onto→𝑍)
10		f1ocnv 6837	. . . 4 ⊢ (𝐶:𝑌–1-1-onto→𝑍 → ◡𝐶:𝑍–1-1-onto→𝑌)
11		f1of 6824	. . . 4 ⊢ (◡𝐶:𝑍–1-1-onto→𝑌 → ◡𝐶:𝑍⟶𝑌)
12	9, 10, 11	3syl 19	. . 3 ⊢ (𝜑 → ◡𝐶:𝑍⟶𝑌)
13		brco3f1o.r	. . . 4 ⊢ (𝜑 → 𝐴(𝐶 ∘ (𝐷 ∘ 𝐸))𝐵)
14		relco 6112	. . . . . 6 ⊢ Rel ((𝐶 ∘ 𝐷) ∘ 𝐸)
15	14	relbrcnv 6111	. . . . 5 ⊢ (𝐵◡((𝐶 ∘ 𝐷) ∘ 𝐸)𝐴 ↔ 𝐴((𝐶 ∘ 𝐷) ∘ 𝐸)𝐵)
16		cnvco 5877	. . . . . . 7 ⊢ ◡((𝐶 ∘ 𝐷) ∘ 𝐸) = (◡𝐸 ∘ ◡(𝐶 ∘ 𝐷))
17		cnvco 5877	. . . . . . . 8 ⊢ ◡(𝐶 ∘ 𝐷) = (◡𝐷 ∘ ◡𝐶)
18	17	coeq2i 5848	. . . . . . 7 ⊢ (◡𝐸 ∘ ◡(𝐶 ∘ 𝐷)) = (◡𝐸 ∘ (◡𝐷 ∘ ◡𝐶))
19	16, 18	eqtri 2788	. . . . . 6 ⊢ ◡((𝐶 ∘ 𝐷) ∘ 𝐸) = (◡𝐸 ∘ (◡𝐷 ∘ ◡𝐶))
20	19	breqi 5117	. . . . 5 ⊢ (𝐵◡((𝐶 ∘ 𝐷) ∘ 𝐸)𝐴 ↔ 𝐵(◡𝐸 ∘ (◡𝐷 ∘ ◡𝐶))𝐴)
21		coass 6269	. . . . . 6 ⊢ ((𝐶 ∘ 𝐷) ∘ 𝐸) = (𝐶 ∘ (𝐷 ∘ 𝐸))
22	21	breqi 5117	. . . . 5 ⊢ (𝐴((𝐶 ∘ 𝐷) ∘ 𝐸)𝐵 ↔ 𝐴(𝐶 ∘ (𝐷 ∘ 𝐸))𝐵)
23	15, 20, 22	3bitr3ri 305	. . . 4 ⊢ (𝐴(𝐶 ∘ (𝐷 ∘ 𝐸))𝐵 ↔ 𝐵(◡𝐸 ∘ (◡𝐷 ∘ ◡𝐶))𝐴)
24	13, 23	sylib 221	. . 3 ⊢ (𝜑 → 𝐵(◡𝐸 ∘ (◡𝐷 ∘ ◡𝐶))𝐴)
25	4, 8, 12, 24	brcofffn 44790	. 2 ⊢ (𝜑 → (𝐵◡𝐶(◡𝐶‘𝐵) ∧ (◡𝐶‘𝐵)◡𝐷(◡𝐷‘(◡𝐶‘𝐵)) ∧ (◡𝐷‘(◡𝐶‘𝐵))◡𝐸𝐴))
26		f1orel 6827	. . . 4 ⊢ (𝐶:𝑌–1-1-onto→𝑍 → Rel 𝐶)
27		relbrcnvg 6109	. . . 4 ⊢ (Rel 𝐶 → (𝐵◡𝐶(◡𝐶‘𝐵) ↔ (◡𝐶‘𝐵)𝐶𝐵))
28	9, 26, 27	3syl 19	. . 3 ⊢ (𝜑 → (𝐵◡𝐶(◡𝐶‘𝐵) ↔ (◡𝐶‘𝐵)𝐶𝐵))
29		f1orel 6827	. . . 4 ⊢ (𝐷:𝑋–1-1-onto→𝑌 → Rel 𝐷)
30		relbrcnvg 6109	. . . 4 ⊢ (Rel 𝐷 → ((◡𝐶‘𝐵)◡𝐷(◡𝐷‘(◡𝐶‘𝐵)) ↔ (◡𝐷‘(◡𝐶‘𝐵))𝐷(◡𝐶‘𝐵)))
31	5, 29, 30	3syl 19	. . 3 ⊢ (𝜑 → ((◡𝐶‘𝐵)◡𝐷(◡𝐷‘(◡𝐶‘𝐵)) ↔ (◡𝐷‘(◡𝐶‘𝐵))𝐷(◡𝐶‘𝐵)))
32		f1orel 6827	. . . 4 ⊢ (𝐸:𝑊–1-1-onto→𝑋 → Rel 𝐸)
33		relbrcnvg 6109	. . . 4 ⊢ (Rel 𝐸 → ((◡𝐷‘(◡𝐶‘𝐵))◡𝐸𝐴 ↔ 𝐴𝐸(◡𝐷‘(◡𝐶‘𝐵))))
34	1, 32, 33	3syl 19	. . 3 ⊢ (𝜑 → ((◡𝐷‘(◡𝐶‘𝐵))◡𝐸𝐴 ↔ 𝐴𝐸(◡𝐷‘(◡𝐶‘𝐵))))
35	28, 31, 34	3anbi123d 1464	. 2 ⊢ (𝜑 → ((𝐵◡𝐶(◡𝐶‘𝐵) ∧ (◡𝐶‘𝐵)◡𝐷(◡𝐷‘(◡𝐶‘𝐵)) ∧ (◡𝐷‘(◡𝐶‘𝐵))◡𝐸𝐴) ↔ ((◡𝐶‘𝐵)𝐶𝐵 ∧ (◡𝐷‘(◡𝐶‘𝐵))𝐷(◡𝐶‘𝐵) ∧ 𝐴𝐸(◡𝐷‘(◡𝐶‘𝐵)))))
36	25, 35	mpbid 235	1 ⊢ (𝜑 → ((◡𝐶‘𝐵)𝐶𝐵 ∧ (◡𝐷‘(◡𝐶‘𝐵))𝐷(◡𝐶‘𝐵) ∧ 𝐴𝐸(◡𝐷‘(◡𝐶‘𝐵))))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ w3a 1103   class class class wbr 5111  ^◡ccnv 5662   ∘ ccom 5667  Rel wrel 5668   Fn wfn 6535  ⟶wf 6536  –1-1-onto→wf1o 6539  ‘cfv 6540

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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-sep 5259  ax-nul 5271  ax-pr 5406

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-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-br 5112  df-opab 5176  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548

This theorem is used by: (None)