Theorem brco2f1o 44873

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

Hypotheses

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

Assertion

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

Proof of Theorem brco2f1o

Step	Hyp	Ref	Expression
1		brco2f1o.d	. . . 4 ⊢ (𝜑 → 𝐷:𝑋–1-1-onto→𝑌)
2		f1ocnv 6831	. . . 4 ⊢ (𝐷:𝑋–1-1-onto→𝑌 → ◡𝐷:𝑌–1-1-onto→𝑋)
3		f1ofn 6819	. . . 4 ⊢ (◡𝐷:𝑌–1-1-onto→𝑋 → ◡𝐷 Fn 𝑌)
4	1, 2, 3	3syl 19	. . 3 ⊢ (𝜑 → ◡𝐷 Fn 𝑌)
5		brco2f1o.c	. . . 4 ⊢ (𝜑 → 𝐶:𝑌–1-1-onto→𝑍)
6		f1ocnv 6831	. . . 4 ⊢ (𝐶:𝑌–1-1-onto→𝑍 → ◡𝐶:𝑍–1-1-onto→𝑌)
7		f1of 6818	. . . 4 ⊢ (◡𝐶:𝑍–1-1-onto→𝑌 → ◡𝐶:𝑍⟶𝑌)
8	5, 6, 7	3syl 19	. . 3 ⊢ (𝜑 → ◡𝐶:𝑍⟶𝑌)
9		brco2f1o.r	. . . 4 ⊢ (𝜑 → 𝐴(𝐶 ∘ 𝐷)𝐵)
10		relco 6104	. . . . . 6 ⊢ Rel (𝐶 ∘ 𝐷)
11	10	relbrcnv 6103	. . . . 5 ⊢ (𝐵◡(𝐶 ∘ 𝐷)𝐴 ↔ 𝐴(𝐶 ∘ 𝐷)𝐵)
12		cnvco 5869	. . . . . 6 ⊢ ◡(𝐶 ∘ 𝐷) = (◡𝐷 ∘ ◡𝐶)
13	12	breqi 5109	. . . . 5 ⊢ (𝐵◡(𝐶 ∘ 𝐷)𝐴 ↔ 𝐵(◡𝐷 ∘ ◡𝐶)𝐴)
14	11, 13	bitr3i 280	. . . 4 ⊢ (𝐴(𝐶 ∘ 𝐷)𝐵 ↔ 𝐵(◡𝐷 ∘ ◡𝐶)𝐴)
15	9, 14	sylib 221	. . 3 ⊢ (𝜑 → 𝐵(◡𝐷 ∘ ◡𝐶)𝐴)
16	4, 8, 15	brcoffn 44871	. 2 ⊢ (𝜑 → (𝐵◡𝐶(◡𝐶‘𝐵) ∧ (◡𝐶‘𝐵)◡𝐷𝐴))
17		f1orel 6821	. . . 4 ⊢ (𝐶:𝑌–1-1-onto→𝑍 → Rel 𝐶)
18		relbrcnvg 6101	. . . 4 ⊢ (Rel 𝐶 → (𝐵◡𝐶(◡𝐶‘𝐵) ↔ (◡𝐶‘𝐵)𝐶𝐵))
19	5, 17, 18	3syl 19	. . 3 ⊢ (𝜑 → (𝐵◡𝐶(◡𝐶‘𝐵) ↔ (◡𝐶‘𝐵)𝐶𝐵))
20		f1orel 6821	. . . 4 ⊢ (𝐷:𝑋–1-1-onto→𝑌 → Rel 𝐷)
21		relbrcnvg 6101	. . . 4 ⊢ (Rel 𝐷 → ((◡𝐶‘𝐵)◡𝐷𝐴 ↔ 𝐴𝐷(◡𝐶‘𝐵)))
22	1, 20, 21	3syl 19	. . 3 ⊢ (𝜑 → ((◡𝐶‘𝐵)◡𝐷𝐴 ↔ 𝐴𝐷(◡𝐶‘𝐵)))
23	19, 22	anbi12d 644	. 2 ⊢ (𝜑 → ((𝐵◡𝐶(◡𝐶‘𝐵) ∧ (◡𝐶‘𝐵)◡𝐷𝐴) ↔ ((◡𝐶‘𝐵)𝐶𝐵 ∧ 𝐴𝐷(◡𝐶‘𝐵))))
24	16, 23	mpbid 235	1 ⊢ (𝜑 → ((◡𝐶‘𝐵)𝐶𝐵 ∧ 𝐴𝐷(◡𝐶‘𝐵)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   class class class wbr 5103  ^◡ccnv 5654   ∘ ccom 5659  Rel wrel 5660   Fn wfn 6528  ⟶wf 6529  –1-1-onto→wf1o 6532  ‘cfv 6533

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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-sep 5251  ax-nul 5263  ax-pr 5398

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 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541

This theorem is used by: (None)