Users' Mathboxes Mathbox for Richard Penner < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  brco2f1o Structured version   Visualization version   GIF version

Theorem brco2f1o 45169
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
StepHypRef Expression
1 brco2f1o.d . . . 4 (𝜑 → 𝐷:𝑋–1-1-onto→𝑌)
2 f1ocnv 6842 . . . 4 (𝐷:𝑋–1-1-onto→𝑌 → ◡𝐷:𝑌–1-1-onto→𝑋)
3 f1ofn 6830 . . . 4 (◡𝐷:𝑌–1-1-onto→𝑋 → ◡𝐷 Fn 𝑌)
41, 2, 33syl 19 . . 3 (𝜑 → ◡𝐷 Fn 𝑌)
5 brco2f1o.c . . . 4 (𝜑 → 𝐶:𝑌–1-1-onto→𝑍)
6 f1ocnv 6842 . . . 4 (𝐶:𝑌–1-1-onto→𝑍 → ◡𝐶:𝑍–1-1-onto→𝑌)
7 f1of 6829 . . . 4 (◡𝐶:𝑍–1-1-onto→𝑌 → ◡𝐶:𝑍⟶𝑌)
85, 6, 73syl 19 . . 3 (𝜑 → ◡𝐶:𝑍⟶𝑌)
9 brco2f1o.r . . . 4 (𝜑 → 𝐴(𝐶 ∘ 𝐷)𝐵)
10 relco 6106 . . . . . 6 Rel (𝐶 ∘ 𝐷)
1110relbrcnv 6105 . . . . 5 (𝐵◡(𝐶 ∘ 𝐷)𝐴 ↔ 𝐴(𝐶 ∘ 𝐷)𝐵)
12 cnvco 5868 . . . . . 6 ◡(𝐶 ∘ 𝐷) = (◡𝐷 ∘ ◡𝐶)
1312breqi 5108 . . . . 5 (𝐵◡(𝐶 ∘ 𝐷)𝐴 ↔ 𝐵(◡𝐷 ∘ ◡𝐶)𝐴)
1411, 13bitr3i 280 . . . 4 (𝐴(𝐶 ∘ 𝐷)𝐵 ↔ 𝐵(◡𝐷 ∘ ◡𝐶)𝐴)
159, 14sylib 221 . . 3 (𝜑 → 𝐵(◡𝐷 ∘ ◡𝐶)𝐴)
164, 8, 15brcoffn 45167 . 2 (𝜑 → (𝐵◡𝐶(◡𝐶‘𝐵) ∧ (◡𝐶‘𝐵)◡𝐷𝐴))
17 f1orel 6832 . . . 4 (𝐶:𝑌–1-1-onto→𝑍 → Rel 𝐶)
18 relbrcnvg 6103 . . . 4 (Rel 𝐶 → (𝐵◡𝐶(◡𝐶‘𝐵) ↔ (◡𝐶‘𝐵)𝐶𝐵))
195, 17, 183syl 19 . . 3 (𝜑 → (𝐵◡𝐶(◡𝐶‘𝐵) ↔ (◡𝐶‘𝐵)𝐶𝐵))
20 f1orel 6832 . . . 4 (𝐷:𝑋–1-1-onto→𝑌 → Rel 𝐷)
21 relbrcnvg 6103 . . . 4 (Rel 𝐷 → ((◡𝐶‘𝐵)◡𝐷𝐴 ↔ 𝐴𝐷(◡𝐶‘𝐵)))
221, 20, 213syl 19 . . 3 (𝜑 → ((◡𝐶‘𝐵)◡𝐷𝐴 ↔ 𝐴𝐷(◡𝐶‘𝐵)))
2319, 22anbi12d 644 . 2 (𝜑 → ((𝐵◡𝐶(◡𝐶‘𝐵) ∧ (◡𝐶‘𝐵)◡𝐷𝐴) ↔ ((◡𝐶‘𝐵)𝐶𝐵 ∧ 𝐴𝐷(◡𝐶‘𝐵))))
2416, 23mpbid 235 1 (𝜑 → ((◡𝐶‘𝐵)𝐶𝐵 ∧ 𝐴𝐷(◡𝐶‘𝐵)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   class class class wbr 5102  ◡ccnv 5650   ∘ ccom 5655  Rel wrel 5656   Fn wfn 6538  ⟶wf 6539  –1-1-onto→wf1o 6542  ‘cfv 6543
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5391
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  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-ss 3897  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-opab 5167  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6497  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator