Mathlib Map

Theorems · Theorem · logic and foundations

FirstOrder.Language.PartialEquiv.cod_le_cod

∀ {L : FirstOrder.Language} {M : Type w} {N : Type w'} [inst : L.Structure M] [inst_1 : L.Structure N]
  {f g : L.PartialEquiv M N}, f ≤ g → f.cod ≤ g.cod
Defined in
Mathlib.ModelTheory.PartialEquiv
Cited by
6 results in Mathlib
Foundations
Depth 27 from the axioms · uses propext, Classical.choice, Quot.sound
Assumes
FirstOrder.Language.StructureFirstOrder.Language.Structure

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

Cites16

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Cited by6

Results whose statement or proof uses this declaration.