Theorems · Theorem · combinatorics
Equiv.toCompl.congr_simp
∀ {α : Type u_1} {p q : α → Prop} [inst : Finite ↑{x | p x}] (e e_1 : ↑{x | p x} ≃ ↑{x | q x}),
e = e_1 → e.toCompl = e_1.toCompl- Defined in
- Mathlib.Logic.Equiv.Fintype
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 78 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- Finite
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites5
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Equivstatement and proof · cited by 8,337
- Set.Elemstatement and proof · cited by 7,166
- Set.ofPredstatement and proof · cited by 6,101
- Finitestatement and proof · cited by 3,029
- Equiv.toComplstatement and proof · cited by 4
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.