lean4-htt/tests/lean/struct_class.lean.expected.out

90 lines
3.8 KiB
Text

alternative : (Type u → Type v) → Type (max (u+1) v)
applicative : (Type u → Type v) → Type (max (u+1) v)
decidable : Prop → Type
functor : (Type u → Type v) → Type (max (u+1) v)
has_add : Type u → Type (max 1 u)
has_andthen : Type u → Type (max 1 u)
has_append : Type u → Type (max 1 u)
has_coe : Type u → Type v → Type (max 1 (imax u v))
has_coe_t : Type u → Type v → Type (max 1 (imax u v))
has_coe_to_fun : Type u → Type (max u (v+1))
has_coe_to_sort : Type u → Type (max u (v+1))
has_div : Type u → Type (max 1 u)
has_dvd : Type u → Type (max 1 u)
has_inter : Type u → Type (max 1 u)
has_inv : Type u → Type (max 1 u)
has_le : Type u → Type (max 1 u)
has_lift : Type u → Type v → Type (max 1 (imax u v))
has_lift_t : Type u → Type v → Type (max 1 (imax u v))
has_lt : Type u → Type (max 1 u)
has_mem : Type u → (Type u → Type v) → Type (max 1 u v)
has_mod : Type u → Type (max 1 u)
has_mul : Type u → Type (max 1 u)
has_neg : Type u → Type (max 1 u)
has_one : Type u → Type (max 1 u)
has_ordering : Type → Type
has_sdiff : Type u → Type (max 1 u)
has_sizeof : Type u → Type (max 1 u)
has_ssubset : Type u → Type (max 1 u)
has_sub : Type u → Type (max 1 u)
has_subset : Type u → Type (max 1 u)
has_to_format : Type u → Type (max 1 u)
has_to_pexpr : Type u → Type (max 1 u)
has_to_string : Type u → Type (max 1 u)
has_to_tactic_format : Type → Type
has_union : Type u → Type (max 1 u)
has_zero : Type u → Type (max 1 u)
inhabited : Type u → Type (max 1 u)
insertable : Type u → (Type u → Type v) → Type (max 1 (imax u v) v)
is_associative : Π {A : Type u}, (A → A → A) → Type
monad : (Type u → Type v) → Type (max (u+1) v)
nonempty : Type u → Prop
point : Type u_1 → Type u_2 → Type (max 1 u_1 u_2)
separable : Type u → (Type u → Type v) → Type (max 1 (imax (max 1 u) v))
setoid : Type u → Type (max 1 u)
subsingleton : Type u → Prop
alternative : (Type u → Type v) → Type (max (u+1) v)
applicative : (Type u → Type v) → Type (max (u+1) v)
decidable : Prop → Type
functor : (Type u → Type v) → Type (max (u+1) v)
has_add : Type u → Type (max 1 u)
has_andthen : Type u → Type (max 1 u)
has_append : Type u → Type (max 1 u)
has_coe : Type u → Type v → Type (max 1 (imax u v))
has_coe_t : Type u → Type v → Type (max 1 (imax u v))
has_coe_to_fun : Type u → Type (max u (v+1))
has_coe_to_sort : Type u → Type (max u (v+1))
has_div : Type u → Type (max 1 u)
has_dvd : Type u → Type (max 1 u)
has_inter : Type u → Type (max 1 u)
has_inv : Type u → Type (max 1 u)
has_le : Type u → Type (max 1 u)
has_lift : Type u → Type v → Type (max 1 (imax u v))
has_lift_t : Type u → Type v → Type (max 1 (imax u v))
has_lt : Type u → Type (max 1 u)
has_mem : Type u → (Type u → Type v) → Type (max 1 u v)
has_mod : Type u → Type (max 1 u)
has_mul : Type u → Type (max 1 u)
has_neg : Type u → Type (max 1 u)
has_one : Type u → Type (max 1 u)
has_ordering : Type → Type
has_sdiff : Type u → Type (max 1 u)
has_sizeof : Type u → Type (max 1 u)
has_ssubset : Type u → Type (max 1 u)
has_sub : Type u → Type (max 1 u)
has_subset : Type u → Type (max 1 u)
has_to_format : Type u → Type (max 1 u)
has_to_pexpr : Type u → Type (max 1 u)
has_to_string : Type u → Type (max 1 u)
has_to_tactic_format : Type → Type
has_union : Type u → Type (max 1 u)
has_zero : Type u → Type (max 1 u)
inhabited : Type u → Type (max 1 u)
insertable : Type u → (Type u → Type v) → Type (max 1 (imax u v) v)
is_associative : Π {A : Type u}, (A → A → A) → Type
monad : (Type u → Type v) → Type (max (u+1) v)
nonempty : Type u → Prop
point : Type u_1 → Type u_2 → Type (max 1 u_1 u_2)
separable : Type u → (Type u → Type v) → Type (max 1 (imax (max 1 u) v))
setoid : Type u → Type (max 1 u)
subsingleton : Type u → Prop