Theorems · Theorem
Function.ne_iff
∀ {α : Sort u_1} {β : α → Sort u_4} {f₁ f₂ : (a : α) → β a}, f₁ ≠ f₂ ↔ ∃ a, f₁ a ≠ f₂ a- Defined in
- Mathlib.Logic.Function.Basic
- Cited by
- 40 results in Mathlib
- Foundations
- Depth 13 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites1
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Iff.notproof · cited by 489
Cited by40
Results whose statement or proof uses this declaration.
- Height.one_le_mulHeightproof · cited by 8
- Height.mulHeight_comp_equivproof · cited by 7
- Height.mulHeight_eq_one_of_subsingletonproof · cited by 7
- Height.mulHeight_smul_eq_mulHeightproof · cited by 6
- PiNat.apply_firstDiff_neproof · cited by 4
- Pi.toLex_strictMonoproof · cited by 3
- map_one_ne_zeroproof · cited by 3
- Height.mulHeight_eval_leproof · cited by 3
- Height.mulHeight_fun_mul_eqproof · cited by 3
- Height.mulHeight_powproof · cited by 3
- Height.mulHeight_sumElim_zero_eqproof · cited by 3
- exists_ne_zero_dotProduct_eq_zeroproof · cited by 2