Theorems · Theorem · field theory

PerfectClosure.eq_iff

∀ (K : Type u) [inst : CommRing K] [IsReduced K] (p : ℕ) [inst_2 : Fact (Nat.Prime p)] [inst_3 : CharP K p]
  (x y : ℕ × K),
  PerfectClosure.mk K p x = PerfectClosure.mk K p y ↔ (⇑(frobenius K p))^[y.1] x.2 = (⇑(frobenius K p))^[x.1] y.2

Defined in

Mathlib.FieldTheory.PerfectClosure

Cited by

0 results in Mathlib

Foundations

Depth 100 from the axioms · uses propext, Classical.choice, Quot.sound

Assumes

CommRingIsReducedFactCharP