Theorem fcoresf1ob 48416

Description: A composition is bijective iff the restriction of its first component to the minimum domain is bijective and the restriction of its second component to the minimum domain is injective. (Contributed by GL and AV, 7-Oct-2024.)

Hypotheses

Ref	Expression
fcores.f	⊢ (𝜑 → 𝐹:𝐴⟶𝐵)
fcores.e	⊢ 𝐸 = (ran 𝐹 ∩ 𝐶)
fcores.p	⊢ 𝑃 = (◡𝐹 “ 𝐶)
fcores.x	⊢ 𝑋 = (𝐹 ↾ 𝑃)
fcores.g	⊢ (𝜑 → 𝐺:𝐶⟶𝐷)
fcores.y	⊢ 𝑌 = (𝐺 ↾ 𝐸)

Assertion

Ref	Expression
fcoresf1ob	⊢ (𝜑 → ((𝐺 ∘ 𝐹):𝑃⟶1-1onto𝐷 ↔ (𝑋:𝑃⟶1-1𝐸 ∧ 𝑌:𝐸⟶1-1onto𝐷)))

Proof of Theorem fcoresf1ob

Step	Hyp	Ref	Expression
1		fcores.f	. . . . 5 ⊢ (𝜑 → 𝐹:𝐴⟶𝐵)
2		fcores.e	. . . . 5 ⊢ 𝐸 = (ran 𝐹 ∩ 𝐶)
3		fcores.p	. . . . 5 ⊢ 𝑃 = (◡𝐹 “ 𝐶)
4		fcores.x	. . . . 5 ⊢ 𝑋 = (𝐹 ↾ 𝑃)
5		fcores.g	. . . . 5 ⊢ (𝜑 → 𝐺:𝐶⟶𝐷)
6		fcores.y	. . . . 5 ⊢ 𝑌 = (𝐺 ↾ 𝐸)
7	1, 2, 3, 4, 5, 6	fcoresf1b 48413	. . . 4 ⊢ (𝜑 → ((𝐺 ∘ 𝐹):𝑃⟶1-1𝐷 ↔ (𝑋:𝑃⟶1-1𝐸 ∧ 𝑌:𝐸⟶1-1𝐷)))
8	1, 2, 3, 4, 5, 6	fcoresfob 48415	. . . 4 ⊢ (𝜑 → ((𝐺 ∘ 𝐹):𝑃⟶onto𝐷 ↔ 𝑌:𝐸⟶onto𝐷))
9	7, 8	anbi12d 644	. . 3 ⊢ (𝜑 → (((𝐺 ∘ 𝐹):𝑃⟶1-1𝐷 ∧ (𝐺 ∘ 𝐹):𝑃⟶onto𝐷) ↔ ((𝑋:𝑃⟶1-1𝐸 ∧ 𝑌:𝐸⟶1-1𝐷) ∧ 𝑌:𝐸⟶onto𝐷)))
10		anass 474	. . 3 ⊢ (((𝑋:𝑃⟶1-1𝐸 ∧ 𝑌:𝐸⟶1-1𝐷) ∧ 𝑌:𝐸⟶onto𝐷) ↔ (𝑋:𝑃⟶1-1𝐸 ∧ (𝑌:𝐸⟶1-1𝐷 ∧ 𝑌:𝐸⟶onto𝐷)))
11	9, 10	bitrdi 290	. 2 ⊢ (𝜑 → (((𝐺 ∘ 𝐹):𝑃⟶1-1𝐷 ∧ (𝐺 ∘ 𝐹):𝑃⟶onto𝐷) ↔ (𝑋:𝑃⟶1-1𝐸 ∧ (𝑌:𝐸⟶1-1𝐷 ∧ 𝑌:𝐸⟶onto𝐷))))
12		df-f1o 6573	. 2 ⊢ ((𝐺 ∘ 𝐹):𝑃⟶1-1onto𝐷 ↔ ((𝐺 ∘ 𝐹):𝑃⟶1-1𝐷 ∧ (𝐺 ∘ 𝐹):𝑃⟶onto𝐷))
13		df-f1o 6573	. . 3 ⊢ (𝑌:𝐸⟶1-1onto𝐷 ↔ (𝑌:𝐸⟶1-1𝐷 ∧ 𝑌:𝐸⟶onto𝐷))
14	13	anbi2i 635	. 2 ⊢ ((𝑋:𝑃⟶1-1𝐸 ∧ 𝑌:𝐸⟶1-1onto𝐷) ↔ (𝑋:𝑃⟶1-1𝐸 ∧ (𝑌:𝐸⟶1-1𝐷 ∧ 𝑌:𝐸⟶onto𝐷)))
15	11, 12, 14	3bitr4g 317	1 ⊢ (𝜑 → ((𝐺 ∘ 𝐹):𝑃⟶1-1onto𝐷 ↔ (𝑋:𝑃⟶1-1𝐸 ∧ 𝑌:𝐸⟶1-1onto𝐷)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∩ cin 4092  ^◡ccnv 5657  ran crn 5659   ↾ cres 5660   “ cima 5661   ∘ ccom 5662  ⟶wf 6562  ⟶1-1wf1 6563  ⟶ontowfo 6564  ⟶1-1ontowf1o 6565

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-sbc 3743  df-csb 3852  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-mpt 5193  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:  3f1oss1  48418