Documentation Verification Report

Basic

πŸ“ Source: Mathlib/Data/Fin/Tuple/Basic.lean

Statistics

MetricCount
Definitionsappend, cons, consCases, consEquiv, consInduction, contractNth, find, init, insertNth, insertNthEquiv, removeNth, repeat, snoc, snocCases, snocEquiv, snocInduction, succAboveCases, tail, piFinTwoEquiv
19
TheoremsaddCases_castAdd_natAdd, append_assoc, append_castAdd_natAdd, append_cast_left, append_cast_right, append_comp_rev, append_comp_sumElim, append_cons, append_elim0, append_injective_iff, append_left, append_left', append_left_eq_cons, append_left_nil, append_left_snoc, append_rev, append_right, append_right_cons, append_right_eq_snoc, append_right_nil, append_snoc, comp_cons, comp_contractNth, comp_init, comp_snoc, comp_tail, consCases_cons, consEquiv_apply, consEquiv_symm_apply, cons_comp_rev, cons_eq_append, cons_inj, cons_injective2, cons_injective_iff, cons_injective_of_injective, cons_last, cons_le, cons_le_cons, cons_left_injective, cons_one, cons_rev, cons_right_injective, cons_self_tail, cons_snoc_eq_snoc_cons, cons_succ, cons_update, cons_zero, contractNth_apply_of_eq, contractNth_apply_of_gt, contractNth_apply_of_lt, contractNth_apply_of_ne, elim0_append, eq_insertNth_iff, eq_self_or_eq_succAbove, exists_cons, exists_fin_succ_pi, exists_fin_zero_pi, exists_iff_castSucc, exists_iff_succ, exists_iff_succAbove, find?_decide_eq_dite, find?_decide_get_eq_find, find?_eq_dite, find?_eq_some_find_of_exists, find?_eq_some_find_of_isSome, find_congr, find_congr', find_eq_dite, find_eq_iff, find_eq_zero, find_le, find_le_iff, find_le_of_pos, find_lt_iff, find_mem_find?_decide, find_min, find_mono, find_mono_of_le, find_nat_lt, find_of_find_le, find_of_not_zero, find_pos, find_spec, forall_fin_add, forall_fin_add_pi, forall_fin_succ_pi, forall_fin_zero_pi, forall_iff_castSucc, forall_iff_succ, forall_iff_succAbove, get_find?_eq_find_of_eq_true, init_def, init_snoc, init_update_castSucc, init_update_last, insertNthEquiv_apply, insertNthEquiv_last, insertNthEquiv_symm_apply, insertNthEquiv_zero, insertNth_apply_above, insertNth_apply_below, insertNth_apply_same, insertNth_apply_succAbove, insertNth_binop, insertNth_comp_rev, insertNth_comp_succAbove, insertNth_eq_iff, insertNth_inj, insertNth_injective2, insertNth_last, insertNth_last', insertNth_le_iff, insertNth_left_injective, insertNth_removeNth, insertNth_rev, insertNth_right_injective, insertNth_self_removeNth, insertNth_succ_cons, insertNth_update, insertNth_zero, insertNth_zero', le_cons, le_find_iff, le_insertNth_iff, lt_find_iff, mem_find?_iff, range_cons, range_fin_succ, range_snoc, removeNth_apply, removeNth_fun_const, removeNth_insertNth, removeNth_last, removeNth_removeNth_eq_swap, removeNth_removeNth_heq_swap, removeNth_update, removeNth_update_succAbove, removeNth_zero, repeat_add, repeat_apply, repeat_comp_rev, repeat_one, repeat_rev, repeat_succ, repeat_zero, sigma_eq_iff_eq_comp_cast, sigma_eq_of_eq_comp_cast, snocCases_snoc, snocEquiv_apply, snocEquiv_symm_apply, snoc_apply_zero, snoc_castAdd, snoc_castSucc, snoc_comp_castAdd, snoc_comp_castSucc, snoc_comp_natAdd, snoc_comp_rev, snoc_eq_append, snoc_init_self, snoc_inj, snoc_injective2, snoc_injective_iff, snoc_injective_of_injective, snoc_last, snoc_left_injective, snoc_rev, snoc_right_injective, snoc_update, snoc_zero, succAbove_cases_eq_insertNth, tail_cons, tail_def, tail_init_eq_init_tail, tail_update_succ, tail_update_zero, tuple0_le, update_cons_zero, update_insertNth, update_snoc_last, val_find, piFinTwoEquiv_apply, piFinTwoEquiv_symm_apply
182
Total201

Fin

Definitions

NameCategoryTheorems
append πŸ“–CompOp
39 mathmath: append_right_cons, appendHomeomorph_apply, append_elim0, append_assoc, List.ofFn_fin_append, append_left_eq_cons, appendIsometryOfEq_apply, append_right_nil, ExteriorAlgebra.ΞΉMulti_mul_ΞΉMulti, elim0_append, append_left_snoc, append_right_eq_snoc, Embedding.coe_append, TensorPower.tprod_mul_tprod, append_right, append_cons, append_comp_sumElim, cons_eq_append, append_snoc, append_injective_iff, succFunEquiv_symm_apply, append_left', repeat_add, take_append_left, snoc_eq_append, append_left, append_cast_right, repeat_succ, append_rev, append_cast_left, append_castAdd_natAdd, append_comp_rev, appendIsometry_apply, continuous_append, take_append_right, appendEquiv_apply, edist_append_eq_max_edist, append_left_nil, RelSeries.append_toFun
cons πŸ“–CompOp
133 mathmath: ContinuousAlternatingMap.cons_add, differentiableWithinAt_finCons', insertNth_succ_cons, DifferentiableAt.finCons, cons_inj, DifferentiableWithinAt.finCons, Embedding.coe_cons, Matrix.Fin.cons_vecCons, cons_injective_of_injective, HasStrictFDerivAt.finCons, cons_succ, ContinuousOn.finCons, Module.Basis.coe_mkFinConsOfLE, LinearEquiv.piFinTwo_symm_apply, torusIntegral_succ, consEquiv_apply, Set.iUnion_cons, append_right_cons, MeasurableEquiv.piFinTwo_symm_apply, HasDerivAt.finCons, differentiable_finCons', exists_linearIndependent_cons_of_lt_finrank, Function.FromTypes.uncurry_apply_cons, Matrix.vandermonde_succ, consEquivL_apply, consCases_cons, Differentiable.finCons, preimage_apply_01_prod, hasFDerivAt_finCons, hasFDerivWithinAt_finCons, Function.FromTypes.curry_apply_succ, exists_linearIndependent_cons_of_lt_rank, MvPolynomial.eval_eq_eval_mv_eval', exists_cons, differentiableOn_finCons', linearIndependent_fin_cons, append_left_eq_cons, ContinuousMultilinearMap.cons_smul, sum_cons, hasFDerivWithinAt_finCons', exists_fin_succ_pi, append_left_snoc, hasStrictFDerivAt_finCons, cons_comp_rev, cons_le_cons, snoc_eq_cons_rotate, cons_last, ContinuousMultilinearMap.cons_add, hasFDerivAt_finCons', HasFDerivAt.finCons, cons_snoc_eq_snoc_cons, cons_apply_cycleRange, hasStrictDerivAt_finCons', hasStrictDerivAt_finCons, update_cons_zero, append_cons, HasFDerivWithinAt.finCons, differentiableAt_finCons, cons_one, OrderedFinpartition.extendLeft_partSize, cons_le, Continuous.finCons, ContinuousWithinAt.finCons, IsometryEquiv.piFinTwo_symm_apply, cons_self_tail, MultilinearMap.cons_add, cons_eq_append, consOrderIso_apply, MultilinearMap.curryLeft_apply, insertNth_zero', cons_left_injective, MultilinearMap.cons_smul, LinearIndependent.fin_cons, ContinuousAlternatingMap.cons_smul, hasStrictFDerivAt_finCons', prodEquivPiFinTwo_apply, Matrix.vandermonde_cons, FirstOrder.Language.Formula.realize_graph, hasDerivAtFilter_finCons', hasDerivWithinAt_finCons', range_cons, hasFDerivAtFilter_finCons, continuousMultilinearCurryLeftEquiv_apply, LinearIndependent.fin_cons', pi_lex_lt_cons_cons, insertNth_zero, snoc_eq_append, prodEquivPiFinTwo_symm_apply, Equiv.coe_embeddingFinSucc_symm, differentiableAt_finCons', MeasurableEquiv.finTwoArrow_symm_apply, insertNth_comp_cycleRange_symm, HasStrictDerivAt.finCons, cons_mem_piFinset_cons, hasDerivAtFilter_finCons, forall_fin_succ_pi, cons_injective_iff, comp_cons, ContinuousMultilinearMap.curryLeft_apply, snoc_rev, hasDerivAt_finCons', cons_injective2, DifferentiableOn.finCons, ContinuousAt.finCons, le_cons, HasDerivAtFilter.finCons, hasFDerivAtFilter_finCons', Matrix.Fin.cons_vecEmpty, HasFDerivAtFilter.finCons, Module.Basis.coe_mkFinCons, ContinuousMultilinearMap.norm_map_cons_le, cons_right_injective, differentiable_finCons, differentiableOn_finCons, hasDerivWithinAt_finCons, UniformEquiv.piFinTwo_symm_apply, Homeomorph.piFinTwo_symm_apply, piFinTwoEquiv_symm_apply, prod_cons, cons_comp_cycleRange, Filter.Tendsto.finCons, cons_update, hasDerivAt_finCons, ContinuousLinearEquiv.piFinTwo_symm_apply, snoc_comp_rev, List.ofFn_cons, cons_zero, Function.FromTypes.curry_apply_cons, HasDerivWithinAt.finCons, differentiableWithinAt_finCons, insertNth_apply_cycleRange_symm, tail_cons, cons_rev
consCases πŸ“–CompOp
1 mathmath: consCases_cons
consEquiv πŸ“–CompOp
9 mathmath: Action.diagonalSuccIsoTensorDiagonal_inv_hom, Finset.map_consEquiv_filter_piFinset, consEquiv_apply, insertNthEquiv_zero, Finset.filter_piFinset_eq_map_consEquiv, consEquiv_symm_apply, consOrderIso_toEquiv, consLinearEquiv_symm_apply, consLinearEquiv_apply
consInduction πŸ“–CompOpβ€”
contractNth πŸ“–CompOp
12 mathmath: partialProd_contractNth, contractNth_apply_of_gt, contractNth_apply_of_ne, groupHomology.inhomogeneousChains.d_single, inhomogeneousCochains.d_hom_apply, inv_partialProd_mul_eq_contractNth, neg_partialSum_add_eq_contractNth, contractNth_apply_of_eq, Rep.barComplex.d_single, comp_contractNth, partialSum_contractNth, contractNth_apply_of_lt
find πŸ“–CompOp
26 mathmath: find_eq_iff, find_pos, find_congr', find_eq_zero, find_mono_of_le, find_of_find_le, find?_eq_dite, find_le_iff, le_find_iff, find?_eq_some_find_of_isSome, find_le_of_pos, find_spec, find_congr, find_mono, lt_find_iff, find?_eq_some_find_of_exists, get_find?_eq_find_of_eq_true, find_nat_lt, find_mem_find?_decide, find_eq_dite, find_lt_iff, find_of_not_zero, val_find, find?_decide_get_eq_find, find?_decide_eq_dite, find_le
init πŸ“–CompOp
31 mathmath: init_def, init_update_last, Finset.map_snocEquiv_filter_piFinset, Finset.card_snocEquiv_filter_piFinset, SchwartzMap.iteratedPDeriv_succ_right, take_init, iteratedFDerivWithin_succ_apply_right, continuousMultilinearCurryRightEquiv_symm_apply, Filter.Tendsto.finInit, ContinuousMultilinearMap.norm_map_init_le, ContinuousAt.finInit, linearIndependent_fin_succ', snocOrderIso_symm_apply, take_eq_init, ContinuousMultilinearMap.uncurryRight_apply, partialProd_init, snoc_init_self, iteratedFDeriv_succ_apply_right, tail_init_eq_init_tail, MultilinearMap.uncurryRight_apply, Finset.filter_piFinset_eq_map_snocEquiv, continuousMultilinearCurryRightEquiv_symm_apply', init_update_castSucc, mem_piFinset_iff_last_init, Continuous.finInit, partialSum_init, removeNth_last, init_snoc, LineDeriv.iteratedLineDerivOp_succ_right, comp_init, snocEquiv_symm_apply
insertNth πŸ“–CompOp
74 mathmath: insertNth_succ_cons, preimage_insertNth_Icc_of_mem, insertNth_comp_succAbove, MultilinearMap.map_insertNth_add, nndist_insertNth_insertNth, insertNth_rev, ContinuousAlternatingMap.map_insertNth, insertNth_one_right, ContinuousAt.finInsertNth, insertNthEquiv_apply, insertNth_comp_rev, MultilinearMap.map_insertNth_smul, insertNth_le_iff, BoxIntegral.hasIntegral_GP_pderiv, insertNth_mem_piFinset_insertNth, BoxIntegral.hasIntegral_GP_divergence_of_forall_hasDerivWithinAt, insertNth_right_injective, insertNth_apply_succAbove, insertNth_self_removeNth, insertNth_binop, insertNth_injective2, insertNth_mul, MeasureTheory.integral_divergence_of_hasFDerivAt_off_countable_of_equiv, insertNth_apply_below, cons_apply_cycleRange, BoxIntegral.Box.continuousOn_face_Icc, update_insertNth, MultilinearMap.curryMid_apply_apply, MeasureTheory.integral_divergence_of_hasFDerivAt_off_countable', preimage_insertNth_Icc_of_notMem, Continuous.finInsertNth, insertNth_apply_same, succAbove_cases_eq_insertNth, BoxIntegral.Box.mapsTo_insertNth_face, insertNth_zero', Filter.Tendsto.finInsertNth, BoxIntegral.Box.mapsTo_insertNth_face_Icc, RelSeries.insertNth_toFun, insertNth_last', insertNth_apply_above, insertNth_div, insertNth_update, BoxIntegral.norm_volume_sub_integral_face_upper_sub_lower_smul_le, insertNth_last, insertNth_div_same, insertNth_zero, insertNth_mem_Icc, ContinuousMultilinearMap.curryMid_apply, insertNthOrderIso_apply, insertNth_comp_cycleRange_symm, insertNth_add, MeasureTheory.integral_divergence_of_hasFDerivAt_off_countable, insertNth_removeNth, insertNth_zero_right, dist_insertNth_insertNth, prod_insertNth, ContinuousMultilinearMap.norm_map_insertNth_le, AlternatingMap.neg_one_pow_smul_map_insertNth, AlternatingMap.map_insertNth, ContinuousAlternatingMap.neg_one_pow_smul_map_insertNth, le_insertNth_iff, insertNth_eq_iff, insertNth_inj, removeNth_insertNth, sum_insertNth, eq_insertNth_iff, ContinuousWithinAt.finInsertNth, insertNth_left_injective, cons_comp_cycleRange, torusIntegral_succAbove, insertNth_sub, ContinuousOn.finInsertNth, insertNth_apply_cycleRange_symm, insertNth_sub_same
insertNthEquiv πŸ“–CompOp
9 mathmath: insertNthEquiv_apply, insertNthEquiv_last, insertNthOrderIso_toEquiv, insertNthEquiv_zero, insertNthEquiv_symm_apply, Finset.filter_piFinset_eq_map_insertNthEquiv, Finset.map_insertNthEquiv_filter_piFinset, MeasurableEquiv.piFinSuccAbove_symm_apply, MeasurableEquiv.piFinSuccAbove_apply
removeNth πŸ“–CompOp
37 mathmath: removeNth_zero, removeNth_apply, Finset.card_insertNthEquiv_filter_piFinset, mem_piFinset_iff_pivot_removeNth, removeNth_removeNth_eq_swap, insertNthOrderIso_symm_apply, AlternatingMap.alternatizeUncurryFin_apply, insertNth_self_removeNth, extDeriv_apply_vectorField, ContinuousAlternatingMap.alternatizeUncurryFin_alternatizeUncurryFinCLM_comp_apply, extDerivWithin_apply_vectorField_of_pairwise_commute, AlternatingMap.neg_one_pow_smul_map_removeNth_add_eq_zero_of_eq, removeNth_update_succAbove, insertNthEquiv_symm_apply, AlternatingMap.alternatizeUncurryFin_alternatizeUncurryFinLM_comp_apply, mul_prod_removeNth, Finset.filter_piFinset_eq_map_insertNthEquiv, LinearMap.uncurryMid_apply, extDerivWithin_apply_vectorField, add_sum_removeNth, removeNth_removeNth_heq_swap, ContinuousLinearMap.uncurryMid_apply, removeNth_update, Finset.map_insertNthEquiv_filter_piFinset, extDeriv_apply_vectorField_of_pairwise_commute, removeNth_last, ContinuousAlternatingMap.neg_one_pow_smul_map_removeNth_add_eq_zero_of_eq, insertNth_removeNth, AlternatingMap.uncurryFin_apply, removeNth_fun_const, extDerivWithin_apply, insertNth_eq_iff, removeNth_insertNth, ContinuousLinearMap.norm_map_removeNth_le, eq_insertNth_iff, ContinuousAlternatingMap.alternatizeUncurryFin_apply, extDeriv_apply
repeat πŸ“–CompOp
9 mathmath: repeat_one, repeat_zero, repeat_comp_rev, List.ofFn_fin_repeat, repeat_add, repeat_rev, repeat_succ, repeat_apply, take_repeat
snoc πŸ“–CompOp
62 mathmath: comp_snoc, exists_linearIndependent_snoc_of_lt_finrank, ContinuousMultilinearMap.norm_map_snoc_le, snoc_inj, snoc_castSucc, snocCases_snoc, FirstOrder.Language.BoundedFormula.realize_ex, snocEquiv_apply, append_right_cons, sum_snoc, snoc_left_injective, MultilinearMap.curryRight_apply, Embedding.coe_snoc, snoc_comp_natAdd, Matrix.Fin.snoc_vecEmpty, snoc_comp_castSucc, snoc_injective_iff, ContinuousAt.finSnoc, snoc_apply_zero, FirstOrder.Language.BoundedFormula.realize_all, append_left_snoc, cons_comp_rev, append_right_eq_snoc, snoc_eq_cons_rotate, Set.iUnion_snoc, snoc_update, cons_snoc_eq_snoc_cons, range_snoc, snoc_mem_piFinset_snoc, snocOrderIso_apply, snoc_zero, Matrix.Fin.snoc_vecCons, linearIndependent_fin_snoc, append_snoc, snoc_init_self, ContinuousMultilinearMap.curryRight_apply, prod_snoc, insertNth_last', take_succ_eq_snoc, insertNth_last, Continuous.finSnoc, snoc_eq_append, snoc_right_injective, update_snoc_last, MultilinearMap.snoc_add, ContinuousOn.finSnoc, snoc_comp_castAdd, snoc_injective_of_injective, init_snoc, snoc_rev, continuousMultilinearCurryRightEquiv_apply', exists_linearIndependent_snoc_of_lt_rank, ContinuousWithinAt.finSnoc, continuousMultilinearCurryRightEquiv_apply, MultilinearMap.snoc_smul, snoc_last, snoc_comp_rev, snoc_injective2, Filter.Tendsto.finSnoc, snoc_castAdd, cons_rev, continuousMultilinearCurryFin1_apply
snocCases πŸ“–CompOp
1 mathmath: snocCases_snoc
snocEquiv πŸ“–CompOp
6 mathmath: snocEquiv_apply, Finset.map_snocEquiv_filter_piFinset, insertNthEquiv_last, Finset.filter_piFinset_eq_map_snocEquiv, snocOrderIso_toEquiv, snocEquiv_symm_apply
snocInduction πŸ“–CompOpβ€”
succAboveCases πŸ“–CompOp
1 mathmath: succAbove_cases_eq_insertNth
tail πŸ“–CompOp
39 mathmath: removeNth_zero, comp_tail, Finset.map_consEquiv_filter_piFinset, Matrix.vandermonde_succ, RelSeries.tail_toFun, tail_vecCons, Embedding.coe_tail, LineDeriv.iteratedLineDerivOp_succ_left, Finset.filter_piFinset_eq_map_consEquiv, Function.FromTypes.uncurry_apply_succ, ContinuousLinearMap.uncurryLeft_apply, Finsupp.sum_cons', cons_le, iteratedFDerivWithin_succ_apply_left, Finset.card_consEquiv_filter_piFinset, ContinuousLinearMap.norm_map_tail_le, cons_self_tail, consEquiv_symm_apply, ContinuousAt.finTail, linearIndependent_fin_succ, consOrderIso_symm_apply, tail_init_eq_init_tail, range_fin_succ, partialProd_succ', Continuous.finTail, Filter.Tendsto.finTail, tail_update_succ, SchwartzMap.iteratedPDeriv_succ_left, partialSum_succ', tail_update_zero, Action.diagonalSuccIsoTensorDiagonal_hom_hom, le_cons, mem_piFinset_iff_zero_tail, tail_def, continuousMultilinearCurryLeftEquiv_symm_apply, consEquivL_symm_apply, LinearMap.uncurryLeft_apply, tail_cons, iteratedFDeriv_succ_apply_left

Theorems

NameKindAssumesProvesValidatesDepends On
addCases_castAdd_natAdd πŸ“–β€”β€”β€”β€”β€”
append_assoc πŸ“–mathematicalβ€”appendβ€”append_left
append_right
append_castAdd_natAdd πŸ“–mathematicalβ€”appendβ€”β€”
append_cast_left πŸ“–mathematicalβ€”appendβ€”β€”
append_cast_right πŸ“–mathematicalβ€”appendβ€”β€”
append_comp_rev πŸ“–mathematicalβ€”appendβ€”append_rev
append_comp_sumElim πŸ“–mathematicalβ€”appendβ€”append_left
append_right
append_cons πŸ“–mathematicalβ€”append
cons
β€”β€”
append_elim0 πŸ“–mathematicalβ€”appendβ€”append_right_nil
append_injective_iff πŸ“–mathematicalβ€”appendβ€”Sum.elim_injective
append_comp_sumElim
Equiv.injective_comp
append_left πŸ“–mathematicalβ€”appendβ€”β€”
append_left' πŸ“–mathematicalβ€”appendβ€”β€”
append_left_eq_cons πŸ“–mathematicalβ€”append
cons
β€”append_left
cons_zero
append_right
cons_succ
append_left_nil πŸ“–mathematicalβ€”appendβ€”append_right
append_left_snoc πŸ“–mathematicalβ€”append
snoc
cons
β€”snoc_eq_append
append_assoc
append_left_eq_cons
append_cast_right
append_rev πŸ“–mathematicalβ€”appendβ€”rev_surjective
append_left
append_right
cast_rev
append_right πŸ“–mathematicalβ€”appendβ€”β€”
append_right_cons πŸ“–mathematicalβ€”append
cons
snoc
β€”append_left_snoc
append_right_eq_snoc πŸ“–mathematicalβ€”append
snoc
β€”append_left
snoc_castSucc
append_right
snoc_last
append_right_nil πŸ“–mathematicalβ€”appendβ€”append_left
append_snoc πŸ“–mathematicalβ€”append
snoc
β€”β€”
comp_cons πŸ“–mathematicalβ€”consβ€”cons_succ
comp_contractNth πŸ“–mathematicalβ€”contractNthβ€”lt_trichotomy
contractNth_apply_of_lt
contractNth_apply_of_eq
contractNth_apply_of_gt
comp_init πŸ“–mathematicalβ€”initβ€”β€”
comp_snoc πŸ“–mathematicalβ€”snocβ€”snoc_last
comp_tail πŸ“–mathematicalβ€”tailβ€”β€”
consCases_cons πŸ“–mathematicalβ€”consCases
cons
β€”consCases.eq_1
consEquiv_apply πŸ“–mathematicalβ€”DFunLike.coe
Equiv
EquivLike.toFunLike
Equiv.instEquivLike
consEquiv
cons
β€”β€”
consEquiv_symm_apply πŸ“–mathematicalβ€”DFunLike.coe
Equiv
EquivLike.toFunLike
Equiv.instEquivLike
Equiv.symm
consEquiv
tail
β€”β€”
cons_comp_rev πŸ“–mathematicalβ€”cons
snoc
β€”cons_rev
cons_eq_append πŸ“–mathematicalβ€”cons
append
β€”append_left_eq_cons
cons_zero
cons_inj πŸ“–mathematicalβ€”consβ€”Function.Injective2.eq_iff
cons_injective2
cons_injective2 πŸ“–mathematicalβ€”Function.Injective2
cons
β€”cons_succ
cons_injective_iff πŸ“–mathematicalβ€”cons
Set
Set.instMembership
Set.range
β€”cons_succ
cons_zero
succ_injective
cons_injective_of_injective
cons_injective_of_injective πŸ“–mathematicalSet
Set.instMembership
Set.range
consβ€”cons_zero
cons_succ
cons_last πŸ“–mathematicalβ€”consβ€”cons_succ
cons_le πŸ“–mathematicalβ€”Pi.hasLe
Preorder.toLE
cons
tail
β€”le_cons
cons_le_cons πŸ“–mathematicalβ€”Pi.hasLe
Preorder.toLE
cons
β€”cons_succ
cons_left_injective πŸ“–mathematicalβ€”consβ€”Function.Injective2.left
cons_injective2
cons_one πŸ“–mathematicalβ€”consβ€”cons_succ
cons_rev πŸ“–mathematicalβ€”cons
snoc
β€”insertNth_zero'
insertNth_last'
insertNth_rev
cons_right_injective πŸ“–mathematicalβ€”consβ€”Function.Injective2.right
cons_injective2
cons_self_tail πŸ“–mathematicalβ€”cons
tail
β€”cons_zero
cons_succ
cons_snoc_eq_snoc_cons πŸ“–mathematicalβ€”cons
snoc
β€”cons_zero
snoc_apply_zero
cons_last
snoc_last
cons_succ
snoc_castSucc
cons_succ πŸ“–mathematicalβ€”consβ€”β€”
cons_update πŸ“–mathematicalβ€”cons
Function.update
β€”cons_zero
Function.update_of_ne
cons_succ
Function.update_apply_of_injective
succ_injective
Function.update.congr_simp
cons_zero πŸ“–mathematicalβ€”consβ€”β€”
contractNth_apply_of_eq πŸ“–mathematicalβ€”contractNthβ€”not_lt
le_of_eq
contractNth.eq_1
contractNth_apply_of_gt πŸ“–mathematicalβ€”contractNthβ€”contractNth.eq_1
not_lt_of_gt
ne_of_lt
contractNth_apply_of_lt πŸ“–mathematicalβ€”contractNthβ€”β€”
contractNth_apply_of_ne πŸ“–mathematicalβ€”contractNth
succAbove
β€”lt_trichotomy
succAbove_of_castSucc_lt
contractNth_apply_of_lt
succAbove_of_le_castSucc
le_iff_val_le_val
le_of_lt
contractNth_apply_of_gt
elim0_append πŸ“–mathematicalβ€”appendβ€”append_left_nil
eq_insertNth_iff πŸ“–mathematicalβ€”insertNth
removeNth
β€”insertNth_eq_iff
eq_self_or_eq_succAbove πŸ“–mathematicalβ€”succAboveβ€”β€”
exists_cons πŸ“–mathematicalβ€”consβ€”cons_self_tail
exists_fin_succ_pi πŸ“–mathematicalβ€”consβ€”cons_self_tail
exists_fin_zero_pi πŸ“–mathematicalβ€”finZeroElimβ€”Unique.instSubsingleton
isEmpty'
exists_iff_castSucc πŸ“–β€”β€”β€”β€”β€”
exists_iff_succ πŸ“–β€”β€”β€”β€”β€”
exists_iff_succAbove πŸ“–mathematicalβ€”succAboveβ€”β€”
find?_decide_eq_dite πŸ“–mathematicalβ€”findβ€”find?_eq_dite
find.congr_simp
find?_decide_get_eq_find πŸ“–mathematicalβ€”findβ€”find?_decide_eq_dite
find?_eq_dite πŸ“–mathematicalβ€”findβ€”β€”
find?_eq_some_find_of_exists πŸ“–mathematicalβ€”findβ€”find?_eq_dite
find?_eq_some_find_of_isSome πŸ“–mathematicalβ€”findβ€”find?_eq_dite
find_congr πŸ“–mathematicalβ€”find
le_rfl
PartialOrder.toPreorder
instPartialOrder
β€”le_antisymm
le_rfl
find_mono_of_le
find_congr' πŸ“–mathematicalβ€”findβ€”find_congr
find_eq_dite πŸ“–mathematicalβ€”findβ€”β€”
find_eq_iff πŸ“–mathematicalβ€”findβ€”find_le_of_pos
find_eq_zero πŸ“–mathematicalβ€”findβ€”instIsEmptyFalse
find_le πŸ“–mathematicalβ€”findβ€”find_le_iff
le_refl
find_le_iff πŸ“–mathematicalβ€”findβ€”LE.le.trans
find_le_of_pos
find_le_of_pos πŸ“–mathematicalβ€”findβ€”Function.mtr
find_min
lt_of_not_ge
find_lt_iff πŸ“–mathematicalβ€”findβ€”LE.le.trans_lt
find_le_of_pos
find_mem_find?_decide πŸ“–mathematicalβ€”findβ€”β€”
find_min πŸ“–β€”findβ€”β€”β€”
find_mono πŸ“–mathematicalβ€”findβ€”find_mono_of_le
find_mono_of_le πŸ“–mathematicalβ€”find
le_rfl
PartialOrder.toPreorder
instPartialOrder
β€”find_le_of_pos
le_rfl
find_spec
find_nat_lt πŸ“–mathematicalβ€”Nat.find
find
β€”val_find
Nat.find_congr
find_of_find_le πŸ“–mathematicalfindfindβ€”find_eq_iff
find_spec
find_min
LT.lt.trans_le
natAdd_lt_natAdd_iff
find_of_not_zero πŸ“–mathematicalβ€”findβ€”find_spec
find_min
find_pos πŸ“–mathematicalβ€”findβ€”Iff.not
find_eq_zero
find_spec πŸ“–mathematicalβ€”findβ€”β€”
forall_fin_add πŸ“–β€”β€”β€”β€”β€”
forall_fin_add_pi πŸ“–β€”β€”β€”β€”addCases_castAdd_natAdd
forall_fin_succ_pi πŸ“–mathematicalβ€”consβ€”β€”
forall_fin_zero_pi πŸ“–mathematicalβ€”finZeroElimβ€”Unique.instSubsingleton
isEmpty'
forall_iff_castSucc πŸ“–β€”β€”β€”β€”β€”
forall_iff_succ πŸ“–β€”β€”β€”β€”β€”
forall_iff_succAbove πŸ“–mathematicalβ€”succAboveβ€”β€”
get_find?_eq_find_of_eq_true πŸ“–mathematicalβ€”findβ€”find?_eq_dite
init_def πŸ“–mathematicalβ€”initβ€”β€”
init_snoc πŸ“–mathematicalβ€”init
snoc
β€”β€”
init_update_castSucc πŸ“–mathematicalβ€”init
Function.update
β€”Function.update_self
Function.update_of_ne
init_update_last πŸ“–mathematicalβ€”init
Function.update
β€”Function.update_of_ne
insertNthEquiv_apply πŸ“–mathematicalβ€”DFunLike.coe
Equiv
EquivLike.toFunLike
Equiv.instEquivLike
insertNthEquiv
insertNth
β€”β€”
insertNthEquiv_last πŸ“–mathematicalβ€”insertNthEquiv
snocEquiv
β€”Equiv.ext
insertNth_last'
insertNthEquiv_symm_apply πŸ“–mathematicalβ€”DFunLike.coe
Equiv
EquivLike.toFunLike
Equiv.instEquivLike
Equiv.symm
insertNthEquiv
removeNth
β€”β€”
insertNthEquiv_zero πŸ“–mathematicalβ€”insertNthEquiv
consEquiv
β€”Function.Bijective.injective
Equiv.symm_bijective
Equiv.ext
insertNth_apply_above πŸ“–mathematicalβ€”insertNth
succAbove
succAbove_pred_of_lt
β€”succAbove_pred_of_lt
insertNth.eq_1
succAbove_castPred_of_lt
succAboveCases.eq_1
insertNth_apply_below πŸ“–mathematicalβ€”insertNth
succAbove
castPred
succAbove_castPred_of_lt
β€”succAbove_castPred_of_lt
insertNth.eq_1
succAboveCases.eq_1
insertNth_apply_same πŸ“–mathematicalβ€”insertNthβ€”succAbove_castPred_of_lt
insertNth_apply_succAbove πŸ“–mathematicalβ€”insertNth
succAbove
β€”succAbove_castPred_of_lt
succAbove_ne
ne_last_of_lt
succAbove_lt_iff_castSucc_lt
castPred_succAbove
ne_zero_of_lt
lt_succAbove_iff_le_castSucc
pred_succAbove
insertNth_binop πŸ“–mathematicalβ€”insertNth
succAbove
β€”insertNth_eq_iff
insertNth_apply_same
insertNth_apply_succAbove
insertNth_comp_rev πŸ“–mathematicalβ€”insertNthβ€”insertNth_rev
insertNth_comp_succAbove πŸ“–mathematicalβ€”insertNth
succAbove
β€”insertNth_apply_succAbove
insertNth_eq_iff πŸ“–mathematicalβ€”insertNth
removeNth
β€”forall_iff_succAbove
insertNth_apply_same
insertNth_apply_succAbove
insertNth_inj πŸ“–mathematicalβ€”insertNthβ€”Function.Injective2.eq_iff
insertNth_injective2
insertNth_injective2 πŸ“–mathematicalβ€”Function.Injective2
insertNth
β€”insertNth_apply_same
insertNth_apply_succAbove
insertNth_last πŸ“–mathematicalβ€”insertNth
snoc
succAbove
succAbove_last_apply
β€”succAbove_last_apply
insertNth_eq_iff
snoc_last
snoc_castSucc
congr_arg_heq
succAbove_last
insertNth_last' πŸ“–mathematicalβ€”insertNth
snoc
β€”insertNth_last
insertNth_le_iff πŸ“–mathematicalβ€”Pi.hasLe
Preorder.toLE
insertNth
succAbove
β€”forall_iff_succAbove
insertNth_apply_same
insertNth_apply_succAbove
insertNth_left_injective πŸ“–mathematicalβ€”insertNthβ€”Function.Injective2.left
insertNth_injective2
insertNth_removeNth πŸ“–mathematicalβ€”insertNth
removeNth
Function.update
β€”Function.update_self
removeNth_update
insertNth_rev πŸ“–mathematicalβ€”insertNthβ€”insertNth_apply_same
rev_succAbove
insertNth_apply_succAbove
insertNth_right_injective πŸ“–mathematicalβ€”insertNthβ€”Function.Injective2.right
insertNth_injective2
insertNth_self_removeNth πŸ“–mathematicalβ€”insertNth
removeNth
β€”insertNth_removeNth
Function.update_eq_self
insertNth_succ_cons πŸ“–mathematicalβ€”insertNth
cons
β€”insertNth_apply_same
cons_succ
insertNth_apply_succAbove
cons_zero
succAbove_ne_zero_zero
succ_succAbove_succ
insertNth_update πŸ“–mathematicalβ€”insertNth
Function.update
succAbove
β€”Function.update_of_ne
insertNth_apply_same
removeNth_update_succAbove
removeNth_insertNth
insertNth_zero πŸ“–mathematicalβ€”insertNth
cons
succAbove
succAbove_zero
β€”succAbove_zero
insertNth_eq_iff
cons_zero
cons_succ
insertNth_zero' πŸ“–mathematicalβ€”insertNth
cons
β€”insertNth_zero
le_cons πŸ“–mathematicalβ€”Pi.hasLe
Preorder.toLE
cons
tail
β€”cons_succ
le_find_iff πŸ“–mathematicalβ€”findβ€”β€”
le_insertNth_iff πŸ“–mathematicalβ€”Pi.hasLe
Preorder.toLE
insertNth
succAbove
β€”forall_iff_succAbove
insertNth_apply_same
insertNth_apply_succAbove
lt_find_iff πŸ“–mathematicalβ€”findβ€”β€”
mem_find?_iff πŸ“–β€”β€”β€”β€”β€”
range_cons πŸ“–mathematicalβ€”Set.range
cons
Set
Set.instInsert
β€”range_fin_succ
cons_zero
tail_cons
range_fin_succ πŸ“–mathematicalβ€”Set.range
Set
Set.instInsert
tail
β€”Set.ext
Iff.or
range_snoc πŸ“–mathematicalβ€”Set.range
snoc
Set
Set.instInsert
β€”Set.ext
snoc_castSucc
snoc_last
removeNth_apply πŸ“–mathematicalβ€”removeNth
succAbove
β€”β€”
removeNth_fun_const πŸ“–mathematicalβ€”removeNthβ€”β€”
removeNth_insertNth πŸ“–mathematicalβ€”removeNth
insertNth
β€”insertNth_apply_succAbove
removeNth_last πŸ“–mathematicalβ€”removeNth
init
β€”succAbove_last
removeNth_removeNth_eq_swap πŸ“–mathematicalβ€”removeNth
predAbove
succAbove
β€”removeNth_removeNth_heq_swap
removeNth_removeNth_heq_swap πŸ“–mathematicalβ€”removeNth
succAbove
predAbove
β€”Function.hfunext
congr_arg_heq
succAbove_succAbove_succAbove_predAbove
removeNth_update πŸ“–mathematicalβ€”removeNth
Function.update
β€”Function.update_of_ne
removeNth_update_succAbove πŸ“–mathematicalβ€”removeNth
Function.update
succAbove
β€”eq_or_ne
Function.update_self
Function.update_of_ne
removeNth_zero πŸ“–mathematicalβ€”removeNth
tail
β€”β€”
repeat_add πŸ“–mathematicalβ€”repeat
append
β€”Function.Surjective.forall
rightInverse_cast
append_left
append_right
repeat_apply πŸ“–mathematicalβ€”repeatβ€”β€”
repeat_comp_rev πŸ“–mathematicalβ€”repeatβ€”repeat_rev
repeat_one πŸ“–mathematicalβ€”repeatβ€”Function.Surjective.forall
rightInverse_cast
repeat_rev πŸ“–mathematicalβ€”repeatβ€”modNat_rev
repeat_succ πŸ“–mathematicalβ€”repeat
append
β€”Function.Surjective.forall
rightInverse_cast
append_left
append_right
repeat_zero πŸ“–mathematicalβ€”repeatβ€”β€”
sigma_eq_iff_eq_comp_cast πŸ“–β€”β€”β€”β€”sigma_eq_of_eq_comp_cast
sigma_eq_of_eq_comp_cast πŸ“–β€”β€”β€”β€”β€”
snocCases_snoc πŸ“–mathematicalβ€”snocCases
snoc
β€”snocCases.eq_1
init_snoc
snoc_last
snocEquiv_apply πŸ“–mathematicalβ€”DFunLike.coe
Equiv
EquivLike.toFunLike
Equiv.instEquivLike
snocEquiv
snoc
β€”β€”
snocEquiv_symm_apply πŸ“–mathematicalβ€”DFunLike.coe
Equiv
EquivLike.toFunLike
Equiv.instEquivLike
Equiv.symm
snocEquiv
init
β€”β€”
snoc_apply_zero πŸ“–mathematicalβ€”snocβ€”snoc_castSucc
snoc_castAdd πŸ“–mathematicalβ€”snocβ€”β€”
snoc_castSucc πŸ“–mathematicalβ€”snocβ€”β€”
snoc_comp_castAdd πŸ“–mathematicalβ€”snocβ€”snoc_castAdd
snoc_comp_castSucc πŸ“–mathematicalβ€”snocβ€”snoc_castSucc
snoc_comp_natAdd πŸ“–mathematicalβ€”snocβ€”snoc_last
snoc_castSucc
snoc_comp_rev πŸ“–mathematicalβ€”snoc
cons
β€”snoc_rev
snoc_eq_append πŸ“–mathematicalβ€”snoc
append
cons
β€”append_right_eq_snoc
snoc_init_self πŸ“–mathematicalβ€”snoc
init
β€”snoc_last
snoc_castSucc
snoc_inj πŸ“–mathematicalβ€”snocβ€”Function.Injective2.eq_iff
snoc_injective2
snoc_injective2 πŸ“–mathematicalβ€”Function.Injective2
snoc
β€”snoc_castSucc
snoc_last
snoc_injective_iff πŸ“–mathematicalβ€”snoc
Set
Set.instMembership
Set.range
β€”snoc_comp_castSucc
castSucc_injective
ne_last_of_lt
snoc_castSucc
snoc_last
snoc_injective_of_injective
snoc_injective_of_injective πŸ“–mathematicalSet
Set.instMembership
Set.range
snocβ€”snoc_last
snoc_castSucc
Set.mem_range_self
snoc_last πŸ“–mathematicalβ€”snocβ€”β€”
snoc_left_injective πŸ“–mathematicalβ€”snocβ€”Function.Injective2.left
snoc_injective2
snoc_rev πŸ“–mathematicalβ€”snoc
cons
β€”insertNth_last'
insertNth_zero'
insertNth_rev
snoc_right_injective πŸ“–mathematicalβ€”snocβ€”Function.Injective2.right
snoc_injective2
snoc_update πŸ“–mathematicalβ€”snoc
Function.update
β€”snoc_last
Function.update_of_ne
eq_or_ne
snoc_castSucc
Function.update_self
snoc_zero πŸ“–mathematicalβ€”snocβ€”β€”
succAbove_cases_eq_insertNth πŸ“–mathematicalβ€”succAboveCases
insertNth
β€”β€”
tail_cons πŸ“–mathematicalβ€”tail
cons
β€”β€”
tail_def πŸ“–mathematicalβ€”tailβ€”β€”
tail_init_eq_init_tail πŸ“–mathematicalβ€”tail
init
β€”β€”
tail_update_succ πŸ“–mathematicalβ€”tail
Function.update
β€”Function.update_self
Function.update_of_ne
succ_injective
tail_update_zero πŸ“–mathematicalβ€”tail
Function.update
β€”Function.update_of_ne
tuple0_le πŸ“–mathematicalβ€”Pi.hasLe
Preorder.toLE
β€”β€”
update_cons_zero πŸ“–mathematicalβ€”Function.update
cons
β€”Function.update_self
cons_zero
Function.update_of_ne
cons_succ
update_insertNth πŸ“–mathematicalβ€”Function.update
insertNth
β€”Function.update_self
removeNth_update
removeNth_insertNth
update_snoc_last πŸ“–mathematicalβ€”Function.update
snoc
β€”Function.update_self
snoc_last
Function.update_of_ne
snoc_castSucc
val_find πŸ“–mathematicalβ€”find
Nat.find
β€”Nat.find_eq_iff
find_spec
find_min

(root)

Definitions

NameCategoryTheorems
piFinTwoEquiv πŸ“–CompOp
9 mathmath: Function.FromTypes.curry_two_eq_curry, Finset.Nat.antidiagonalTuple_two, finTwoArrowEquiv_apply, Function.FromTypes.uncurry_two_eq_uncurry, Nat.image_piFinTwoEquiv_finMulAntidiag, piFinTwoEquiv_apply, RingEquiv.piFinTwo_symm_apply, RingEquiv.piFinTwo_apply, piFinTwoEquiv_symm_apply

Theorems

NameKindAssumesProvesValidatesDepends On
piFinTwoEquiv_apply πŸ“–mathematicalβ€”DFunLike.coe
Equiv
EquivLike.toFunLike
Equiv.instEquivLike
piFinTwoEquiv
β€”β€”
piFinTwoEquiv_symm_apply πŸ“–mathematicalβ€”DFunLike.coe
Equiv
EquivLike.toFunLike
Equiv.instEquivLike
Equiv.symm
piFinTwoEquiv
Fin.cons
finZeroElim
β€”β€”

---

← Back to Index