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 45293
Description: Conditions allowing the decomposition of a binary relation. (Contributed by RP, 8-Jun-2021.)
Hypotheses
Ref Expression
brco2f1o.c (𝜑 → 𝐶:𝑌⟶1-1onto𝑍)
brco2f1o.d (𝜑 → 𝐷:𝑋⟶1-1onto𝑌)
brco2f1o.r (𝜑 → 𝐴(𝐶 ∘ 𝐷)𝐵)
Assertion
Ref Expression
brco2f1o (𝜑 → ((◡𝐶‘𝐵)𝐶𝐵 ∧ 𝐴𝐷(◡𝐶‘𝐵)))

Proof of Theorem brco2f1o
StepHypRef Expression
1 brco2f1o.d . . . 4 (𝜑 → 𝐷:𝑋⟶1-1onto𝑌)
2 f1ocnv 6867 . . . 4 (𝐷:𝑋⟶1-1onto𝑌 → ◡𝐷:𝑌⟶1-1onto𝑋)
3 f1ofn 6855 . . . 4 (◡𝐷:𝑌⟶1-1onto𝑋 → ◡𝐷 Fn 𝑌)
41, 2, 33syl 19 . . 3 (𝜑 → ◡𝐷 Fn 𝑌)
5 brco2f1o.c . . . 4 (𝜑 → 𝐶:𝑌⟶1-1onto𝑍)
6 f1ocnv 6867 . . . 4 (𝐶:𝑌⟶1-1onto𝑍 → ◡𝐶:𝑍⟶1-1onto𝑌)
7 f1of 6854 . . . 4 (◡𝐶:𝑍⟶1-1onto𝑌 → ◡𝐶:𝑍⟶𝑌)
85, 6, 73syl 19 . . 3 (𝜑 → ◡𝐶:𝑍⟶𝑌)
9 brco2f1o.r . . . 4 (𝜑 → 𝐴(𝐶 ∘ 𝐷)𝐵)
10 relco 6122 . . . . . 6 Rel (𝐶 ∘ 𝐷)
1110relbrcnv 6121 . . . . 5 (𝐵◡(𝐶 ∘ 𝐷)𝐴 ↔ 𝐴(𝐶 ∘ 𝐷)𝐵)
12 cnvco 5879 . . . . . 6 ◡(𝐶 ∘ 𝐷) = (◡𝐷 ∘ ◡𝐶)
1312breqi 5114 . . . . 5 (𝐵◡(𝐶 ∘ 𝐷)𝐴 ↔ 𝐵(◡𝐷 ∘ ◡𝐶)𝐴)
1411, 13bitr3i 280 . . . 4 (𝐴(𝐶 ∘ 𝐷)𝐵 ↔ 𝐵(◡𝐷 ∘ ◡𝐶)𝐴)
159, 14sylib 221 . . 3 (𝜑 → 𝐵(◡𝐷 ∘ ◡𝐶)𝐴)
164, 8, 15brcoffn 45291 . 2 (𝜑 → (𝐵◡𝐶(◡𝐶‘𝐵) ∧ (◡𝐶‘𝐵)◡𝐷𝐴))
17 f1orel 6857 . . . 4 (𝐶:𝑌⟶1-1onto𝑍 → Rel 𝐶)
18 relbrcnvg 6119 . . . 4 (Rel 𝐶 → (𝐵◡𝐶(◡𝐶‘𝐵) ↔ (◡𝐶‘𝐵)𝐶𝐵))
195, 17, 183syl 19 . . 3 (𝜑 → (𝐵◡𝐶(◡𝐶‘𝐵) ↔ (◡𝐶‘𝐵)𝐶𝐵))
20 f1orel 6857 . . . 4 (𝐷:𝑋⟶1-1onto𝑌 → Rel 𝐷)
21 relbrcnvg 6119 . . . 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 5108  ◡ccnv 5657   ∘ ccom 5662  Rel wrel 5663   Fn wfn 6561  ⟶wf 6562  ⟶1-1ontowf1o 6565  ‘cfv 6566
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator