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 45031
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 6837 . . . 4 (𝐷:𝑋–1-1-onto→𝑌 → ◡𝐷:𝑌–1-1-onto→𝑋)
3 f1ofn 6825 . . . 4 (◡𝐷:𝑌–1-1-onto→𝑋 → ◡𝐷 Fn 𝑌)
41, 2, 33syl 19 . . 3 (𝜑 → ◡𝐷 Fn 𝑌)
5 brco2f1o.c . . . 4 (𝜑 → 𝐶:𝑌–1-1-onto→𝑍)
6 f1ocnv 6837 . . . 4 (𝐶:𝑌–1-1-onto→𝑍 → ◡𝐶:𝑍–1-1-onto→𝑌)
7 f1of 6824 . . . 4 (◡𝐶:𝑍–1-1-onto→𝑌 → ◡𝐶:𝑍⟶𝑌)
85, 6, 73syl 19 . . 3 (𝜑 → ◡𝐶:𝑍⟶𝑌)
9 brco2f1o.r . . . 4 (𝜑 → 𝐴(𝐶 ∘ 𝐷)𝐵)
10 relco 6104 . . . . . 6 Rel (𝐶 ∘ 𝐷)
1110relbrcnv 6103 . . . . 5 (𝐵◡(𝐶 ∘ 𝐷)𝐴 ↔ 𝐴(𝐶 ∘ 𝐷)𝐵)
12 cnvco 5867 . . . . . 6 ◡(𝐶 ∘ 𝐷) = (◡𝐷 ∘ ◡𝐶)
1312breqi 5109 . . . . 5 (𝐵◡(𝐶 ∘ 𝐷)𝐴 ↔ 𝐵(◡𝐷 ∘ ◡𝐶)𝐴)
1411, 13bitr3i 280 . . . 4 (𝐴(𝐶 ∘ 𝐷)𝐵 ↔ 𝐵(◡𝐷 ∘ ◡𝐶)𝐴)
159, 14sylib 221 . . 3 (𝜑 → 𝐵(◡𝐷 ∘ ◡𝐶)𝐴)
164, 8, 15brcoffn 45029 . 2 (𝜑 → (𝐵◡𝐶(◡𝐶‘𝐵) ∧ (◡𝐶‘𝐵)◡𝐷𝐴))
17 f1orel 6827 . . . 4 (𝐶:𝑌–1-1-onto→𝑍 → Rel 𝐶)
18 relbrcnvg 6101 . . . 4 (Rel 𝐶 → (𝐵◡𝐶(◡𝐶‘𝐵) ↔ (◡𝐶‘𝐵)𝐶𝐵))
195, 17, 183syl 19 . . 3 (𝜑 → (𝐵◡𝐶(◡𝐶‘𝐵) ↔ (◡𝐶‘𝐵)𝐶𝐵))
20 f1orel 6827 . . . 4 (𝐷:𝑋–1-1-onto→𝑌 → Rel 𝐷)
21 relbrcnvg 6101 . . . 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 5103  ◡ccnv 5650   ∘ ccom 5655  Rel wrel 5656   Fn wfn 6533  ⟶wf 6534  –1-1-onto→wf1o 6537  ‘cfv 6538
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 2733  ax-sep 5249  ax-nul 5260  ax-pr 5391
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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  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 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 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator