correspondence_theorem_evidence

forall (G : Sort succ u), forall (one : G), forall (mul : forall (a : G), forall (b : G), G), forall (inv : forall (a : G), G), forall (N : forall (x : G), Prop), forall (Hpred : forall (x : G), Prop), forall (group_args : @GroupLawArgs.{succ u} G one mul inv), forall (n_normal : @NormalSubgroupLawArgs.{succ u} G one mul inv N), forall (h_args : @SubgroupLawArgs.{succ u} G one mul inv Hpred), forall (n_le_h : forall (x : G), forall (hn : N x), Hpred x), forall (K : forall (q : @NormalQuot.{u} G one mul inv N group_args n_normal), Prop), forall (k_args : @SubgroupLawArgs.{succ u} (@NormalQuot.{u} G one mul inv N group_args n_normal) (@NormalQuotOne.{u} G one mul inv N group_args n_normal) (@NormalQuotMul.{u} G one mul inv N group_args n_normal) (@NormalQuotInv.{u} G one mul inv N group_args n_normal) K), @CorrespondenceTheoremEvidence.{u} G one mul inv N Hpred group_args n_normal h_args n_le_h K k_args

fun G => fun one => fun mul => fun inv => fun N => fun Hpred => fun group_args => fun n_normal => fun h_args => fun n_le_h => fun K => fun k_args => @CorrespondenceTheoremEvidence.mk.{u} G one mul inv N Hpred group_args n_normal h_args n_le_h K k_args (@correspondence_image_subgroup_evidence.{u} G one mul inv N Hpred group_args n_normal h_args) (@correspondence_preimage_subgroup_evidence.{u} G one mul inv N group_args n_normal K k_args) (@correspondence_containment_evidence.{u} G one mul inv N group_args n_normal K k_args) (@correspondence_subgroup_saturation_evidence.{u} G one mul inv N Hpred group_args n_normal h_args n_le_h) (@correspondence_quotient_round_trip_evidence.{u} G one mul inv N group_args n_normal K k_args)