Finite Field
30-sec diagnosis
Back to NPA

Declaration

RingCrtIntersectionPred

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), Prop

Proof term

def RingCrtIntersectionPred.{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), Prop :=
  fun R => fun RI => fun RJ => fun zeroI => fun zeroJ => fun modI => fun modJ => fun x => forall (Q : Prop), forall (mk : forall (left_kernel : @Eq.{v} RI (modI x) zeroI), forall (right_kernel : @Eq.{w} RJ (modJ x) zeroJ), Q), Q