Back to NPA
Declaration
ring_crt_intersection_right
Mathlib.Algebra.Ring.ChineseRemainder
Packages
2
Module
63
Theorems
750
Declarations
1016
Untrusted sidecar
Source text and display overlays are presentation metadata. The signed certificate and checker result are the trusted evidence.
Statement
forall (R : Sort u), forall (RI : Sort v), forall (RJ : Sort w), forall (zeroI : RI), forall (zeroJ : RJ), forall (modI : forall (x : R), RI), forall (modJ : forall (x : R), RJ), forall (x : R), forall (h : @RingCrtIntersectionPred.{u,v,w} R RI RJ zeroI zeroJ modI modJ x), @Eq.{w} RJ (modJ x) zeroJProof term
theorem ring_crt_intersection_right.{u,v,w} :
forall (R : Sort u), forall (RI : Sort v), forall (RJ : Sort w), forall (zeroI : RI), forall (zeroJ : RJ), forall (modI : forall (x : R), RI), forall (modJ : forall (x : R), RJ), forall (x : R), forall (h : @RingCrtIntersectionPred.{u,v,w} R RI RJ zeroI zeroJ modI modJ x), @Eq.{w} RJ (modJ x) zeroJ :=
fun R => fun RI => fun RJ => fun zeroI => fun zeroJ => fun modI => fun modJ => fun x => fun h => h (@Eq.{w} RJ (modJ x) zeroJ) (fun (left_kernel_arg : @Eq.{v} RI (modI x) zeroI) => fun (right_kernel_arg : @Eq.{w} RJ (modJ x) zeroJ) => right_kernel_arg)