MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  dfiso3 Structured version   Visualization version   GIF version

Theorem dfiso3 17821
Description: Alternate definition of an isomorphism of a category as a section in both directions. (Contributed by AV, 11-Apr-2020.)
Hypotheses
Ref Expression
dfiso3.b 𝐵 = (Base‘𝐶)
dfiso3.h 𝐻 = (Hom ‘𝐶)
dfiso3.i 𝐼 = (Iso‘𝐶)
dfiso3.s 𝑆 = (Sect‘𝐶)
dfiso3.c (𝜑𝐶 ∈ Cat)
dfiso3.x (𝜑𝑋𝐵)
dfiso3.y (𝜑𝑌𝐵)
dfiso3.f (𝜑𝐹 ∈ (𝑋𝐻𝑌))
Assertion
Ref Expression
dfiso3 (𝜑 → (𝐹 ∈ (𝑋𝐼𝑌) ↔ ∃𝑔 ∈ (𝑌𝐻𝑋)(𝑔(𝑌𝑆𝑋)𝐹𝐹(𝑋𝑆𝑌)𝑔)))
Distinct variable groups:   𝐶,𝑔   𝑔,𝐹   𝑔,𝐻   𝑔,𝐼   𝑔,𝑋   𝑔,𝑌   𝜑,𝑔
Allowed substitution hints:   𝐵(𝑔)   𝑆(𝑔)

Proof of Theorem dfiso3
StepHypRef Expression
1 dfiso3.b . . 3 𝐵 = (Base‘𝐶)
2 dfiso3.h . . 3 𝐻 = (Hom ‘𝐶)
3 dfiso3.c . . 3 (𝜑𝐶 ∈ Cat)
4 dfiso3.i . . 3 𝐼 = (Iso‘𝐶)
5 dfiso3.x . . 3 (𝜑𝑋𝐵)
6 dfiso3.y . . 3 (𝜑𝑌𝐵)
7 dfiso3.f . . 3 (𝜑𝐹 ∈ (𝑋𝐻𝑌))
8 eqid 2735 . . 3 (Id‘𝐶) = (Id‘𝐶)
9 eqid 2735 . . 3 (⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋) = (⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)
10 eqid 2735 . . 3 (⟨𝑌, 𝑋⟩(comp‘𝐶)𝑌) = (⟨𝑌, 𝑋⟩(comp‘𝐶)𝑌)
111, 2, 3, 4, 5, 6, 7, 8, 9, 10dfiso2 17820 . 2 (𝜑 → (𝐹 ∈ (𝑋𝐼𝑌) ↔ ∃𝑔 ∈ (𝑌𝐻𝑋)((𝑔(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐹) = ((Id‘𝐶)‘𝑋) ∧ (𝐹(⟨𝑌, 𝑋⟩(comp‘𝐶)𝑌)𝑔) = ((Id‘𝐶)‘𝑌))))
12 eqid 2735 . . . . . 6 (comp‘𝐶) = (comp‘𝐶)
13 dfiso3.s . . . . . 6 𝑆 = (Sect‘𝐶)
143adantr 480 . . . . . 6 ((𝜑𝑔 ∈ (𝑌𝐻𝑋)) → 𝐶 ∈ Cat)
156adantr 480 . . . . . 6 ((𝜑𝑔 ∈ (𝑌𝐻𝑋)) → 𝑌𝐵)
165adantr 480 . . . . . 6 ((𝜑𝑔 ∈ (𝑌𝐻𝑋)) → 𝑋𝐵)
17 simpr 484 . . . . . 6 ((𝜑𝑔 ∈ (𝑌𝐻𝑋)) → 𝑔 ∈ (𝑌𝐻𝑋))
187adantr 480 . . . . . 6 ((𝜑𝑔 ∈ (𝑌𝐻𝑋)) → 𝐹 ∈ (𝑋𝐻𝑌))
191, 2, 12, 8, 13, 14, 15, 16, 17, 18issect2 17802 . . . . 5 ((𝜑𝑔 ∈ (𝑌𝐻𝑋)) → (𝑔(𝑌𝑆𝑋)𝐹 ↔ (𝐹(⟨𝑌, 𝑋⟩(comp‘𝐶)𝑌)𝑔) = ((Id‘𝐶)‘𝑌)))
201, 2, 12, 8, 13, 14, 16, 15, 18, 17issect2 17802 . . . . 5 ((𝜑𝑔 ∈ (𝑌𝐻𝑋)) → (𝐹(𝑋𝑆𝑌)𝑔 ↔ (𝑔(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐹) = ((Id‘𝐶)‘𝑋)))
2119, 20anbi12d 632 . . . 4 ((𝜑𝑔 ∈ (𝑌𝐻𝑋)) → ((𝑔(𝑌𝑆𝑋)𝐹𝐹(𝑋𝑆𝑌)𝑔) ↔ ((𝐹(⟨𝑌, 𝑋⟩(comp‘𝐶)𝑌)𝑔) = ((Id‘𝐶)‘𝑌) ∧ (𝑔(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐹) = ((Id‘𝐶)‘𝑋))))
22 ancom 460 . . . 4 (((𝐹(⟨𝑌, 𝑋⟩(comp‘𝐶)𝑌)𝑔) = ((Id‘𝐶)‘𝑌) ∧ (𝑔(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐹) = ((Id‘𝐶)‘𝑋)) ↔ ((𝑔(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐹) = ((Id‘𝐶)‘𝑋) ∧ (𝐹(⟨𝑌, 𝑋⟩(comp‘𝐶)𝑌)𝑔) = ((Id‘𝐶)‘𝑌)))
2321, 22bitr2di 288 . . 3 ((𝜑𝑔 ∈ (𝑌𝐻𝑋)) → (((𝑔(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐹) = ((Id‘𝐶)‘𝑋) ∧ (𝐹(⟨𝑌, 𝑋⟩(comp‘𝐶)𝑌)𝑔) = ((Id‘𝐶)‘𝑌)) ↔ (𝑔(𝑌𝑆𝑋)𝐹𝐹(𝑋𝑆𝑌)𝑔)))
2423rexbidva 3175 . 2 (𝜑 → (∃𝑔 ∈ (𝑌𝐻𝑋)((𝑔(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐹) = ((Id‘𝐶)‘𝑋) ∧ (𝐹(⟨𝑌, 𝑋⟩(comp‘𝐶)𝑌)𝑔) = ((Id‘𝐶)‘𝑌)) ↔ ∃𝑔 ∈ (𝑌𝐻𝑋)(𝑔(𝑌𝑆𝑋)𝐹𝐹(𝑋𝑆𝑌)𝑔)))
2511, 24bitrd 279 1 (𝜑 → (𝐹 ∈ (𝑋𝐼𝑌) ↔ ∃𝑔 ∈ (𝑌𝐻𝑋)(𝑔(𝑌𝑆𝑋)𝐹𝐹(𝑋𝑆𝑌)𝑔)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1537  wcel 2106  wrex 3068  cop 4637   class class class wbr 5148  cfv 6563  (class class class)co 7431  Basecbs 17245  Hom chom 17309  compcco 17310  Catccat 17709  Idccid 17710  Sectcsect 17792  Isociso 17794
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-ext 2706  ax-rep 5285  ax-sep 5302  ax-nul 5312  ax-pow 5371  ax-pr 5438  ax-un 7754
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-nf 1781  df-sb 2063  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2727  df-clel 2814  df-nfc 2890  df-ne 2939  df-ral 3060  df-rex 3069  df-reu 3379  df-rab 3434  df-v 3480  df-sbc 3792  df-csb 3909  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-nul 4340  df-if 4532  df-pw 4607  df-sn 4632  df-pr 4634  df-op 4638  df-uni 4913  df-iun 4998  df-br 5149  df-opab 5211  df-mpt 5232  df-id 5583  df-xp 5695  df-rel 5696  df-cnv 5697  df-co 5698  df-dm 5699  df-rn 5700  df-res 5701  df-ima 5702  df-iota 6516  df-fun 6565  df-fn 6566  df-f 6567  df-f1 6568  df-fo 6569  df-f1o 6570  df-fv 6571  df-ov 7434  df-oprab 7435  df-mpo 7436  df-1st 8013  df-2nd 8014  df-sect 17795  df-inv 17796  df-iso 17797
This theorem is referenced by:  thinciso  48861
  Copyright terms: Public domain W3C validator