Theorems · Theorem
Equiv.exists_congr_right
∀ {α : Sort u} {β : Sort v} {q : β → Prop} (e : α ≃ β), (∃ a, q (e a)) ↔ ∃ b, q b- Defined in
- Mathlib.Logic.Equiv.Defs
- Cited by
- 9 results in Mathlib
- Foundations
- Depth 15 from the axioms · uses Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites4
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coestatement and proof · cited by 62,936
- Equivstatement and proof · cited by 8,337
- Equiv.symmproof · cited by 3,681
- Equiv.apply_symm_applyproof · cited by 346
Cited by9
Results whose statement or proof uses this declaration.
- Equiv.exists_congr_leftproof · cited by 33
- Submodule.fg_iff_exists_fin_linearMapproof · cited by 4
- Algebra.FormallySmooth.iff_split_injectionproof · cited by 3
- ProperVAdd.isCompact_setOfPred_inter_nonemptyproof · cited by 2
- ProperSMul.isCompact_setOfPred_inter_nonemptyproof · cited by 2
- PrimeSpectrum.exists_constructibleSetData_iffproof · cited by 2
- Equiv.vanishesTrivially_compproof · cited by 2
- Set.exists_neg_memproof · cited by 1
- Set.exists_inv_memproof · cited by 0