HoTT.WildCat.Pullbacks.v.alectryon.json

Require Import Basics.Equivalences Basics.Overture Basics.Tactics Basics.Trunc.Require Import Basics.Equivalences Basics.Overture Basics.Tactics Basics.Trunc.
Require Import Limits.Pullback.
Require Import WildCat.Core WildCat.Equiv WildCat.EquivGpd.
Require Import WildCat.Universe WildCat.Yoneda WildCat.Graph WildCat.ZeroGroupoid.
Require Import WildCat.Induced.

(** * Categories with pullbacks *)

(** When [pb] is the source object in a commuting square, then for any object [z] we get a commuting square of 0-groupoids by applying the functor [z $-> -], which is [opyon_0gpd z].  Thus there is a natural map of 0-groupoids from [z $-> pb] to the 0-groupoid pullback of
<<
                      (z $-> b)
                          |
                          |
                          v
        (z $-> a) --> (z $-> c)
>>
In this diagram, the hom sets are regarded as 0-groupoids and the top-level arrows are morphisms of 0-groupoids (0-functors). *)

Definition cat_pb_corec_inv {A : Type} `{Is1Cat A}
  {a b c : A} (f : a $-> c) (g : b $-> c)
  (pb : A) (pra : pb $-> a) (prb : pb $-> b) (glue : f $o pra $== g $o prb)
  (z : A)
  : opyon_0gpd z pb $-> pullback_0gpd (fmap (opyon_0gpd z) f) (fmap (opyon_0gpd z) g).A: Type
IsGraph0: IsGraph A
Is2Graph0: Is2Graph A
Is01Cat0: Is01Cat A
H: Is1Cat A
a, b, c: A
f: a $-> c
g: b $-> c
pb: A
pra: pb $-> a
prb: pb $-> b
glue: f $o pra $== g $o prb
z: A
opyon_0gpd z pb $->
pullback_0gpd (fmap (opyon_0gpd z) f) (fmap (opyon_0gpd z) g)
Proof.A: Type
IsGraph0: IsGraph A
Is2Graph0: Is2Graph A
Is01Cat0: Is01Cat A
H: Is1Cat A
a, b, c: A
f: a $-> c
g: b $-> c
pb: A
pra: pb $-> a
prb: pb $-> b
glue: f $o pra $== g $o prb
z: A
opyon_0gpd z pb $->
pullback_0gpd (fmap (opyon_0gpd z) f) (fmap (opyon_0gpd z) g)
  snapply equiv_pullback_0gpd_corec.A: Type
IsGraph0: IsGraph A
Is2Graph0: Is2Graph A
Is01Cat0: Is01Cat A
H: Is1Cat A
a, b, c: A
f: a $-> c
g: b $-> c
pb: A
pra: pb $-> a
prb: pb $-> b
glue: f $o pra $== g $o prb
z: A
{f1 : opyon_0gpd z pb $-> opyon_0gpd z a &
{f2 : opyon_0gpd z pb $-> opyon_0gpd z b &
fmap (opyon_0gpd z) f $o f1 $== fmap (opyon_0gpd z) g $o f2}}
  exists (fmap _ pra).  (* The underscores are [opyon_0gpd z]. *)A: Type
IsGraph0: IsGraph A
Is2Graph0: Is2Graph A
Is01Cat0: Is01Cat A
H: Is1Cat A
a, b, c: A
f: a $-> c
g: b $-> c
pb: A
pra: pb $-> a
prb: pb $-> b
glue: f $o pra $== g $o prb
z: A
{f2 : opyon_0gpd z pb $-> opyon_0gpd z b &
fmap (opyon_0gpd z) f $o fmap (opyon_0gpd z) pra $==
fmap (opyon_0gpd z) g $o f2}
  exists (fmap _ prb).A: Type
IsGraph0: IsGraph A
Is2Graph0: Is2Graph A
Is01Cat0: Is01Cat A
H: Is1Cat A
a, b, c: A
f: a $-> c
g: b $-> c
pb: A
pra: pb $-> a
prb: pb $-> b
glue: f $o pra $== g $o prb
z: A
fmap (opyon_0gpd z) f $o fmap (opyon_0gpd z) pra $==
fmap (opyon_0gpd z) g $o fmap (opyon_0gpd z) prb
  refine ((fmap_comp _ pra f)^$ $@ _ $@ fmap_comp _ prb g).A: Type
IsGraph0: IsGraph A
Is2Graph0: Is2Graph A
Is01Cat0: Is01Cat A
H: Is1Cat A
a, b, c: A
f: a $-> c
g: b $-> c
pb: A
pra: pb $-> a
prb: pb $-> b
glue: f $o pra $== g $o prb
z: A
fmap (opyon_0gpd z) (f $o pra) $== fmap (opyon_0gpd z) (g $o prb)
  exact (fmap2 _ glue).
Defined.

(** A pullback is an object completing [f] and [g] to a commuting square such that the map above is an equivalence of 0-groupoids for each [z].  The name [Pullback] is used for the construction in Limits.Pullback, so we use CatPullback here. *)
Class CatPullback {A : Type} `{Is1Cat A} {a b c : A} (f : a $-> c) (g : b $-> c)
  := Build_CatPullback' {
    cat_pb : A;
    cat_pb_pr1 : cat_pb $-> a;
    cat_pb_pr2 : cat_pb $-> b;
    cat_pb_glue : f $o cat_pb_pr1 $== g $o cat_pb_pr2;
    cat_isequiv_cat_pullback_corec_inv
      :: forall z : A, CatIsEquiv (cat_pb_corec_inv f g
                                cat_pb cat_pb_pr1 cat_pb_pr2 cat_pb_glue z);
  }.

Arguments Build_CatPullback' {A IsGraph Is2Graph Is01Cat H a b c}
  f g cat_pb cat_pb_pr1 cat_pb_pr2 cat_pb_glue eq : rename.
Arguments cat_pb {A IsGraph Is2Graph Is01Cat H a b c} f g {pb} : rename.

Definition cate_pb_corec_inv {A : Type} `{Is1Cat A}
  {a b c : A} (f : a $-> c) (g : b $-> c)
  {pb : CatPullback f g}
  (z : A)
  : opyon_0gpd z (cat_pb _ _) $<~>
      pullback_0gpd (fmap (opyon_0gpd z) f) (fmap (opyon_0gpd z) g)
  := Build_CatEquiv _.

Definition cat_pb_corec {A : Type} `{Is1Cat A}
  {a b c : A} {f : a $-> c} {g : b $-> c}
  {pb : CatPullback f g} {z : A}
  (h : z $-> a) (k : z $-> b) (p : f $o h $== g $o k)
  : opyon_0gpd z (cat_pb f g).A: Type
IsGraph0: IsGraph A
Is2Graph0: Is2Graph A
Is01Cat0: Is01Cat A
H: Is1Cat A
a, b, c: A
f: a $-> c
g: b $-> c
pb: CatPullback f g
z: A
h: z $-> a
k: z $-> b
p: f $o h $== g $o k
opyon_0gpd z (cat_pb f g)
Proof.A: Type
IsGraph0: IsGraph A
Is2Graph0: Is2Graph A
Is01Cat0: Is01Cat A
H: Is1Cat A
a, b, c: A
f: a $-> c
g: b $-> c
pb: CatPullback f g
z: A
h: z $-> a
k: z $-> b
p: f $o h $== g $o k
opyon_0gpd z (cat_pb f g)
  apply (cate_pb_corec_inv f g z)^-1$.A: Type
IsGraph0: IsGraph A
Is2Graph0: Is2Graph A
Is01Cat0: Is01Cat A
H: Is1Cat A
a, b, c: A
f: a $-> c
g: b $-> c
pb: CatPullback f g
z: A
h: z $-> a
k: z $-> b
p: f $o h $== g $o k
zerogpd_graph (pullback_0gpd (fmap (opyon_0gpd z) f) (fmap (opyon_0gpd z) g))
  simpl.A: Type
IsGraph0: IsGraph A
Is2Graph0: Is2Graph A
Is01Cat0: Is01Cat A
H: Is1Cat A
a, b, c: A
f: a $-> c
g: b $-> c
pb: CatPullback f g
z: A
h: z $-> a
k: z $-> b
p: f $o h $== g $o k
{x : z $-> a & {y : z $-> b & cat_postcomp z f x $== cat_postcomp z g y}}
  exact (h; k; p).
Defined.

Definition cat_pb_corec_beta_pr1 {A : Type} `{Is1Cat A}
  {a b c : A} (f : a $-> c) (g : b $-> c)
  {pb : CatPullback f g} (z : A)
  (h : z $-> a) (k : z $-> b) (p : f $o h $== g $o k)
  : cat_pb_pr1 $o cat_pb_corec h k p $== h
  := fst (cate_isretr (cate_pb_corec_inv f g z) (h; k; p)).

Definition cat_pb_corec_beta_pr2 {A : Type} `{Is1Cat A}
  {a b c : A} (f : a $-> c) (g : b $-> c)
  {pb : CatPullback f g} (z : A)
  (h : z $-> a) (k : z $-> b) (p : f $o h $== g $o k)
  : cat_pb_pr2 $o cat_pb_corec h k p $== k
  := snd (cate_isretr (cate_pb_corec_inv f g z) (h; k; p)).

(** A convenience wrapper for building pullbacks. *)
(** TODO: maybe unbundle khp?  Or bundle them above to match? *)
Definition Build_CatPullback {A : Type} `{Is1Cat A} {a b c : A} (f : a $-> c) (g : b $-> c)
  (cat_pb : A) (cat_pb_pr1 : cat_pb $-> a) (cat_pb_pr2 : cat_pb $-> b)
  (cat_pb_glue : f $o cat_pb_pr1 $== g $o cat_pb_pr2)
  (cat_pb_corec : forall z : A,
      pullback_0gpd (fmap (opyon_0gpd z) f) (fmap (opyon_0gpd z) g) -> (z $-> cat_pb))
  (cat_pb_beta_pr1 : forall z khp, cat_pb_pr1 $o cat_pb_corec z khp $-> khp.1)
  (cat_pb_beta_pr2 : forall z khp, cat_pb_pr2 $o cat_pb_corec z khp $-> khp.2.1)
  (cat_pb_eta : forall z (k : z $-> cat_pb) (h : z $-> cat_pb)
                (p1 : cat_pb_pr1 $o k $== cat_pb_pr1 $o h)
                (p2 : cat_pb_pr2 $o k $== cat_pb_pr2 $o h), k $== h)
  : CatPullback f g.A: Type
IsGraph0: IsGraph A
Is2Graph0: Is2Graph A
Is01Cat0: Is01Cat A
H: Is1Cat A
a, b, c: A
f: a $-> c
g: b $-> c
cat_pb: A
cat_pb_pr1: cat_pb $-> a
cat_pb_pr2: cat_pb $-> b
cat_pb_glue: f $o cat_pb_pr1 $== g $o cat_pb_pr2
cat_pb_corec: forall z : A,
pullback_0gpd (fmap (opyon_0gpd z) f) (fmap (opyon_0gpd z) g) -> z $-> cat_pb
cat_pb_beta_pr1: forall (z : A)
(khp : pullback_0gpd (fmap (opyon_0gpd z) f) (fmap (opyon_0gpd z) g)),
cat_pb_pr1 $o cat_pb_corec z khp $-> khp.1
cat_pb_beta_pr2: forall (z : A)
(khp : pullback_0gpd (fmap (opyon_0gpd z) f) (fmap (opyon_0gpd z) g)),
cat_pb_pr2 $o cat_pb_corec z khp $-> (khp.2).1
cat_pb_eta: forall (z : A) (k h : z $-> cat_pb),
cat_pb_pr1 $o k $== cat_pb_pr1 $o h ->
cat_pb_pr2 $o k $== cat_pb_pr2 $o h -> k $== h
CatPullback f g
Proof.A: Type
IsGraph0: IsGraph A
Is2Graph0: Is2Graph A
Is01Cat0: Is01Cat A
H: Is1Cat A
a, b, c: A
f: a $-> c
g: b $-> c
cat_pb: A
cat_pb_pr1: cat_pb $-> a
cat_pb_pr2: cat_pb $-> b
cat_pb_glue: f $o cat_pb_pr1 $== g $o cat_pb_pr2
cat_pb_corec: forall z : A,
pullback_0gpd (fmap (opyon_0gpd z) f) (fmap (opyon_0gpd z) g) -> z $-> cat_pb
cat_pb_beta_pr1: forall (z : A)
(khp : pullback_0gpd (fmap (opyon_0gpd z) f) (fmap (opyon_0gpd z) g)),
cat_pb_pr1 $o cat_pb_corec z khp $-> khp.1
cat_pb_beta_pr2: forall (z : A)
(khp : pullback_0gpd (fmap (opyon_0gpd z) f) (fmap (opyon_0gpd z) g)),
cat_pb_pr2 $o cat_pb_corec z khp $-> (khp.2).1
cat_pb_eta: forall (z : A) (k h : z $-> cat_pb),
cat_pb_pr1 $o k $== cat_pb_pr1 $o h ->
cat_pb_pr2 $o k $== cat_pb_pr2 $o h -> k $== h
CatPullback f g
  snapply (Build_CatPullback' f g cat_pb cat_pb_pr1 cat_pb_pr2 cat_pb_glue).A: Type
IsGraph0: IsGraph A
Is2Graph0: Is2Graph A
Is01Cat0: Is01Cat A
H: Is1Cat A
a, b, c: A
f: a $-> c
g: b $-> c
cat_pb: A
cat_pb_pr1: cat_pb $-> a
cat_pb_pr2: cat_pb $-> b
cat_pb_glue: f $o cat_pb_pr1 $== g $o cat_pb_pr2
cat_pb_corec: forall z : A,
pullback_0gpd (fmap (opyon_0gpd z) f) (fmap (opyon_0gpd z) g) -> z $-> cat_pb
cat_pb_beta_pr1: forall (z : A)
(khp : pullback_0gpd (fmap (opyon_0gpd z) f) (fmap (opyon_0gpd z) g)),
cat_pb_pr1 $o cat_pb_corec z khp $-> khp.1
cat_pb_beta_pr2: forall (z : A)
(khp : pullback_0gpd (fmap (opyon_0gpd z) f) (fmap (opyon_0gpd z) g)),
cat_pb_pr2 $o cat_pb_corec z khp $-> (khp.2).1
cat_pb_eta: forall (z : A) (k h : z $-> cat_pb),
cat_pb_pr1 $o k $== cat_pb_pr1 $o h ->
cat_pb_pr2 $o k $== cat_pb_pr2 $o h -> k $== h
forall z : A,
CatIsEquiv (cat_pb_corec_inv f g cat_pb cat_pb_pr1 cat_pb_pr2 cat_pb_glue z)
  intros z.A: Type
IsGraph0: IsGraph A
Is2Graph0: Is2Graph A
Is01Cat0: Is01Cat A
H: Is1Cat A
a, b, c: A
f: a $-> c
g: b $-> c
cat_pb: A
cat_pb_pr1: cat_pb $-> a
cat_pb_pr2: cat_pb $-> b
cat_pb_glue: f $o cat_pb_pr1 $== g $o cat_pb_pr2
cat_pb_corec: forall z0 : A,
pullback_0gpd (fmap (opyon_0gpd z0) f) (fmap (opyon_0gpd z0) g) ->
z0 $-> cat_pb
cat_pb_beta_pr1: forall (z0 : A)
(khp : pullback_0gpd (fmap (opyon_0gpd z0) f) (fmap (opyon_0gpd z0) g)),
cat_pb_pr1 $o cat_pb_corec z0 khp $-> khp.1
cat_pb_beta_pr2: forall (z0 : A)
(khp : pullback_0gpd (fmap (opyon_0gpd z0) f) (fmap (opyon_0gpd z0) g)),
cat_pb_pr2 $o cat_pb_corec z0 khp $-> (khp.2).1
cat_pb_eta: forall (z0 : A) (k h : z0 $-> cat_pb),
cat_pb_pr1 $o k $== cat_pb_pr1 $o h ->
cat_pb_pr2 $o k $== cat_pb_pr2 $o h -> k $== h
z: A
CatIsEquiv (cat_pb_corec_inv f g cat_pb cat_pb_pr1 cat_pb_pr2 cat_pb_glue z)
  napply isequiv_0gpd_issurjinj.A: Type
IsGraph0: IsGraph A
Is2Graph0: Is2Graph A
Is01Cat0: Is01Cat A
H: Is1Cat A
a, b, c: A
f: a $-> c
g: b $-> c
cat_pb: A
cat_pb_pr1: cat_pb $-> a
cat_pb_pr2: cat_pb $-> b
cat_pb_glue: f $o cat_pb_pr1 $== g $o cat_pb_pr2
cat_pb_corec: forall z0 : A,
pullback_0gpd (fmap (opyon_0gpd z0) f) (fmap (opyon_0gpd z0) g) ->
z0 $-> cat_pb
cat_pb_beta_pr1: forall (z0 : A)
(khp : pullback_0gpd (fmap (opyon_0gpd z0) f) (fmap (opyon_0gpd z0) g)),
cat_pb_pr1 $o cat_pb_corec z0 khp $-> khp.1
cat_pb_beta_pr2: forall (z0 : A)
(khp : pullback_0gpd (fmap (opyon_0gpd z0) f) (fmap (opyon_0gpd z0) g)),
cat_pb_pr2 $o cat_pb_corec z0 khp $-> (khp.2).1
cat_pb_eta: forall (z0 : A) (k h : z0 $-> cat_pb),
cat_pb_pr1 $o k $== cat_pb_pr1 $o h ->
cat_pb_pr2 $o k $== cat_pb_pr2 $o h -> k $== h
z: A
IsSurjInj
  (FunctorCat.fun01_F
     (cat_pb_corec_inv f g cat_pb cat_pb_pr1 cat_pb_pr2 cat_pb_glue z))
  napply Build_IsSurjInj.A: Type
IsGraph0: IsGraph A
Is2Graph0: Is2Graph A
Is01Cat0: Is01Cat A
H: Is1Cat A
a, b, c: A
f: a $-> c
g: b $-> c
cat_pb: A
cat_pb_pr1: cat_pb $-> a
cat_pb_pr2: cat_pb $-> b
cat_pb_glue: f $o cat_pb_pr1 $== g $o cat_pb_pr2
cat_pb_corec: forall z0 : A,
pullback_0gpd (fmap (opyon_0gpd z0) f) (fmap (opyon_0gpd z0) g) ->
z0 $-> cat_pb
cat_pb_beta_pr1: forall (z0 : A)
(khp : pullback_0gpd (fmap (opyon_0gpd z0) f) (fmap (opyon_0gpd z0) g)),
cat_pb_pr1 $o cat_pb_corec z0 khp $-> khp.1
cat_pb_beta_pr2: forall (z0 : A)
(khp : pullback_0gpd (fmap (opyon_0gpd z0) f) (fmap (opyon_0gpd z0) g)),
cat_pb_pr2 $o cat_pb_corec z0 khp $-> (khp.2).1
cat_pb_eta: forall (z0 : A) (k h : z0 $-> cat_pb),
cat_pb_pr1 $o k $== cat_pb_pr1 $o h ->
cat_pb_pr2 $o k $== cat_pb_pr2 $o h -> k $== h
z: A
SplEssSurj
  (FunctorCat.fun01_F
     (cat_pb_corec_inv f g cat_pb cat_pb_pr1 cat_pb_pr2 cat_pb_glue z))
A: Type
IsGraph0: IsGraph A
Is2Graph0: Is2Graph A
Is01Cat0: Is01Cat A
H: Is1Cat A
a, b, c: A
f: a $-> c
g: b $-> c
cat_pb: A
cat_pb_pr1: cat_pb $-> a
cat_pb_pr2: cat_pb $-> b
cat_pb_glue: f $o cat_pb_pr1 $== g $o cat_pb_pr2
cat_pb_corec: forall z0 : A,
pullback_0gpd (fmap (opyon_0gpd z0) f) (fmap (opyon_0gpd z0) g) ->
z0 $-> cat_pb
cat_pb_beta_pr1: forall (z0 : A)
(khp : pullback_0gpd (fmap (opyon_0gpd z0) f) (fmap (opyon_0gpd z0) g)),
cat_pb_pr1 $o cat_pb_corec z0 khp $-> khp.1
cat_pb_beta_pr2: forall (z0 : A)
(khp : pullback_0gpd (fmap (opyon_0gpd z0) f) (fmap (opyon_0gpd z0) g)),
cat_pb_pr2 $o cat_pb_corec z0 khp $-> (khp.2).1
cat_pb_eta: forall (z0 : A) (k h : z0 $-> cat_pb),
cat_pb_pr1 $o k $== cat_pb_pr1 $o h ->
cat_pb_pr2 $o k $== cat_pb_pr2 $o h -> k $== h
z: A
forall x y : zerogpd_graph (opyon_0gpd z cat_pb),
FunctorCat.fun01_F
  (cat_pb_corec_inv f g cat_pb cat_pb_pr1 cat_pb_pr2 cat_pb_glue z) x $==
FunctorCat.fun01_F
  (cat_pb_corec_inv f g cat_pb cat_pb_pr1 cat_pb_pr2 cat_pb_glue z) y ->
x $== y
  -A: Type
IsGraph0: IsGraph A
Is2Graph0: Is2Graph A
Is01Cat0: Is01Cat A
H: Is1Cat A
a, b, c: A
f: a $-> c
g: b $-> c
cat_pb: A
cat_pb_pr1: cat_pb $-> a
cat_pb_pr2: cat_pb $-> b
cat_pb_glue: f $o cat_pb_pr1 $== g $o cat_pb_pr2
cat_pb_corec: forall z0 : A,
pullback_0gpd (fmap (opyon_0gpd z0) f) (fmap (opyon_0gpd z0) g) ->
z0 $-> cat_pb
cat_pb_beta_pr1: forall (z0 : A)
(khp : pullback_0gpd (fmap (opyon_0gpd z0) f) (fmap (opyon_0gpd z0) g)),
cat_pb_pr1 $o cat_pb_corec z0 khp $-> khp.1
cat_pb_beta_pr2: forall (z0 : A)
(khp : pullback_0gpd (fmap (opyon_0gpd z0) f) (fmap (opyon_0gpd z0) g)),
cat_pb_pr2 $o cat_pb_corec z0 khp $-> (khp.2).1
cat_pb_eta: forall (z0 : A) (k h : z0 $-> cat_pb),
cat_pb_pr1 $o k $== cat_pb_pr1 $o h ->
cat_pb_pr2 $o k $== cat_pb_pr2 $o h -> k $== h
z: A
SplEssSurj
  (FunctorCat.fun01_F
     (cat_pb_corec_inv f g cat_pb cat_pb_pr1 cat_pb_pr2 cat_pb_glue z)) intros khp.A: Type
IsGraph0: IsGraph A
Is2Graph0: Is2Graph A
Is01Cat0: Is01Cat A
H: Is1Cat A
a, b, c: A
f: a $-> c
g: b $-> c
cat_pb: A
cat_pb_pr1: cat_pb $-> a
cat_pb_pr2: cat_pb $-> b
cat_pb_glue: f $o cat_pb_pr1 $== g $o cat_pb_pr2
cat_pb_corec: forall z0 : A,
pullback_0gpd (fmap (opyon_0gpd z0) f) (fmap (opyon_0gpd z0) g) ->
z0 $-> cat_pb
cat_pb_beta_pr1: forall (z0 : A)
(khp0 : pullback_0gpd (fmap (opyon_0gpd z0) f) (fmap (opyon_0gpd z0) g)),
cat_pb_pr1 $o cat_pb_corec z0 khp0 $-> khp0.1
cat_pb_beta_pr2: forall (z0 : A)
(khp0 : pullback_0gpd (fmap (opyon_0gpd z0) f) (fmap (opyon_0gpd z0) g)),
cat_pb_pr2 $o cat_pb_corec z0 khp0 $-> (khp0.2).1
cat_pb_eta: forall (z0 : A) (k h : z0 $-> cat_pb),
cat_pb_pr1 $o k $== cat_pb_pr1 $o h ->
cat_pb_pr2 $o k $== cat_pb_pr2 $o h -> k $== h
z: A
khp: zerogpd_graph (pullback_0gpd (fmap (opyon_0gpd z) f) (fmap (opyon_0gpd z) g))
{a0 : zerogpd_graph (opyon_0gpd z cat_pb) &
FunctorCat.fun01_F
  (cat_pb_corec_inv f g cat_pb cat_pb_pr1 cat_pb_pr2 cat_pb_glue z) a0 $==
khp}
    exists (cat_pb_corec z khp).A: Type
IsGraph0: IsGraph A
Is2Graph0: Is2Graph A
Is01Cat0: Is01Cat A
H: Is1Cat A
a, b, c: A
f: a $-> c
g: b $-> c
cat_pb: A
cat_pb_pr1: cat_pb $-> a
cat_pb_pr2: cat_pb $-> b
cat_pb_glue: f $o cat_pb_pr1 $== g $o cat_pb_pr2
cat_pb_corec: forall z0 : A,
pullback_0gpd (fmap (opyon_0gpd z0) f) (fmap (opyon_0gpd z0) g) ->
z0 $-> cat_pb
cat_pb_beta_pr1: forall (z0 : A)
(khp0 : pullback_0gpd (fmap (opyon_0gpd z0) f) (fmap (opyon_0gpd z0) g)),
cat_pb_pr1 $o cat_pb_corec z0 khp0 $-> khp0.1
cat_pb_beta_pr2: forall (z0 : A)
(khp0 : pullback_0gpd (fmap (opyon_0gpd z0) f) (fmap (opyon_0gpd z0) g)),
cat_pb_pr2 $o cat_pb_corec z0 khp0 $-> (khp0.2).1
cat_pb_eta: forall (z0 : A) (k h : z0 $-> cat_pb),
cat_pb_pr1 $o k $== cat_pb_pr1 $o h ->
cat_pb_pr2 $o k $== cat_pb_pr2 $o h -> k $== h
z: A
khp: zerogpd_graph (pullback_0gpd (fmap (opyon_0gpd z) f) (fmap (opyon_0gpd z) g))
FunctorCat.fun01_F
  (cat_pb_corec_inv f g cat_pb cat_pb_pr1 cat_pb_pr2 cat_pb_glue z)
  (cat_pb_corec z khp) $==
khp
    exact (cat_pb_beta_pr1 z khp, cat_pb_beta_pr2 z khp).
  -A: Type
IsGraph0: IsGraph A
Is2Graph0: Is2Graph A
Is01Cat0: Is01Cat A
H: Is1Cat A
a, b, c: A
f: a $-> c
g: b $-> c
cat_pb: A
cat_pb_pr1: cat_pb $-> a
cat_pb_pr2: cat_pb $-> b
cat_pb_glue: f $o cat_pb_pr1 $== g $o cat_pb_pr2
cat_pb_corec: forall z0 : A,
pullback_0gpd (fmap (opyon_0gpd z0) f) (fmap (opyon_0gpd z0) g) ->
z0 $-> cat_pb
cat_pb_beta_pr1: forall (z0 : A)
(khp : pullback_0gpd (fmap (opyon_0gpd z0) f) (fmap (opyon_0gpd z0) g)),
cat_pb_pr1 $o cat_pb_corec z0 khp $-> khp.1
cat_pb_beta_pr2: forall (z0 : A)
(khp : pullback_0gpd (fmap (opyon_0gpd z0) f) (fmap (opyon_0gpd z0) g)),
cat_pb_pr2 $o cat_pb_corec z0 khp $-> (khp.2).1
cat_pb_eta: forall (z0 : A) (k h : z0 $-> cat_pb),
cat_pb_pr1 $o k $== cat_pb_pr1 $o h ->
cat_pb_pr2 $o k $== cat_pb_pr2 $o h -> k $== h
z: A
forall x y : zerogpd_graph (opyon_0gpd z cat_pb),
FunctorCat.fun01_F
  (cat_pb_corec_inv f g cat_pb cat_pb_pr1 cat_pb_pr2 cat_pb_glue z) x $==
FunctorCat.fun01_F
  (cat_pb_corec_inv f g cat_pb cat_pb_pr1 cat_pb_pr2 cat_pb_glue z) y ->
x $== y intros k h p.A: Type
IsGraph0: IsGraph A
Is2Graph0: Is2Graph A
Is01Cat0: Is01Cat A
H: Is1Cat A
a, b, c: A
f: a $-> c
g: b $-> c
cat_pb: A
cat_pb_pr1: cat_pb $-> a
cat_pb_pr2: cat_pb $-> b
cat_pb_glue: f $o cat_pb_pr1 $== g $o cat_pb_pr2
cat_pb_corec: forall z0 : A,
pullback_0gpd (fmap (opyon_0gpd z0) f) (fmap (opyon_0gpd z0) g) ->
z0 $-> cat_pb
cat_pb_beta_pr1: forall (z0 : A)
(khp : pullback_0gpd (fmap (opyon_0gpd z0) f) (fmap (opyon_0gpd z0) g)),
cat_pb_pr1 $o cat_pb_corec z0 khp $-> khp.1
cat_pb_beta_pr2: forall (z0 : A)
(khp : pullback_0gpd (fmap (opyon_0gpd z0) f) (fmap (opyon_0gpd z0) g)),
cat_pb_pr2 $o cat_pb_corec z0 khp $-> (khp.2).1
cat_pb_eta: forall (z0 : A) (k0 h0 : z0 $-> cat_pb),
cat_pb_pr1 $o k0 $== cat_pb_pr1 $o h0 ->
cat_pb_pr2 $o k0 $== cat_pb_pr2 $o h0 -> k0 $== h0
z: A
k, h: zerogpd_graph (opyon_0gpd z cat_pb)
p: FunctorCat.fun01_F
  (cat_pb_corec_inv f g cat_pb cat_pb_pr1 cat_pb_pr2 cat_pb_glue z) k $==
FunctorCat.fun01_F
  (cat_pb_corec_inv f g cat_pb cat_pb_pr1 cat_pb_pr2 cat_pb_glue z) h
k $== h
    exact (cat_pb_eta z k h (fst p) (snd p)).
Defined.

Class HasPullbacks (A : Type) `{Is1Cat A}
  := has_pullbacks :: forall {a b c} (f : a $-> c) (g : b $-> c), CatPullback f g.

(** ** Uniqueness of pullbacks *)

Definition compare_cat_pb {A : Type} `{Is1Cat A}
  {a b c : A} {f : a $-> c} {g : b $-> c}
  (pb1 pb2 : CatPullback f g)
  : pb1.(cat_pb _ _) $-> pb2.(cat_pb _ _)
  := cat_pb_corec pb1.(cat_pb_pr1) pb1.(cat_pb_pr2) pb1.(cat_pb_glue).

Definition compose_compare_cat_pb {A : Type} `{Is1Cat A}
  {a b c : A} {f : a $-> c} {g : b $-> c}
  (pb1 pb2 : CatPullback f g)
  : compare_cat_pb pb1 pb2 $o compare_cat_pb pb2 pb1 $== Id pb2.(cat_pb f g).A: Type
IsGraph0: IsGraph A
Is2Graph0: Is2Graph A
Is01Cat0: Is01Cat A
H: Is1Cat A
a, b, c: A
f: a $-> c
g: b $-> c
pb1, pb2: CatPullback f g
compare_cat_pb pb1 pb2 $o compare_cat_pb pb2 pb1 $== Id (cat_pb f g)
Proof.A: Type
IsGraph0: IsGraph A
Is2Graph0: Is2Graph A
Is01Cat0: Is01Cat A
H: Is1Cat A
a, b, c: A
f: a $-> c
g: b $-> c
pb1, pb2: CatPullback f g
compare_cat_pb pb1 pb2 $o compare_cat_pb pb2 pb1 $== Id (cat_pb f g)
  apply (isinj_equiv_0gpd (cate_pb_corec_inv f g _)).A: Type
IsGraph0: IsGraph A
Is2Graph0: Is2Graph A
Is01Cat0: Is01Cat A
H: Is1Cat A
a, b, c: A
f: a $-> c
g: b $-> c
pb1, pb2: CatPullback f g
equiv_fun_0gpd (cate_pb_corec_inv f g (cat_pb f g))
  (compare_cat_pb pb1 pb2 $o compare_cat_pb pb2 pb1) $==
equiv_fun_0gpd (cate_pb_corec_inv f g (cat_pb f g)) (Id (cat_pb f g))
  simpl; unfold cat_postcomp.A: Type
IsGraph0: IsGraph A
Is2Graph0: Is2Graph A
Is01Cat0: Is01Cat A
H: Is1Cat A
a, b, c: A
f: a $-> c
g: b $-> c
pb1, pb2: CatPullback f g
(cat_pb_pr1 $o (compare_cat_pb pb1 pb2 $o compare_cat_pb pb2 pb1) $->
 cat_pb_pr1 $o Id (cat_pb f g)) *
(cat_pb_pr2 $o (compare_cat_pb pb1 pb2 $o compare_cat_pb pb2 pb1) $->
 cat_pb_pr2 $o Id (cat_pb f g))
  split.A: Type
IsGraph0: IsGraph A
Is2Graph0: Is2Graph A
Is01Cat0: Is01Cat A
H: Is1Cat A
a, b, c: A
f: a $-> c
g: b $-> c
pb1, pb2: CatPullback f g
cat_pb_pr1 $o (compare_cat_pb pb1 pb2 $o compare_cat_pb pb2 pb1) $->
cat_pb_pr1 $o Id (cat_pb f g)
A: Type
IsGraph0: IsGraph A
Is2Graph0: Is2Graph A
Is01Cat0: Is01Cat A
H: Is1Cat A
a, b, c: A
f: a $-> c
g: b $-> c
pb1, pb2: CatPullback f g
cat_pb_pr2 $o (compare_cat_pb pb1 pb2 $o compare_cat_pb pb2 pb1) $->
cat_pb_pr2 $o Id (cat_pb f g)
  -A: Type
IsGraph0: IsGraph A
Is2Graph0: Is2Graph A
Is01Cat0: Is01Cat A
H: Is1Cat A
a, b, c: A
f: a $-> c
g: b $-> c
pb1, pb2: CatPullback f g
cat_pb_pr1 $o (compare_cat_pb pb1 pb2 $o compare_cat_pb pb2 pb1) $->
cat_pb_pr1 $o Id (cat_pb f g) refine (cat_assoc_opp _ _ _ $@ _ $@ (cat_idr _)^$).A: Type
IsGraph0: IsGraph A
Is2Graph0: Is2Graph A
Is01Cat0: Is01Cat A
H: Is1Cat A
a, b, c: A
f: a $-> c
g: b $-> c
pb1, pb2: CatPullback f g
cat_pb_pr1 $o compare_cat_pb pb1 pb2 $o compare_cat_pb pb2 pb1 $== cat_pb_pr1
    refine ((cat_pb_corec_beta_pr1 _ _ _ _ _ _ $@R _) $@ _).A: Type
IsGraph0: IsGraph A
Is2Graph0: Is2Graph A
Is01Cat0: Is01Cat A
H: Is1Cat A
a, b, c: A
f: a $-> c
g: b $-> c
pb1, pb2: CatPullback f g
cat_pb_pr1 $o compare_cat_pb pb2 pb1 $== cat_pb_pr1
    apply cat_pb_corec_beta_pr1.
  -A: Type
IsGraph0: IsGraph A
Is2Graph0: Is2Graph A
Is01Cat0: Is01Cat A
H: Is1Cat A
a, b, c: A
f: a $-> c
g: b $-> c
pb1, pb2: CatPullback f g
cat_pb_pr2 $o (compare_cat_pb pb1 pb2 $o compare_cat_pb pb2 pb1) $->
cat_pb_pr2 $o Id (cat_pb f g) refine (cat_assoc_opp _ _ _ $@ _ $@ (cat_idr _)^$).A: Type
IsGraph0: IsGraph A
Is2Graph0: Is2Graph A
Is01Cat0: Is01Cat A
H: Is1Cat A
a, b, c: A
f: a $-> c
g: b $-> c
pb1, pb2: CatPullback f g
cat_pb_pr2 $o compare_cat_pb pb1 pb2 $o compare_cat_pb pb2 pb1 $== cat_pb_pr2
    refine ((cat_pb_corec_beta_pr2 _ _ _ _ _ _ $@R _) $@ _).A: Type
IsGraph0: IsGraph A
Is2Graph0: Is2Graph A
Is01Cat0: Is01Cat A
H: Is1Cat A
a, b, c: A
f: a $-> c
g: b $-> c
pb1, pb2: CatPullback f g
cat_pb_pr2 $o compare_cat_pb pb2 pb1 $== cat_pb_pr2
    apply cat_pb_corec_beta_pr2.
Defined.

Definition catie_compare_cat_pb {A : Type} `{Is1Cat A} `{!HasEquivs A}
  {a b c : A} (f : a $-> c) (g : b $-> c)
  (pb1 pb2 : CatPullback f g)
  : CatIsEquiv (compare_cat_pb pb1 pb2).A: Type
IsGraph0: IsGraph A
Is2Graph0: Is2Graph A
Is01Cat0: Is01Cat A
H: Is1Cat A
HasEquivs0: HasEquivs A
a, b, c: A
f: a $-> c
g: b $-> c
pb1, pb2: CatPullback f g
CatIsEquiv (compare_cat_pb pb1 pb2)
Proof.A: Type
IsGraph0: IsGraph A
Is2Graph0: Is2Graph A
Is01Cat0: Is01Cat A
H: Is1Cat A
HasEquivs0: HasEquivs A
a, b, c: A
f: a $-> c
g: b $-> c
pb1, pb2: CatPullback f g
CatIsEquiv (compare_cat_pb pb1 pb2)
  srapply catie_adjointify.A: Type
IsGraph0: IsGraph A
Is2Graph0: Is2Graph A
Is01Cat0: Is01Cat A
H: Is1Cat A
HasEquivs0: HasEquivs A
a, b, c: A
f: a $-> c
g: b $-> c
pb1, pb2: CatPullback f g
cat_pb f g $-> cat_pb f g
A: Type
IsGraph0: IsGraph A
Is2Graph0: Is2Graph A
Is01Cat0: Is01Cat A
H: Is1Cat A
HasEquivs0: HasEquivs A
a, b, c: A
f: a $-> c
g: b $-> c
pb1, pb2: CatPullback f g
compare_cat_pb pb1 pb2 $o ?g $== Id (cat_pb f g)
A: Type
IsGraph0: IsGraph A
Is2Graph0: Is2Graph A
Is01Cat0: Is01Cat A
H: Is1Cat A
HasEquivs0: HasEquivs A
a, b, c: A
f: a $-> c
g: b $-> c
pb1, pb2: CatPullback f g
?g $o compare_cat_pb pb1 pb2 $== Id (cat_pb f g)
  1: exact (compare_cat_pb pb2 pb1).A: Type
IsGraph0: IsGraph A
Is2Graph0: Is2Graph A
Is01Cat0: Is01Cat A
H: Is1Cat A
HasEquivs0: HasEquivs A
a, b, c: A
f: a $-> c
g: b $-> c
pb1, pb2: CatPullback f g
compare_cat_pb pb1 pb2 $o compare_cat_pb pb2 pb1 $== Id (cat_pb f g)
A: Type
IsGraph0: IsGraph A
Is2Graph0: Is2Graph A
Is01Cat0: Is01Cat A
H: Is1Cat A
HasEquivs0: HasEquivs A
a, b, c: A
f: a $-> c
g: b $-> c
pb1, pb2: CatPullback f g
compare_cat_pb pb2 pb1 $o compare_cat_pb pb1 pb2 $== Id (cat_pb f g)
  all: apply compose_compare_cat_pb.
Defined.

(** ** Symmetry of pullbacks *)

Definition flip_cat_pb_corec_inv {A : Type} `{Is1Cat A}
  {a b c : A} (f : a $-> c) (g : b $-> c)
  (pb : A) (pra : pb $-> a) (prb : pb $-> b) (glue : f $o pra $== g $o prb)
  (z : A)
  : cate_flip_pullback_0gpd _ _ $o
      cat_pb_corec_inv f g pb pra prb glue z $==
      cat_pb_corec_inv g f pb prb pra (glue^$) z.A: Type
IsGraph0: IsGraph A
Is2Graph0: Is2Graph A
Is01Cat0: Is01Cat A
H: Is1Cat A
a, b, c: A
f: a $-> c
g: b $-> c
pb: A
pra: pb $-> a
prb: pb $-> b
glue: f $o pra $== g $o prb
z: A
cate_flip_pullback_0gpd (fmap (opyon_0gpd z) f) (fmap (opyon_0gpd z) g) $o
cat_pb_corec_inv f g pb pra prb glue z $==
cat_pb_corec_inv g f pb prb pra glue^$ z
Proof.A: Type
IsGraph0: IsGraph A
Is2Graph0: Is2Graph A
Is01Cat0: Is01Cat A
H: Is1Cat A
a, b, c: A
f: a $-> c
g: b $-> c
pb: A
pra: pb $-> a
prb: pb $-> b
glue: f $o pra $== g $o prb
z: A
cate_flip_pullback_0gpd (fmap (opyon_0gpd z) f) (fmap (opyon_0gpd z) g) $o
cat_pb_corec_inv f g pb pra prb glue z $==
cat_pb_corec_inv g f pb prb pra glue^$ z
  intro h; cbn.A: Type
IsGraph0: IsGraph A
Is2Graph0: Is2Graph A
Is01Cat0: Is01Cat A
H: Is1Cat A
a, b, c: A
f: a $-> c
g: b $-> c
pb: A
pra: pb $-> a
prb: pb $-> b
glue: f $o pra $== g $o prb
z: A
h: zerogpd_graph (opyon_0gpd z pb)
(cat_postcomp z prb h $-> cat_postcomp z prb h) *
(cat_postcomp z pra h $-> cat_postcomp z pra h)
  split; reflexivity.
Defined.

Definition flip_cat_pb {A : Type} `{Is1Cat A}
  {a b c : A} (f : a $-> c) (g : b $-> c)
  (pb : CatPullback f g)
  : CatPullback g f.A: Type
IsGraph0: IsGraph A
Is2Graph0: Is2Graph A
Is01Cat0: Is01Cat A
H: Is1Cat A
a, b, c: A
f: a $-> c
g: b $-> c
pb: CatPullback f g
CatPullback g f
Proof.A: Type
IsGraph0: IsGraph A
Is2Graph0: Is2Graph A
Is01Cat0: Is01Cat A
H: Is1Cat A
a, b, c: A
f: a $-> c
g: b $-> c
pb: CatPullback f g
CatPullback g f
  napply (Build_CatPullback' g f).A: Type
IsGraph0: IsGraph A
Is2Graph0: Is2Graph A
Is01Cat0: Is01Cat A
H: Is1Cat A
a, b, c: A
f: a $-> c
g: b $-> c
pb: CatPullback f g
forall z : A, CatIsEquiv (cat_pb_corec_inv g f ?Goal ?Goal0 ?Goal1 ?Goal2 z)
  intro z.A: Type
IsGraph0: IsGraph A
Is2Graph0: Is2Graph A
Is01Cat0: Is01Cat A
H: Is1Cat A
a, b, c: A
f: a $-> c
g: b $-> c
pb: CatPullback f g
z: A
CatIsEquiv (cat_pb_corec_inv g f ?Goal ?Goal0 ?Goal1 ?Goal2 z)
  rapply (catie_homotopic _ (flip_cat_pb_corec_inv f g _ _ _ _ z)).
Defined.

Definition flip_cat_pb_pr1_pr2 {A : Type} `{Is1Cat A}
  {a b c : A} (f : a $-> c) (g : b $-> c)
  (pb : CatPullback f g)
  : (flip_cat_pb f g pb).(cat_pb_pr1) $== cat_pb_pr2
  := Id _.

Definition flip_pullback_pr2_pr1 {A : Type} `{Is1Cat A}
  {a b c : A} (f : a $-> c) (g : b $-> c)
  (pb : CatPullback f g)
  : (flip_cat_pb f g pb).(cat_pb_pr2) $== cat_pb_pr1
  := Id _.

(** ** Pullbacks in induced wild categories *)

Section Induced.

  (** If the 1-category structure on [A] is induced from that on [B] along a map [F], the pullback of [F f] and [F g] exists in [B], and that pullback object is in the image of [F], then the preimage is also a pullback.  Typically this will be applied with [h] being [idpath], but it would be awkward to state this lemma assuming that. *)
  Instance cat_pb_induced {A B} `{Is1Cat B}
    (F : A -> B)
    {a b c : A} (f : F a $-> F c) (g : F b $-> F c)
    {p : CatPullback f g}
    (q : A) (h : F q = cat_pb f g)
    : CatPullback (A:=A) (H:=is1cat_induced F) f g.A, B: Type
IsGraph0: IsGraph B
Is2Graph0: Is2Graph B
Is01Cat0: Is01Cat B
H: Is1Cat B
F: A -> B
a, b, c: A
f: F a $-> F c
g: F b $-> F c
p: CatPullback f g
q: A
h: F q = cat_pb f g
CatPullback f g
  Proof.A, B: Type
IsGraph0: IsGraph B
Is2Graph0: Is2Graph B
Is01Cat0: Is01Cat B
H: Is1Cat B
F: A -> B
a, b, c: A
f: F a $-> F c
g: F b $-> F c
p: CatPullback f g
q: A
h: F q = cat_pb f g
CatPullback f g
    destruct p as [pb pr1 pr2 glue iseq].A, B: Type
IsGraph0: IsGraph B
Is2Graph0: Is2Graph B
Is01Cat0: Is01Cat B
H: Is1Cat B
F: A -> B
a, b, c: A
f: F a $-> F c
g: F b $-> F c
pb: B
pr1: pb $-> F a
pr2: pb $-> F b
glue: f $o pr1 $== g $o pr2
iseq: forall z : B, CatIsEquiv (cat_pb_corec_inv f g pb pr1 pr2 glue z)
q: A
h: F q = cat_pb f g
CatPullback f g
    unfold cat_pb in h; destruct h.A, B: Type
IsGraph0: IsGraph B
Is2Graph0: Is2Graph B
Is01Cat0: Is01Cat B
H: Is1Cat B
F: A -> B
a, b, c: A
f: F a $-> F c
g: F b $-> F c
q: A
pr1: F q $-> F a
pr2: F q $-> F b
glue: f $o pr1 $== g $o pr2
iseq: forall z : B, CatIsEquiv (cat_pb_corec_inv f g (F q) pr1 pr2 glue z)
CatPullback f g
    exact (Build_CatPullback' (H:=is1cat_induced F) f g q pr1 pr2 glue (iseq o F)).
  Defined.

  Instance haspullbacks_induced {A B} `{HasPullbacks B}
    (F : A -> B)
    (K : forall (a b c : A) (f : F a $-> F c) (g : F b $-> F c), exists q, F q = cat_pb f g)
    : HasPullbacks A (H:=is1cat_induced F).A, B: Type
IsGraph0: IsGraph B
Is2Graph0: Is2Graph B
Is01Cat0: Is01Cat B
H: Is1Cat B
H0: HasPullbacks B
F: A -> B
K: forall (a b c : A) (f : F a $-> F c) (g : F b $-> F c),
{q : A & F q = cat_pb f g}
HasPullbacks A
  Proof.A, B: Type
IsGraph0: IsGraph B
Is2Graph0: Is2Graph B
Is01Cat0: Is01Cat B
H: Is1Cat B
H0: HasPullbacks B
F: A -> B
K: forall (a b c : A) (f : F a $-> F c) (g : F b $-> F c),
{q : A & F q = cat_pb f g}
HasPullbacks A
    intros a b c f g.A, B: Type
IsGraph0: IsGraph B
Is2Graph0: Is2Graph B
Is01Cat0: Is01Cat B
H: Is1Cat B
H0: HasPullbacks B
F: A -> B
K: forall (a0 b0 c0 : A) (f0 : F a0 $-> F c0) (g0 : F b0 $-> F c0),
{q : A & F q = cat_pb f0 g0}
a, b, c: A
f: a $-> c
g: b $-> c
CatPullback f g
    destruct (K a b c f g) as [q h].A, B: Type
IsGraph0: IsGraph B
Is2Graph0: Is2Graph B
Is01Cat0: Is01Cat B
H: Is1Cat B
H0: HasPullbacks B
F: A -> B
K: forall (a0 b0 c0 : A) (f0 : F a0 $-> F c0) (g0 : F b0 $-> F c0),
{q0 : A & F q0 = cat_pb f0 g0}
a, b, c: A
f: a $-> c
g: b $-> c
q: A
h: F q = cat_pb f g
CatPullback f g
    exact (cat_pb_induced F f g q h).
  Defined.

End Induced.

(** ** Examples *)

(** These examples are here for dependency reasons. *)

(** *** Pullbacks in Type *)

(** Because these are 1-categorical pullbacks, the standard pullbacks of types only satisfy our definition when the corner type is 0-truncated.  It is unlikely that general diagrams have 1-pullbacks. *)

Instance haspullbacks_type {A B C : Type} `{IsTrunc 0 C}
  (f : A $-> C) (g : B $-> C)
  : CatPullback f g.A, B, C: Type
IsTrunc0: IsHSet C
f: A $-> C
g: B $-> C
CatPullback f g
Proof.A, B, C: Type
IsTrunc0: IsHSet C
f: A $-> C
g: B $-> C
CatPullback f g
  snapply (Build_CatPullback f g (Pullback f g) pullback_pr1 pullback_pr2).A, B, C: Type
IsTrunc0: IsHSet C
f: A $-> C
g: B $-> C
f $o pullback_pr1 $== g $o pullback_pr2
A, B, C: Type
IsTrunc0: IsHSet C
f: A $-> C
g: B $-> C
forall z : Type,
pullback_0gpd (fmap (opyon_0gpd z) f) (fmap (opyon_0gpd z) g) ->
z $-> Pullback f g
A, B, C: Type
IsTrunc0: IsHSet C
f: A $-> C
g: B $-> C
forall (z : Type)
(khp : pullback_0gpd (fmap (opyon_0gpd z) f) (fmap (opyon_0gpd z) g)),
pullback_pr1 $o ?cat_pb_corec z khp $-> khp.1
A, B, C: Type
IsTrunc0: IsHSet C
f: A $-> C
g: B $-> C
forall (z : Type)
(khp : pullback_0gpd (fmap (opyon_0gpd z) f) (fmap (opyon_0gpd z) g)),
pullback_pr2 $o ?cat_pb_corec z khp $-> (khp.2).1
A, B, C: Type
IsTrunc0: IsHSet C
f: A $-> C
g: B $-> C
forall (z : Type) (k h : z $-> Pullback f g),
pullback_pr1 $o k $== pullback_pr1 $o h ->
pullback_pr2 $o k $== pullback_pr2 $o h -> k $== h
  -A, B, C: Type
IsTrunc0: IsHSet C
f: A $-> C
g: B $-> C
f $o pullback_pr1 $== g $o pullback_pr2 apply pullback_commsq.
  -A, B, C: Type
IsTrunc0: IsHSet C
f: A $-> C
g: B $-> C
forall z : Type,
pullback_0gpd (fmap (opyon_0gpd z) f) (fmap (opyon_0gpd z) g) ->
z $-> Pullback f g intros Z khp.A, B, C: Type
IsTrunc0: IsHSet C
f: A $-> C
g: B $-> C
Z: Type
khp: pullback_0gpd (fmap (opyon_0gpd Z) f) (fmap (opyon_0gpd Z) g)
Z $-> Pullback f g
    exact (pullback_corec_uncurried f g khp).
  -A, B, C: Type
IsTrunc0: IsHSet C
f: A $-> C
g: B $-> C
forall (z : Type)
(khp : pullback_0gpd (fmap (opyon_0gpd z) f) (fmap (opyon_0gpd z) g)),
pullback_pr1 $o
(fun (Z : Type)
   (khp0 : pullback_0gpd (fmap (opyon_0gpd Z) f) (fmap (opyon_0gpd Z) g)) =>
 pullback_corec_uncurried f g khp0) z khp $->
khp.1 reflexivity.
  -A, B, C: Type
IsTrunc0: IsHSet C
f: A $-> C
g: B $-> C
forall (z : Type)
(khp : pullback_0gpd (fmap (opyon_0gpd z) f) (fmap (opyon_0gpd z) g)),
pullback_pr2 $o
(fun (Z : Type)
   (khp0 : pullback_0gpd (fmap (opyon_0gpd Z) f) (fmap (opyon_0gpd Z) g)) =>
 pullback_corec_uncurried f g khp0) z khp $->
(khp.2).1 reflexivity.
  -A, B, C: Type
IsTrunc0: IsHSet C
f: A $-> C
g: B $-> C
forall (z : Type) (k h : z $-> Pullback f g),
pullback_pr1 $o k $== pullback_pr1 $o h ->
pullback_pr2 $o k $== pullback_pr2 $o h -> k $== h intros Z k h p1 p2.A, B, C: Type
IsTrunc0: IsHSet C
f: A $-> C
g: B $-> C
Z: Type
k, h: Z $-> Pullback f g
p1: pullback_pr1 $o k $== pullback_pr1 $o h
p2: pullback_pr2 $o k $== pullback_pr2 $o h
k $== h
    srapply (pullback_homotopic k h p1 p2).A, B, C: Type
IsTrunc0: IsHSet C
f: A $-> C
g: B $-> C
Z: Type
k, h: Z $-> Pullback f g
p1: pullback_pr1 $o k $== pullback_pr1 $o h
p2: pullback_pr2 $o k $== pullback_pr2 $o h
forall a : Z, ap f (p1 a) @ ((h a).2).2 = ((k a).2).2 @ ap g (p2 a)
    intro z.A, B, C: Type
IsTrunc0: IsHSet C
f: A $-> C
g: B $-> C
Z: Type
k, h: Z $-> Pullback f g
p1: pullback_pr1 $o k $== pullback_pr1 $o h
p2: pullback_pr2 $o k $== pullback_pr2 $o h
z: Z
ap f (p1 z) @ ((h z).2).2 = ((k z).2).2 @ ap g (p2 z)
    apply path_ishprop. (* Here we use that [C] is 0-truncated. *)
Defined.

(** *** Pullbacks in ZeroGpd *)

Instance haspullbacks_0gpd : HasPullbacks ZeroGpd.HasPullbacks ZeroGpd
Proof.HasPullbacks ZeroGpd
  intros G H K f g.G, H, K: ZeroGpd
f: G $-> K
g: H $-> K
CatPullback f g
  snapply (Build_CatPullback f g (pullback_0gpd f g)
             (pullback_0gpd_pr1 f g) (pullback_0gpd_pr2 f g) (pullback_0gpd_glue f g)).G, H, K: ZeroGpd
f: G $-> K
g: H $-> K
forall z : ZeroGpd,
pullback_0gpd (fmap (opyon_0gpd z) f) (fmap (opyon_0gpd z) g) ->
z $-> pullback_0gpd f g
G, H, K: ZeroGpd
f: G $-> K
g: H $-> K
forall (z : ZeroGpd)
(khp : pullback_0gpd (fmap (opyon_0gpd z) f) (fmap (opyon_0gpd z) g)),
pullback_0gpd_pr1 f g $o ?cat_pb_corec z khp $-> khp.1
G, H, K: ZeroGpd
f: G $-> K
g: H $-> K
forall (z : ZeroGpd)
(khp : pullback_0gpd (fmap (opyon_0gpd z) f) (fmap (opyon_0gpd z) g)),
pullback_0gpd_pr2 f g $o ?cat_pb_corec z khp $-> (khp.2).1
G, H, K: ZeroGpd
f: G $-> K
g: H $-> K
forall (z : ZeroGpd) (k h : z $-> pullback_0gpd f g),
pullback_0gpd_pr1 f g $o k $== pullback_0gpd_pr1 f g $o h ->
pullback_0gpd_pr2 f g $o k $== pullback_0gpd_pr2 f g $o h -> k $== h
  -G, H, K: ZeroGpd
f: G $-> K
g: H $-> K
forall z : ZeroGpd,
pullback_0gpd (fmap (opyon_0gpd z) f) (fmap (opyon_0gpd z) g) ->
z $-> pullback_0gpd f g intros Z khp.G, H, K: ZeroGpd
f: G $-> K
g: H $-> K
Z: ZeroGpd
khp: pullback_0gpd (fmap (opyon_0gpd Z) f) (fmap (opyon_0gpd Z) g)
Z $-> pullback_0gpd f g
    exact (equiv_pullback_0gpd_corec f g khp).
  -G, H, K: ZeroGpd
f: G $-> K
g: H $-> K
forall (z : ZeroGpd)
(khp : pullback_0gpd (fmap (opyon_0gpd z) f) (fmap (opyon_0gpd z) g)),
pullback_0gpd_pr1 f g $o
(fun (Z : ZeroGpd)
   (khp0 : pullback_0gpd (fmap (opyon_0gpd Z) f) (fmap (opyon_0gpd Z) g)) =>
 equiv_pullback_0gpd_corec f g khp0) z khp $->
khp.1 reflexivity.
  -G, H, K: ZeroGpd
f: G $-> K
g: H $-> K
forall (z : ZeroGpd)
(khp : pullback_0gpd (fmap (opyon_0gpd z) f) (fmap (opyon_0gpd z) g)),
pullback_0gpd_pr2 f g $o
(fun (Z : ZeroGpd)
   (khp0 : pullback_0gpd (fmap (opyon_0gpd Z) f) (fmap (opyon_0gpd Z) g)) =>
 equiv_pullback_0gpd_corec f g khp0) z khp $->
(khp.2).1 reflexivity.
  -G, H, K: ZeroGpd
f: G $-> K
g: H $-> K
forall (z : ZeroGpd) (k h : z $-> pullback_0gpd f g),
pullback_0gpd_pr1 f g $o k $== pullback_0gpd_pr1 f g $o h ->
pullback_0gpd_pr2 f g $o k $== pullback_0gpd_pr2 f g $o h -> k $== h exact (pullback_0gpd_homotopic f g).
Defined.