Loogle!
Result
Found 426 declarations mentioning Cardinal.lift. Of these, only the first 200 are shown.
- Cardinal.lift π Mathlib.SetTheory.Cardinal.Defs
(c : Cardinal.{v}) : Cardinal.{max v u} - Cardinal.lift_aleph0 π Mathlib.SetTheory.Cardinal.Defs
: Cardinal.lift.{u_1, u_2} Cardinal.aleph0 = Cardinal.aleph0 - Cardinal.lift_umax π Mathlib.SetTheory.Cardinal.Defs
: Cardinal.lift.{max u v, u} = Cardinal.lift.{v, u} - Cardinal.lift_id π Mathlib.SetTheory.Cardinal.Defs
(a : Cardinal.{u}) : Cardinal.lift.{u, u} a = a - Cardinal.lift_id' π Mathlib.SetTheory.Cardinal.Defs
(a : Cardinal.{max u v}) : Cardinal.lift.{u, max u v} a = a - Cardinal.lift_uzero π Mathlib.SetTheory.Cardinal.Defs
(a : Cardinal.{u}) : Cardinal.lift.{0, u} a = a - Cardinal.lift_lift π Mathlib.SetTheory.Cardinal.Defs
(a : Cardinal.{u_1}) : Cardinal.lift.{w, max v u_1} (Cardinal.lift.{v, u_1} a) = Cardinal.lift.{max v w, u_1} a - Cardinal.mk_uLift π Mathlib.SetTheory.Cardinal.Defs
(Ξ± : Type u) : Cardinal.mk (ULift.{v, u} Ξ±) = Cardinal.lift.{v, u} (Cardinal.mk Ξ±) - Cardinal.lift_mk_fin π Mathlib.SetTheory.Cardinal.Defs
(n : β) : Cardinal.lift.{u_1, 0} (Cardinal.mk (Fin n)) = βn - Cardinal.out_lift_equiv π Mathlib.SetTheory.Cardinal.Defs
(a : Cardinal.{u}) : Nonempty (Quotient.out (Cardinal.lift.{v, u} a) β Quotient.out a) - Cardinal.mk_congr_lift π Mathlib.SetTheory.Cardinal.Defs
{Ξ± : Type u} {Ξ² : Type v} (e : Ξ± β Ξ²) : Cardinal.lift.{v, u} (Cardinal.mk Ξ±) = Cardinal.lift.{u, v} (Cardinal.mk Ξ²) - Equiv.lift_cardinal_eq π Mathlib.SetTheory.Cardinal.Defs
{Ξ± : Type u} {Ξ² : Type v} (e : Ξ± β Ξ²) : Cardinal.lift.{v, u} (Cardinal.mk Ξ±) = Cardinal.lift.{u, v} (Cardinal.mk Ξ²) - Cardinal.lift_mk_eq π Mathlib.SetTheory.Cardinal.Defs
{Ξ± : Type u} {Ξ² : Type v} : Cardinal.lift.{max v w, u} (Cardinal.mk Ξ±) = Cardinal.lift.{max u w, v} (Cardinal.mk Ξ²) β Nonempty (Ξ± β Ξ²) - Cardinal.lift_mk_eq' π Mathlib.SetTheory.Cardinal.Defs
{Ξ± : Type u} {Ξ² : Type v} : Cardinal.lift.{v, u} (Cardinal.mk Ξ±) = Cardinal.lift.{u, v} (Cardinal.mk Ξ²) β Nonempty (Ξ± β Ξ²) - Cardinal.lift_one π Mathlib.SetTheory.Cardinal.Defs
: Cardinal.lift.{u_2, u_1} 1 = 1 - Cardinal.lift_prod π Mathlib.SetTheory.Cardinal.Defs
{ΞΉ : Type u} (c : ΞΉ β Cardinal.{v}) : Cardinal.lift.{w, max v u} (Cardinal.prod c) = Cardinal.prod fun i => Cardinal.lift.{w, v} (c i) - Cardinal.lift_sum π Mathlib.SetTheory.Cardinal.Defs
{ΞΉ : Type u} (f : ΞΉ β Cardinal.{v}) : Cardinal.lift.{w, max v u} (Cardinal.sum f) = Cardinal.sum fun i => Cardinal.lift.{w, v} (f i) - Cardinal.lift_zero π Mathlib.SetTheory.Cardinal.Defs
: Cardinal.lift.{u_2, u_1} 0 = 0 - Cardinal.sum_const π Mathlib.SetTheory.Cardinal.Defs
(ΞΉ : Type u) (a : Cardinal.{v}) : (Cardinal.sum fun x => a) = Cardinal.lift.{v, u} (Cardinal.mk ΞΉ) * Cardinal.lift.{u, v} a - Cardinal.mk_arrow π Mathlib.SetTheory.Cardinal.Defs
(Ξ± : Type u) (Ξ² : Type v) : Cardinal.mk (Ξ± β Ξ²) = Cardinal.lift.{u, v} (Cardinal.mk Ξ²) ^ Cardinal.lift.{v, u} (Cardinal.mk Ξ±) - Cardinal.mk_prod π Mathlib.SetTheory.Cardinal.Defs
(Ξ± : Type u) (Ξ² : Type v) : Cardinal.mk (Ξ± Γ Ξ²) = Cardinal.lift.{v, u} (Cardinal.mk Ξ±) * Cardinal.lift.{u, v} (Cardinal.mk Ξ²) - Cardinal.mk_psum π Mathlib.SetTheory.Cardinal.Defs
(Ξ± : Type u) (Ξ² : Type v) : Cardinal.mk (Ξ± β' Ξ²) = Cardinal.lift.{v, u} (Cardinal.mk Ξ±) + Cardinal.lift.{u, v} (Cardinal.mk Ξ²) - Cardinal.mk_sum π Mathlib.SetTheory.Cardinal.Defs
(Ξ± : Type u) (Ξ² : Type v) : Cardinal.mk (Ξ± β Ξ²) = Cardinal.lift.{v, u} (Cardinal.mk Ξ±) + Cardinal.lift.{u, v} (Cardinal.mk Ξ²) - Cardinal.prod_const π Mathlib.SetTheory.Cardinal.Defs
(ΞΉ : Type u) (a : Cardinal.{v}) : (Cardinal.prod fun x => a) = Cardinal.lift.{u, v} a ^ Cardinal.lift.{v, u} (Cardinal.mk ΞΉ) - Cardinal.lift_add π Mathlib.SetTheory.Cardinal.Defs
(a b : Cardinal.{u}) : Cardinal.lift.{v, u} (a + b) = Cardinal.lift.{v, u} a + Cardinal.lift.{v, u} b - Cardinal.lift_power π Mathlib.SetTheory.Cardinal.Defs
(a b : Cardinal.{u}) : Cardinal.lift.{v, u} (a ^ b) = Cardinal.lift.{v, u} a ^ Cardinal.lift.{v, u} b - Cardinal.lift_power_sum π Mathlib.SetTheory.Cardinal.Defs
{ΞΉ : Type u} (a : Cardinal.{v}) (f : ΞΉ β Cardinal.{v}) : Cardinal.lift.{u, v} a ^ Cardinal.sum f = Cardinal.prod fun i => a ^ f i - Cardinal.mk_pi_congr_lift π Mathlib.SetTheory.Cardinal.Defs
{ΞΉ : Type v} {ΞΉ' : Type v'} {f : ΞΉ β Type w} {g : ΞΉ' β Type w'} (e : ΞΉ β ΞΉ') (h : β (i : ΞΉ), Cardinal.lift.{w', w} (Cardinal.mk (f i)) = Cardinal.lift.{w, w'} (Cardinal.mk (g (e i)))) : Cardinal.lift.{max v' w', max v w} (Cardinal.mk ((i : ΞΉ) β f i)) = Cardinal.lift.{max v w, max v' w'} (Cardinal.mk ((i : ΞΉ') β g i)) - Cardinal.mk_sigma_congr_lift π Mathlib.SetTheory.Cardinal.Defs
{ΞΉ : Type v} {ΞΉ' : Type v'} {f : ΞΉ β Type w} {g : ΞΉ' β Type w'} (e : ΞΉ β ΞΉ') (h : β (i : ΞΉ), Cardinal.lift.{w', w} (Cardinal.mk (f i)) = Cardinal.lift.{w, w'} (Cardinal.mk (g (e i)))) : Cardinal.lift.{max v' w', max w v} (Cardinal.mk ((i : ΞΉ) Γ f i)) = Cardinal.lift.{max v w, max w' v'} (Cardinal.mk ((i : ΞΉ') Γ g i)) - Cardinal.lift_injective π Mathlib.SetTheory.Cardinal.Order
: Function.Injective Cardinal.lift.{u, v} - Cardinal.lift_monotone π Mathlib.SetTheory.Cardinal.Order
: Monotone Cardinal.lift.{u_2, u_1} - Cardinal.lift_strictMono π Mathlib.SetTheory.Cardinal.Order
: StrictMono Cardinal.lift.{u_2, u_1} - Cardinal.aleph0_eq_lift π Mathlib.SetTheory.Cardinal.Order
{c : Cardinal.{u}} : Cardinal.aleph0 = Cardinal.lift.{v, u} c β Cardinal.aleph0 = c - Cardinal.lift_eq_aleph0 π Mathlib.SetTheory.Cardinal.Order
{c : Cardinal.{u}} : Cardinal.lift.{v, u} c = Cardinal.aleph0 β c = Cardinal.aleph0 - Cardinal.lift_natCast π Mathlib.SetTheory.Cardinal.Order
(n : β) : Cardinal.lift.{u, v} βn = βn - Cardinal.aleph0_le_lift π Mathlib.SetTheory.Cardinal.Order
{c : Cardinal.{u}} : Cardinal.aleph0 β€ Cardinal.lift.{v, u} c β Cardinal.aleph0 β€ c - Cardinal.lift_inj π Mathlib.SetTheory.Cardinal.Order
{a b : Cardinal.{u}} : Cardinal.lift.{v, u} a = Cardinal.lift.{v, u} b β a = b - Cardinal.lift_le_aleph0 π Mathlib.SetTheory.Cardinal.Order
{c : Cardinal.{u}} : Cardinal.lift.{v, u} c β€ Cardinal.aleph0 β c β€ Cardinal.aleph0 - Cardinal.lift_le_sum π Mathlib.SetTheory.Cardinal.Order
{ΞΉ : Type u} (f : ΞΉ β Cardinal.{v}) (i : ΞΉ) : Cardinal.lift.{u, v} (f i) β€ Cardinal.sum f - Cardinal.lift_le π Mathlib.SetTheory.Cardinal.Order
{a b : Cardinal.{v}} : Cardinal.lift.{u, v} a β€ Cardinal.lift.{u, v} b β a β€ b - Cardinal.lift_umax_eq π Mathlib.SetTheory.Cardinal.Order
{a : Cardinal.{u}} {b : Cardinal.{v}} : Cardinal.lift.{max v w, u} a = Cardinal.lift.{max u w, v} b β Cardinal.lift.{v, u} a = Cardinal.lift.{u, v} b - Cardinal.lift_mk_le π Mathlib.SetTheory.Cardinal.Order
{Ξ± : Type v} {Ξ² : Type w} : Cardinal.lift.{max u w, v} (Cardinal.mk Ξ±) β€ Cardinal.lift.{max u v, w} (Cardinal.mk Ξ²) β Nonempty (Ξ± βͺ Ξ²) - Cardinal.lift_mk_le' π Mathlib.SetTheory.Cardinal.Order
{Ξ± : Type u} {Ξ² : Type v} : Cardinal.lift.{v, u} (Cardinal.mk Ξ±) β€ Cardinal.lift.{u, v} (Cardinal.mk Ξ²) β Nonempty (Ξ± βͺ Ξ²) - Cardinal.lift_eq_nat_iff π Mathlib.SetTheory.Cardinal.Order
{a : Cardinal.{u}} {n : β} : Cardinal.lift.{v, u} a = βn β a = βn - Cardinal.nat_eq_lift_iff π Mathlib.SetTheory.Cardinal.Order
{n : β} {a : Cardinal.{u}} : βn = Cardinal.lift.{v, u} a β βn = a - Cardinal.lift_succ π Mathlib.SetTheory.Cardinal.Order
(a : Cardinal.{u}) : Cardinal.lift.{v, u} (Order.succ a) = Order.succ (Cardinal.lift.{v, u} a) - Cardinal.mem_range_lift_of_le π Mathlib.SetTheory.Cardinal.Order
{a : Cardinal.{u}} {b : Cardinal.{max u v}} : b β€ Cardinal.lift.{v, u} a β b β Set.range Cardinal.lift.{v, u} - Cardinal.lift_le_nat_iff π Mathlib.SetTheory.Cardinal.Order
{a : Cardinal.{u}} {n : β} : Cardinal.lift.{v, u} a β€ βn β a β€ βn - Cardinal.nat_le_lift_iff π Mathlib.SetTheory.Cardinal.Order
{n : β} {a : Cardinal.{u}} : βn β€ Cardinal.lift.{v, u} a β βn β€ a - Cardinal.aleph0_lt_lift π Mathlib.SetTheory.Cardinal.Order
{c : Cardinal.{u}} : Cardinal.aleph0 < Cardinal.lift.{v, u} c β Cardinal.aleph0 < c - Cardinal.lift_eq_one π Mathlib.SetTheory.Cardinal.Order
{a : Cardinal.{v}} : Cardinal.lift.{u, v} a = 1 β a = 1 - Cardinal.lift_eq_zero π Mathlib.SetTheory.Cardinal.Order
{a : Cardinal.{v}} : Cardinal.lift.{u, v} a = 0 β a = 0 - Cardinal.lift_lt_aleph0 π Mathlib.SetTheory.Cardinal.Order
{c : Cardinal.{u}} : Cardinal.lift.{v, u} c < Cardinal.aleph0 β c < Cardinal.aleph0 - Cardinal.one_eq_lift_iff π Mathlib.SetTheory.Cardinal.Order
{a : Cardinal.{u}} : 1 = Cardinal.lift.{v, u} a β 1 = a - Cardinal.zero_eq_lift_iff π Mathlib.SetTheory.Cardinal.Order
{a : Cardinal.{u}} : 0 = Cardinal.lift.{v, u} a β 0 = a - Cardinal.lift_ofNat π Mathlib.SetTheory.Cardinal.Order
(n : β) [n.AtLeastTwo] : Cardinal.lift.{u, v} (OfNat.ofNat n) = OfNat.ofNat n - Cardinal.le_lift_iff π Mathlib.SetTheory.Cardinal.Order
{a : Cardinal.{u}} {b : Cardinal.{max u v}} : b β€ Cardinal.lift.{v, u} a β β a' β€ a, Cardinal.lift.{v, u} a' = b - Cardinal.lift_le_one_iff π Mathlib.SetTheory.Cardinal.Order
{a : Cardinal.{u}} : Cardinal.lift.{v, u} a β€ 1 β a β€ 1 - Cardinal.lift_lt π Mathlib.SetTheory.Cardinal.Order
{a b : Cardinal.{u}} : Cardinal.lift.{v, u} a < Cardinal.lift.{v, u} b β a < b - Cardinal.one_le_lift_iff π Mathlib.SetTheory.Cardinal.Order
{a : Cardinal.{u}} : 1 β€ Cardinal.lift.{v, u} a β 1 β€ a - Cardinal.lift_mul π Mathlib.SetTheory.Cardinal.Order
(a b : Cardinal.{u}) : Cardinal.lift.{v, u} (a * b) = Cardinal.lift.{v, u} a * Cardinal.lift.{v, u} b - Cardinal.lift_lt_nat_iff π Mathlib.SetTheory.Cardinal.Order
{a : Cardinal.{u}} {n : β} : Cardinal.lift.{v, u} a < βn β a < βn - Cardinal.nat_lt_lift_iff π Mathlib.SetTheory.Cardinal.Order
{n : β} {a : Cardinal.{u}} : βn < Cardinal.lift.{v, u} a β βn < a - Cardinal.lift_eq_ofNat_iff π Mathlib.SetTheory.Cardinal.Order
{a : Cardinal.{u}} {n : β} [n.AtLeastTwo] : Cardinal.lift.{v, u} a = OfNat.ofNat n β a = OfNat.ofNat n - Cardinal.ofNat_eq_lift_iff π Mathlib.SetTheory.Cardinal.Order
{a : Cardinal.{u}} {n : β} [n.AtLeastTwo] : OfNat.ofNat n = Cardinal.lift.{v, u} a β OfNat.ofNat n = a - Cardinal.lift_le_ofNat_iff π Mathlib.SetTheory.Cardinal.Order
{a : Cardinal.{u}} {n : β} [n.AtLeastTwo] : Cardinal.lift.{v, u} a β€ OfNat.ofNat n β a β€ OfNat.ofNat n - Cardinal.ofNat_le_lift_iff π Mathlib.SetTheory.Cardinal.Order
{a : Cardinal.{u}} {n : β} [n.AtLeastTwo] : OfNat.ofNat n β€ Cardinal.lift.{v, u} a β OfNat.ofNat n β€ a - Cardinal.lt_lift_iff π Mathlib.SetTheory.Cardinal.Order
{a : Cardinal.{u}} {b : Cardinal.{max u v}} : b < Cardinal.lift.{v, u} a β β a' < a, Cardinal.lift.{v, u} a' = b - Cardinal.one_lt_lift_iff π Mathlib.SetTheory.Cardinal.Order
{a : Cardinal.{u}} : 1 < Cardinal.lift.{v, u} a β 1 < a - Cardinal.zero_lt_lift_iff π Mathlib.SetTheory.Cardinal.Order
{a : Cardinal.{u}} : 0 < Cardinal.lift.{v, u} a β 0 < a - Cardinal.lift_max π Mathlib.SetTheory.Cardinal.Order
{a b : Cardinal.{v}} : Cardinal.lift.{u, v} (max a b) = max (Cardinal.lift.{u, v} a) (Cardinal.lift.{u, v} b) - Cardinal.lift_min π Mathlib.SetTheory.Cardinal.Order
{a b : Cardinal.{v}} : Cardinal.lift.{u, v} (min a b) = min (Cardinal.lift.{u, v} a) (Cardinal.lift.{u, v} b) - Cardinal.lift_lt_ofNat_iff π Mathlib.SetTheory.Cardinal.Order
{a : Cardinal.{u}} {n : β} [n.AtLeastTwo] : Cardinal.lift.{v, u} a < OfNat.ofNat n β a < OfNat.ofNat n - Cardinal.ofNat_lt_lift_iff π Mathlib.SetTheory.Cardinal.Order
{a : Cardinal.{u}} {n : β} [n.AtLeastTwo] : OfNat.ofNat n < Cardinal.lift.{v, u} a β OfNat.ofNat n < a - Cardinal.lift_two π Mathlib.SetTheory.Cardinal.Order
: Cardinal.lift.{u, v} 2 = 2 - Cardinal.lift_mk_le_lift_mk_mul_of_lift_mk_preimage_le π Mathlib.SetTheory.Cardinal.Order
{Ξ± : Type u} {Ξ² : Type v} {c : Cardinal.{max u v}} (f : Ξ± β Ξ²) (hf : β (b : Ξ²), Cardinal.lift.{v, u} (Cardinal.mk β(f β»ΒΉ' {b})) β€ c) : Cardinal.lift.{v, u} (Cardinal.mk Ξ±) β€ Cardinal.lift.{u, v} (Cardinal.mk Ξ²) * c - Cardinal.liftInitialSeg_toFun π Mathlib.SetTheory.Cardinal.Order
(c : Cardinal.{u}) : Cardinal.liftInitialSeg c = Cardinal.lift.{v, u} c - Cardinal.lift_two_power π Mathlib.SetTheory.Cardinal.Order
(a : Cardinal.{u_1}) : Cardinal.lift.{v, u_1} (2 ^ a) = 2 ^ Cardinal.lift.{v, u_1} a - Cardinal.lift_mk_shrink'' π Mathlib.SetTheory.Cardinal.Basic
(Ξ± : Type (max u v)) [Small.{v, max u v} Ξ±] : Cardinal.lift.{u, v} (Cardinal.mk (Shrink.{v, max u v} Ξ±)) = Cardinal.mk Ξ± - Cardinal.lift_mk_shrink π Mathlib.SetTheory.Cardinal.Basic
(Ξ± : Type u) [Small.{v, u} Ξ±] : Cardinal.lift.{max u w, v} (Cardinal.mk (Shrink.{v, u} Ξ±)) = Cardinal.lift.{max v w, u} (Cardinal.mk Ξ±) - Cardinal.lift_mk_shrink' π Mathlib.SetTheory.Cardinal.Basic
(Ξ± : Type u) [Small.{v, u} Ξ±] : Cardinal.lift.{u, v} (Cardinal.mk (Shrink.{v, u} Ξ±)) = Cardinal.lift.{v, u} (Cardinal.mk Ξ±) - Cardinal.lift_mk_le_lift_mk_of_injective π Mathlib.SetTheory.Cardinal.Basic
{Ξ± : Type u} {Ξ² : Type v} {f : Ξ± β Ξ²} (hf : Function.Injective f) : Cardinal.lift.{v, u} (Cardinal.mk Ξ±) β€ Cardinal.lift.{u, v} (Cardinal.mk Ξ²) - Cardinal.lift_mk_le_lift_mk_of_surjective π Mathlib.SetTheory.Cardinal.Basic
{Ξ± : Type u} {Ξ² : Type v} {f : Ξ± β Ξ²} (hf : Function.Surjective f) : Cardinal.lift.{u, v} (Cardinal.mk Ξ²) β€ Cardinal.lift.{v, u} (Cardinal.mk Ξ±) - Cardinal.mk_range_le_lift π Mathlib.SetTheory.Cardinal.Basic
{Ξ± : Type u} {Ξ² : Type v} {f : Ξ± β Ξ²} : Cardinal.lift.{u, v} (Cardinal.mk β(Set.range f)) β€ Cardinal.lift.{v, u} (Cardinal.mk Ξ±) - Cardinal.mk_range_inl π Mathlib.SetTheory.Cardinal.Basic
{Ξ± : Type u} {Ξ² : Type v} : Cardinal.mk β(Set.range Sum.inl) = Cardinal.lift.{v, u} (Cardinal.mk Ξ±) - Cardinal.mk_range_inr π Mathlib.SetTheory.Cardinal.Basic
{Ξ± : Type u} {Ξ² : Type v} : Cardinal.mk β(Set.range Sum.inr) = Cardinal.lift.{u, v} (Cardinal.mk Ξ²) - Cardinal.mk_preimage_down π Mathlib.SetTheory.Cardinal.Basic
{Ξ± : Type u} {s : Set Ξ±} : Cardinal.mk β(ULift.down β»ΒΉ' s) = Cardinal.lift.{v, u} (Cardinal.mk βs) - Cardinal.mk_range_eq_of_injective π Mathlib.SetTheory.Cardinal.Basic
{Ξ± : Type u} {Ξ² : Type v} {f : Ξ± β Ξ²} (hf : Function.Injective f) : Cardinal.lift.{u, v} (Cardinal.mk β(Set.range f)) = Cardinal.lift.{v, u} (Cardinal.mk Ξ±) - Cardinal.prod_eq_of_fintype π Mathlib.SetTheory.Cardinal.Basic
{Ξ± : Type u} [h : Fintype Ξ±] (f : Ξ± β Cardinal.{v}) : Cardinal.prod f = Cardinal.lift.{u, v} (β i, f i) - Cardinal.mk_image_le_lift π Mathlib.SetTheory.Cardinal.Basic
{Ξ± : Type u} {Ξ² : Type v} {f : Ξ± β Ξ²} {s : Set Ξ±} : Cardinal.lift.{u, v} (Cardinal.mk β(f '' s)) β€ Cardinal.lift.{v, u} (Cardinal.mk βs) - Cardinal.mk_iUnion_le_sum_mk_lift π Mathlib.SetTheory.Cardinal.Basic
{Ξ± : Type u} {ΞΉ : Type v} {f : ΞΉ β Set Ξ±} : Cardinal.lift.{v, u} (Cardinal.mk β(β i, f i)) β€ Cardinal.sum fun i => Cardinal.mk β(f i) - Cardinal.mk_image_eq_lift π Mathlib.SetTheory.Cardinal.Basic
{Ξ± : Type u} {Ξ² : Type v} (f : Ξ± β Ξ²) (s : Set Ξ±) (h : Function.Injective f) : Cardinal.lift.{u, v} (Cardinal.mk β(f '' s)) = Cardinal.lift.{v, u} (Cardinal.mk βs) - Cardinal.mk_image_eq_of_injOn_lift π Mathlib.SetTheory.Cardinal.Basic
{Ξ± : Type u} {Ξ² : Type v} (f : Ξ± β Ξ²) (s : Set Ξ±) (h : Set.InjOn f s) : Cardinal.lift.{u, v} (Cardinal.mk β(f '' s)) = Cardinal.lift.{v, u} (Cardinal.mk βs) - Cardinal.mk_preimage_of_injective_lift π Mathlib.SetTheory.Cardinal.Basic
{Ξ± : Type u} {Ξ² : Type v} (f : Ξ± β Ξ²) (s : Set Ξ²) (h : Function.Injective f) : Cardinal.lift.{v, u} (Cardinal.mk β(f β»ΒΉ' s)) β€ Cardinal.lift.{u, v} (Cardinal.mk βs) - Cardinal.lift_iSup_le_sum π Mathlib.SetTheory.Cardinal.Basic
{ΞΉ : Type u} [Small.{v, u} ΞΉ] (f : ΞΉ β Cardinal.{v}) : Cardinal.lift.{u, v} (β¨ i, f i) β€ Cardinal.sum f - Cardinal.mk_image_embedding_lift π Mathlib.SetTheory.Cardinal.Basic
{Ξ± : Type u} {Ξ² : Type v} (f : Ξ± βͺ Ξ²) (s : Set Ξ±) : Cardinal.lift.{u, v} (Cardinal.mk β(βf '' s)) = Cardinal.lift.{v, u} (Cardinal.mk βs) - Cardinal.mk_preimage_of_subset_range_lift π Mathlib.SetTheory.Cardinal.Basic
{Ξ± : Type u} {Ξ² : Type v} (f : Ξ± β Ξ²) (s : Set Ξ²) (h : s β Set.range f) : Cardinal.lift.{u, v} (Cardinal.mk βs) β€ Cardinal.lift.{v, u} (Cardinal.mk β(f β»ΒΉ' s)) - Cardinal.mk_preimage_of_injective_of_subset_range_lift π Mathlib.SetTheory.Cardinal.Basic
{Ξ± : Type u} {Ξ² : Type v} (f : Ξ± β Ξ²) (s : Set Ξ²) (h : Function.Injective f) (h2 : s β Set.range f) : Cardinal.lift.{v, u} (Cardinal.mk β(f β»ΒΉ' s)) = Cardinal.lift.{u, v} (Cardinal.mk βs) - Cardinal.sum_le_lift_mk_mul_iSup π Mathlib.SetTheory.Cardinal.Basic
{ΞΉ : Type u} (f : ΞΉ β Cardinal.{max u v}) : Cardinal.sum f β€ Cardinal.lift.{v, u} (Cardinal.mk ΞΉ) * β¨ i, f i - Cardinal.lift_sInf π Mathlib.SetTheory.Cardinal.Basic
(s : Set Cardinal.{v}) : Cardinal.lift.{u, v} (sInf s) = sInf (Cardinal.lift.{u, v} '' s) - Cardinal.sum_le_lift_mk_mul_iSup_lift π Mathlib.SetTheory.Cardinal.Basic
{ΞΉ : Type u} (f : ΞΉ β Cardinal.{v}) : Cardinal.sum f β€ Cardinal.lift.{v, u} (Cardinal.mk ΞΉ) * β¨ i, Cardinal.lift.{u, v} (f i) - Cardinal.lift_iInf π Mathlib.SetTheory.Cardinal.Basic
{ΞΉ : Sort u_1} (f : ΞΉ β Cardinal.{v}) : Cardinal.lift.{u, v} (iInf f) = β¨ i, Cardinal.lift.{u, v} (f i) - Cardinal.lift_iSup_le π Mathlib.SetTheory.Cardinal.Basic
{ΞΉ : Type v} {f : ΞΉ β Cardinal.{w}} {t : Cardinal.{max u w}} (hf : BddAbove (Set.range f)) (w : β (i : ΞΉ), Cardinal.lift.{u, w} (f i) β€ t) : Cardinal.lift.{u, w} (iSup f) β€ t - Cardinal.mk_preimage_equiv_lift π Mathlib.SetTheory.Cardinal.Basic
{Ξ± : Type u} {Ξ² : Type v} (f : Ξ± β Ξ²) (s : Set Ξ²) : Cardinal.lift.{v, u} (Cardinal.mk β(βf β»ΒΉ' s)) = Cardinal.lift.{u, v} (Cardinal.mk βs) - Cardinal.lift_iSup_le_iff π Mathlib.SetTheory.Cardinal.Basic
{ΞΉ : Type v} {f : ΞΉ β Cardinal.{w}} (hf : BddAbove (Set.range f)) {t : Cardinal.{max u w}} : Cardinal.lift.{u, w} (iSup f) β€ t β β (i : ΞΉ), Cardinal.lift.{u, w} (f i) β€ t - Cardinal.lift_sSup π Mathlib.SetTheory.Cardinal.Basic
{s : Set Cardinal.{u_1}} (hs : BddAbove s) : Cardinal.lift.{u, u_1} (sSup s) = sSup (Cardinal.lift.{u, u_1} '' s) - Cardinal.lift_iSup π Mathlib.SetTheory.Cardinal.Basic
{ΞΉ : Type v} {f : ΞΉ β Cardinal.{w}} (hf : BddAbove (Set.range f)) : Cardinal.lift.{u, w} (iSup f) = β¨ i, Cardinal.lift.{u, w} (f i) - Cardinal.mk_iUnion_le_lift π Mathlib.SetTheory.Cardinal.Basic
{Ξ± : Type u} {ΞΉ : Type v} (f : ΞΉ β Set Ξ±) : Cardinal.lift.{v, u} (Cardinal.mk β(β i, f i)) β€ Cardinal.lift.{u, v} (Cardinal.mk ΞΉ) * β¨ i, Cardinal.lift.{v, u} (Cardinal.mk β(f i)) - Cardinal.mk_subset_ge_of_subset_image_lift π Mathlib.SetTheory.Cardinal.Basic
{Ξ± : Type u} {Ξ² : Type v} (f : Ξ± β Ξ²) {s : Set Ξ±} {t : Set Ξ²} (h : t β f '' s) : Cardinal.lift.{u, v} (Cardinal.mk βt) β€ Cardinal.lift.{v, u} (Cardinal.mk β{x | x β s β§ f x β t}) - Cardinal.mk_iUnion_eq_sum_mk_lift π Mathlib.SetTheory.Cardinal.Basic
{Ξ± : Type u} {ΞΉ : Type v} {f : ΞΉ β Set Ξ±} (h : Pairwise (Function.onFun Disjoint f)) : Cardinal.lift.{v, u} (Cardinal.mk β(β i, f i)) = Cardinal.sum fun i => Cardinal.mk β(f i) - Cardinal.lift_iSup_le_lift_iSup π Mathlib.SetTheory.Cardinal.Basic
{ΞΉ : Type v} {ΞΉ' : Type v'} {f : ΞΉ β Cardinal.{w}} {f' : ΞΉ' β Cardinal.{w'}} (hf : BddAbove (Set.range f)) (hf' : BddAbove (Set.range f')) {g : ΞΉ β ΞΉ'} (h : β (i : ΞΉ), Cardinal.lift.{w', w} (f i) β€ Cardinal.lift.{w, w'} (f' (g i))) : Cardinal.lift.{w', w} (iSup f) β€ Cardinal.lift.{w, w'} (iSup f') - Cardinal.lift_iSup_le_lift_iSup' π Mathlib.SetTheory.Cardinal.Basic
{ΞΉ : Type v} {ΞΉ' : Type v'} {f : ΞΉ β Cardinal.{v}} {f' : ΞΉ' β Cardinal.{v'}} (hf : BddAbove (Set.range f)) (hf' : BddAbove (Set.range f')) (g : ΞΉ β ΞΉ') (h : β (i : ΞΉ), Cardinal.lift.{v', v} (f i) β€ Cardinal.lift.{v, v'} (f' (g i))) : Cardinal.lift.{v', v} (iSup f) β€ Cardinal.lift.{v, v'} (iSup f') - Cardinal.mk_biUnion_le_lift π Mathlib.SetTheory.Cardinal.Basic
{Ξ± : Type u} {ΞΉ : Type v} (A : ΞΉ β Set Ξ±) (s : Set ΞΉ) : Cardinal.lift.{v, u} (Cardinal.mk β(β x β s, A x)) β€ Cardinal.lift.{u, v} (Cardinal.mk βs) * β¨ x, Cardinal.lift.{v, u} (Cardinal.mk β(A βx)) - Cardinal.lift_ofENat π Mathlib.SetTheory.Cardinal.ENat
(m : ββ) : Cardinal.lift.{u, v} βm = βm - Cardinal.lift_eq_ofENat π Mathlib.SetTheory.Cardinal.ENat
{x : Cardinal.{v}} {m : ββ} : Cardinal.lift.{u, v} x = βm β x = βm - Cardinal.ofENat_eq_lift π Mathlib.SetTheory.Cardinal.ENat
{x : Cardinal.{v}} {m : ββ} : βm = Cardinal.lift.{u, v} x β βm = x - Cardinal.lift_le_ofENat π Mathlib.SetTheory.Cardinal.ENat
{x : Cardinal.{v}} {m : ββ} : Cardinal.lift.{u, v} x β€ βm β x β€ βm - Cardinal.ofENat_le_lift π Mathlib.SetTheory.Cardinal.ENat
{x : Cardinal.{v}} {m : ββ} : βm β€ Cardinal.lift.{u, v} x β βm β€ x - Cardinal.lift_lt_ofENat π Mathlib.SetTheory.Cardinal.ENat
{x : Cardinal.{v}} {m : ββ} : Cardinal.lift.{u, v} x < βm β x < βm - Cardinal.ofENat_lt_lift π Mathlib.SetTheory.Cardinal.ENat
{x : Cardinal.{v}} {m : ββ} : βm < Cardinal.lift.{u, v} x β βm < x - Cardinal.toENat_lift π Mathlib.SetTheory.Cardinal.ENat
{c : Cardinal.{u}} : Cardinal.toENat (Cardinal.lift.{v, u} c) = Cardinal.toENat c - Cardinal.toNat_lift π Mathlib.SetTheory.Cardinal.ToNat
(c : Cardinal.{v}) : Cardinal.toNat (Cardinal.lift.{u, v} c) = Cardinal.toNat c - Cardinal.toNat_lift_add_lift π Mathlib.SetTheory.Cardinal.ToNat
{a : Cardinal.{u}} {b : Cardinal.{v}} (ha : a < Cardinal.aleph0) (hb : b < Cardinal.aleph0) : Cardinal.toNat (Cardinal.lift.{v, u} a + Cardinal.lift.{u, v} b) = Cardinal.toNat a + Cardinal.toNat b - LinearIndependent.cardinal_lift_le_rank π Mathlib.LinearAlgebra.Dimension.Basic
{R : Type u} {M : Type v} [Semiring R] [AddCommMonoid M] [Module R M] [Nontrivial R] {ΞΉ : Type w} {v : ΞΉ β M} (hv : LinearIndependent R v) : Cardinal.lift.{v, w} (Cardinal.mk ΞΉ) β€ Cardinal.lift.{w, v} (Module.rank R M) - Module.exists_set_linearIndependent_of_lt_lift_rank π Mathlib.LinearAlgebra.Dimension.Basic
{R : Type u} {M : Type v} [Semiring R] [AddCommMonoid M] [Module R M] {c : Cardinal.{w}} (h : Cardinal.lift.{v, w} c < Cardinal.lift.{w, v} (Module.rank R M)) : β s, Cardinal.lift.{w, v} (Cardinal.mk βs) = Cardinal.lift.{v, w} c β§ LinearIndepOn R id s - LinearEquiv.lift_rank_eq π Mathlib.LinearAlgebra.Dimension.Basic
{R : Type u} {M : Type v} {M' : Type v'} [Semiring R] [AddCommMonoid M] [Module R M] [AddCommMonoid M'] [Module R M'] (f : M ββ[R] M') : Cardinal.lift.{v', v} (Module.rank R M) = Cardinal.lift.{v, v'} (Module.rank R M') - LinearMap.lift_rank_le_of_injective π Mathlib.LinearAlgebra.Dimension.Basic
{R : Type u} {M : Type v} {M' : Type v'} [Semiring R] [AddCommMonoid M] [Module R M] [AddCommMonoid M'] [Module R M'] (f : M ββ[R] M') (i : Function.Injective βf) : Cardinal.lift.{v', v} (Module.rank R M) β€ Cardinal.lift.{v, v'} (Module.rank R M') - LinearMap.lift_rank_le_of_surjective π Mathlib.LinearAlgebra.Dimension.Basic
{R : Type u} {M : Type v} {M' : Type v'} [Semiring R] [AddCommMonoid M] [Module R M] [AddCommMonoid M'] [Module R M'] (f : M ββ[R] M') (h : Function.Surjective βf) : Cardinal.lift.{v, v'} (Module.rank R M') β€ Cardinal.lift.{v', v} (Module.rank R M) - lift_rank_range_le π Mathlib.LinearAlgebra.Dimension.Basic
{R : Type u} {M : Type v} {M' : Type v'} [Semiring R] [AddCommMonoid M] [Module R M] [AddCommMonoid M'] [Module R M'] (f : M ββ[R] M') : Cardinal.lift.{v, v'} (Module.rank R β₯f.range) β€ Cardinal.lift.{v', v} (Module.rank R M) - lift_rank_range_of_injective π Mathlib.LinearAlgebra.Dimension.Basic
{R : Type u} {M : Type v} {M' : Type v'} [Semiring R] [AddCommMonoid M] [Module R M] [AddCommMonoid M'] [Module R M'] (f : M ββ[R] M') (h : Function.Injective βf) : Cardinal.lift.{v, v'} (Module.rank R β₯f.range) = Cardinal.lift.{v', v} (Module.rank R M) - Algebra.lift_rank_eq_of_equiv_equiv π Mathlib.LinearAlgebra.Dimension.Basic
{R : Type w} {S : Type v} [CommSemiring R] [Semiring S] [Algebra R S] {R' : Type w'} {S' : Type v'} [CommSemiring R'] [Semiring S'] [Algebra R' S'] (i : R β+* R') (j : S β+* S') (hc : (algebraMap R' S').comp i.toRingHom = j.toRingHom.comp (algebraMap R S)) : Cardinal.lift.{v', v} (Module.rank R S) = Cardinal.lift.{v, v'} (Module.rank R' S') - lift_rank_map_le π Mathlib.LinearAlgebra.Dimension.Basic
{R : Type u} {M : Type v} {M' : Type v'} [Semiring R] [AddCommMonoid M] [Module R M] [AddCommMonoid M'] [Module R M'] (f : M ββ[R] M') (p : Submodule R M) : Cardinal.lift.{v, v'} (Module.rank R β₯(Submodule.map f p)) β€ Cardinal.lift.{v', v} (Module.rank R β₯p) - Algebra.lift_rank_le_of_injective_injective π Mathlib.LinearAlgebra.Dimension.Basic
{R : Type w} {S : Type v} [CommSemiring R] [Semiring S] [Algebra R S] {R' : Type w'} {S' : Type v'} [CommSemiring R'] [Semiring S'] [Algebra R' S'] (i : R' β+* R) (j : S β+* S') (hi : Function.Injective βi) (hj : Function.Injective βj) (hc : (j.comp (algebraMap R S)).comp i = algebraMap R' S') : Cardinal.lift.{v', v} (Module.rank R S) β€ Cardinal.lift.{v, v'} (Module.rank R' S') - Algebra.lift_rank_le_of_surjective_injective π Mathlib.LinearAlgebra.Dimension.Basic
{R : Type w} {S : Type v} [CommSemiring R] [Semiring S] [Algebra R S] {R' : Type w'} {S' : Type v'} [CommSemiring R'] [Semiring S'] [Algebra R' S'] (i : R β+* R') (j : S β+* S') (hi : Function.Surjective βi) (hj : Function.Injective βj) (hc : (algebraMap R' S').comp i = j.comp (algebraMap R S)) : Cardinal.lift.{v', v} (Module.rank R S) β€ Cardinal.lift.{v, v'} (Module.rank R' S') - lift_rank_eq_of_equiv_equiv π Mathlib.LinearAlgebra.Dimension.Basic
{R : Type u} {R' : Type u'} {M : Type v} {M' : Type v'} [Semiring R] [AddCommMonoid M] [Module R M] [Semiring R'] [AddCommMonoid M'] [Module R' M'] (i : R β R') (j : M β+ M') (hi : Function.Bijective i) (hc : β (r : R) (m : M), j (r β’ m) = i r β’ j m) : Cardinal.lift.{v', v} (Module.rank R M) = Cardinal.lift.{v, v'} (Module.rank R' M') - lift_rank_le_of_injective_injectiveβ π Mathlib.LinearAlgebra.Dimension.Basic
{R : Type u} {R' : Type u'} {M : Type v} {M' : Type v'} [Semiring R] [AddCommMonoid M] [Module R M] [Semiring R'] [AddCommMonoid M'] [Module R' M'] (i : R' β R) (j : M β+ M') (hi : Function.Injective i) (hj : Function.Injective βj) (hc : β (r : R') (m : M), j (i r β’ m) = r β’ j m) : Cardinal.lift.{v', v} (Module.rank R M) β€ Cardinal.lift.{v, v'} (Module.rank R' M') - lift_rank_le_of_surjective_injective π Mathlib.LinearAlgebra.Dimension.Basic
{R : Type u} {R' : Type u'} {M : Type v} {M' : Type v'} [Semiring R] [AddCommMonoid M] [Module R M] [Semiring R'] [AddCommMonoid M'] [Module R' M'] (i : R β R') (j : M β+ M') (hi : Function.Surjective i) (hj : Function.Injective βj) (hc : β (r : R) (m : M), j (r β’ m) = i r β’ j m) : Cardinal.lift.{v', v} (Module.rank R M) β€ Cardinal.lift.{v, v'} (Module.rank R' M') - LinearEquiv.lift_rank_map_eq π Mathlib.LinearAlgebra.Dimension.Basic
{R : Type u} {M : Type v} {M' : Type v'} [Semiring R] [AddCommMonoid M] [Module R M] [AddCommMonoid M'] [Module R M'] (f : M ββ[R] M') (p : Submodule R M) : Cardinal.lift.{v, v'} (Module.rank R β₯(Submodule.map (βf) p)) = Cardinal.lift.{v', v} (Module.rank R β₯p) - Module.lift_rank_bot_le_lift_rank_of_isScalarTower π Mathlib.LinearAlgebra.Dimension.Basic
(R : Type u) (R' : Type u') [Semiring R] [Semiring R'] (T : Type w) [Module R R'] [NonAssocSemiring T] [Module R T] [Module R' T] [IsScalarTower R' T T] [FaithfulSMul R' T] [IsScalarTower R R' T] : Cardinal.lift.{w, u'} (Module.rank R R') β€ Cardinal.lift.{u', w} (Module.rank R T) - lift_rank_le_of_injective_injective π Mathlib.LinearAlgebra.Dimension.Basic
{R : Type u} {R' : Type u'} {M : Type v} {M' : Type v'} [Ring R] [AddCommGroup M] [Module R M] [Ring R'] [AddCommGroup M'] [Module R' M'] (i : R' β R) (j : M β+ M') (hi : β (r : R'), i r = 0 β r = 0) (hj : Function.Injective βj) (hc : β (r : R') (m : M), j (i r β’ m) = r β’ j m) : Cardinal.lift.{v', v} (Module.rank R M) β€ Cardinal.lift.{v, v'} (Module.rank R' M') - Module.finrank_le_finrank_of_rank_le_rank π Mathlib.LinearAlgebra.Dimension.Finrank
{R : Type u} {M : Type v} {N : Type w} [Semiring R] [AddCommMonoid M] [Module R M] [AddCommMonoid N] [Module R N] (h : Cardinal.lift.{w, v} (Module.rank R M) β€ Cardinal.lift.{v, w} (Module.rank R N)) (h' : Module.rank R N < Cardinal.aleph0) : Module.finrank R M β€ Module.finrank R N - OrderIso.lift_cof_congr π Mathlib.SetTheory.Cardinal.Cofinality.Basic
{Ξ± : Type u} {Ξ² : Type v} [Preorder Ξ±] [Preorder Ξ²] (f : Ξ± βo Ξ²) : Cardinal.lift.{v, u} (Order.cof Ξ±) = Cardinal.lift.{u, v} (Order.cof Ξ²) - OrderIso.lift_cof_eq π Mathlib.SetTheory.Cardinal.Cofinality.Basic
{Ξ± : Type u} {Ξ² : Type v} [Preorder Ξ±] [Preorder Ξ²] (f : Ξ± βo Ξ²) : Cardinal.lift.{v, u} (Order.cof Ξ±) = Cardinal.lift.{u, v} (Order.cof Ξ²) - GaloisConnection.cof_le_lift π Mathlib.SetTheory.Cardinal.Cofinality.Basic
{Ξ± : Type u} {Ξ² : Type v} [Preorder Ξ±] [Preorder Ξ²] {f : Ξ² β Ξ±} {g : Ξ± β Ξ²} (h : GaloisConnection f g) : Cardinal.lift.{u, v} (Order.cof Ξ²) β€ Cardinal.lift.{v, u} (Order.cof Ξ±) - Order.le_lift_cof_iff π Mathlib.SetTheory.Cardinal.Cofinality.Basic
{Ξ± : Type u} [Preorder Ξ±] {c : Cardinal.{max u v}} : c β€ Cardinal.lift.{v, u} (Order.cof Ξ±) β β (s : Set Ξ±), IsCofinal s β c β€ Cardinal.lift.{v, u} (Cardinal.mk βs) - Order.lift_cof_congr_of_strictMono π Mathlib.SetTheory.Cardinal.Cofinality.Basic
{Ξ± : Type u} {Ξ² : Type v} [LinearOrder Ξ±] [LinearOrder Ξ²] {f : Ξ± β Ξ²} (hf : StrictMono f) (hf' : IsCofinal (Set.range f)) : Cardinal.lift.{v, u} (Order.cof Ξ±) = Cardinal.lift.{u, v} (Order.cof Ξ²) - Cardinal.lift_ord π Mathlib.SetTheory.Ordinal.Basic
(c : Cardinal.{v}) : Ordinal.lift.{u, v} c.ord = (Cardinal.lift.{u, v} c).ord - Ordinal.lift_card π Mathlib.SetTheory.Ordinal.Basic
(a : Ordinal.{v}) : Cardinal.lift.{u, v} a.card = (Ordinal.lift.{u, v} a).card - Cardinal.mk_Iio_ordinal π Mathlib.SetTheory.Ordinal.Basic
(o : Ordinal.{u}) : Cardinal.mk β(Set.Iio o) = Cardinal.lift.{u + 1, u} o.card - Cardinal.mk_iio_le_lift π Mathlib.SetTheory.Ordinal.Basic
(ΞΊ : Cardinal.{u}) : Cardinal.mk β(Set.Iio ΞΊ) β€ Cardinal.lift.{u + 1, u} ΞΊ - Ordinal.mk_Iio_ordinal π Mathlib.SetTheory.Ordinal.Basic
(o : Ordinal.{u}) : Cardinal.mk β(Set.Iio o) = Cardinal.lift.{u + 1, u} o.card - Ordinal.mem_range_lift_of_card_le π Mathlib.SetTheory.Ordinal.Basic
{a : Cardinal.{u}} {b : Ordinal.{max u v}} (h : b.card β€ Cardinal.lift.{v, u} a) : b β Set.range Ordinal.lift.{v, u} - Ordinal.lift_card_sInf_compl_le π Mathlib.SetTheory.Ordinal.Family
(s : Set Ordinal.{u}) : Cardinal.lift.{u + 1, u} (sInf sαΆ).card β€ Cardinal.mk βs - Ordinal.card_sInf_range_compl_le_lift π Mathlib.SetTheory.Ordinal.Family
{ΞΉ : Type u} (f : ΞΉ β Ordinal.{max u v}) : (sInf (Set.range f)αΆ).card β€ Cardinal.lift.{v, u} (Cardinal.mk ΞΉ) - Cardinal.lift_univ π Mathlib.SetTheory.Ordinal.Univ
: Cardinal.lift.{w, max (u + 1) v} Cardinal.univ.{u, v} = Cardinal.univ.{u, max v w} - Cardinal.lift_lt_univ π Mathlib.SetTheory.Ordinal.Univ
(c : Cardinal.{u}) : Cardinal.lift.{u + 1, u} c < Cardinal.univ.{u, u + 1} - Cardinal.lift_lt_univ' π Mathlib.SetTheory.Ordinal.Univ
(c : Cardinal.{u}) : Cardinal.lift.{max (u + 1) v, u} c < Cardinal.univ.{u, v} - Cardinal.small_of_lift_mk_le_lift π Mathlib.SetTheory.Ordinal.Univ
{Ξ± : Type u} {c : Cardinal.{v}} (hΞ± : Cardinal.lift.{v, u} (Cardinal.mk Ξ±) β€ Cardinal.lift.{u, v} c) : Small.{v, u} Ξ± - Cardinal.small_iff_exists_lift_mk_le_lift π Mathlib.SetTheory.Ordinal.Univ
{Ξ± : Type u} : Small.{v, u} Ξ± β β c, Cardinal.lift.{v, u} (Cardinal.mk Ξ±) β€ Cardinal.lift.{u, v} c - Cardinal.small_iff_lift_mk_lt_univ π Mathlib.SetTheory.Ordinal.Univ
{Ξ± : Type u} : Small.{v, u} Ξ± β Cardinal.lift.{v + 1, u} (Cardinal.mk Ξ±) < Cardinal.univ.{v, max u (v + 1)} - Cardinal.lt_univ π Mathlib.SetTheory.Ordinal.Univ
{c : Cardinal.{u + 1}} : c < Cardinal.univ.{u, u + 1} β β c', c = Cardinal.lift.{u + 1, u} c' - Cardinal.lt_univ' π Mathlib.SetTheory.Ordinal.Univ
{c : Cardinal.{max (u + 1) v}} : c < Cardinal.univ.{u, v} β β c', c = Cardinal.lift.{max (u + 1) v, u} c' - Cardinal.lift_beth π Mathlib.SetTheory.Cardinal.Aleph
(o : Ordinal.{u_1}) : Cardinal.lift.{v, u_1} (Cardinal.beth o) = Cardinal.beth (Ordinal.lift.{v, u_1} o) - Cardinal.lift_preBeth π Mathlib.SetTheory.Cardinal.Aleph
(o : Ordinal.{u_1}) : Cardinal.lift.{v, u_1} (Cardinal.preBeth o) = Cardinal.preBeth (Ordinal.lift.{v, u_1} o) - Cardinal.beth_natCast_eq_lift π Mathlib.SetTheory.Cardinal.Aleph
{c : Cardinal.{u}} {n : β} : Cardinal.beth βn = Cardinal.lift.{v, u} c β Cardinal.beth βn = c - Cardinal.lift_eq_beth_natCast π Mathlib.SetTheory.Cardinal.Aleph
{c : Cardinal.{u}} {n : β} : Cardinal.lift.{v, u} c = Cardinal.beth βn β c = Cardinal.beth βn - Cardinal.beth_natCast_le_lift π Mathlib.SetTheory.Cardinal.Aleph
{c : Cardinal.{u}} {n : β} : Cardinal.beth βn β€ Cardinal.lift.{v, u} c β Cardinal.beth βn β€ c - Cardinal.lift_le_beth_natCast π Mathlib.SetTheory.Cardinal.Aleph
{c : Cardinal.{u}} {n : β} : Cardinal.lift.{v, u} c β€ Cardinal.beth βn β c β€ Cardinal.beth βn - Cardinal.beth_natCast_lt_lift π Mathlib.SetTheory.Cardinal.Aleph
{c : Cardinal.{u}} {n : β} : Cardinal.beth βn < Cardinal.lift.{v, u} c β Cardinal.beth βn < c - Cardinal.lift_lt_beth_natCast π Mathlib.SetTheory.Cardinal.Aleph
{c : Cardinal.{u}} {n : β} : Cardinal.lift.{v, u} c < Cardinal.beth βn β c < Cardinal.beth βn - Cardinal.beth_ofNat_eq_lift π Mathlib.SetTheory.Cardinal.Aleph
{c : Cardinal.{u}} {n : β} [n.AtLeastTwo] : Cardinal.beth (OfNat.ofNat n) = Cardinal.lift.{v, u} c β Cardinal.beth (OfNat.ofNat n) = c - Cardinal.lift_eq_beth_ofNat π Mathlib.SetTheory.Cardinal.Aleph
{c : Cardinal.{u}} {n : β} [n.AtLeastTwo] : Cardinal.lift.{v, u} c = Cardinal.beth (OfNat.ofNat n) β c = Cardinal.beth (OfNat.ofNat n) - Cardinal.beth_ofNat_le_lift π Mathlib.SetTheory.Cardinal.Aleph
{c : Cardinal.{u}} {n : β} [n.AtLeastTwo] : Cardinal.beth (OfNat.ofNat n) β€ Cardinal.lift.{v, u} c β Cardinal.beth (OfNat.ofNat n) β€ c - Cardinal.lift_le_beth_ofNat π Mathlib.SetTheory.Cardinal.Aleph
{c : Cardinal.{u}} {n : β} [n.AtLeastTwo] : Cardinal.lift.{v, u} c β€ Cardinal.beth (OfNat.ofNat n) β c β€ Cardinal.beth (OfNat.ofNat n) - Cardinal.beth_ofNat_lt_lift π Mathlib.SetTheory.Cardinal.Aleph
{c : Cardinal.{u}} {n : β} [n.AtLeastTwo] : Cardinal.beth (OfNat.ofNat n) < Cardinal.lift.{v, u} c β Cardinal.beth (OfNat.ofNat n) < c - Cardinal.lift_lt_beth_ofNat π Mathlib.SetTheory.Cardinal.Aleph
{c : Cardinal.{u}} {n : β} [n.AtLeastTwo] : Cardinal.lift.{v, u} c < Cardinal.beth (OfNat.ofNat n) β c < Cardinal.beth (OfNat.ofNat n) - Cardinal.lift_aleph π Mathlib.SetTheory.Cardinal.Aleph
(o : Ordinal.{u}) : Cardinal.lift.{v, u} (Cardinal.aleph o) = Cardinal.aleph (Ordinal.lift.{v, u} o) - Cardinal.lift_preAleph π Mathlib.SetTheory.Cardinal.Aleph
(o : Ordinal.{u}) : Cardinal.lift.{v, u} (Cardinal.preAleph o) = Cardinal.preAleph (Ordinal.lift.{v, u} o) - Cardinal.aleph_one_eq_lift π Mathlib.SetTheory.Cardinal.Aleph
{c : Cardinal.{u}} : Cardinal.aleph 1 = Cardinal.lift.{v, u} c β Cardinal.aleph 1 = c - Cardinal.lift_eq_aleph_one π Mathlib.SetTheory.Cardinal.Aleph
{c : Cardinal.{u}} : Cardinal.lift.{v, u} c = Cardinal.aleph 1 β c = Cardinal.aleph 1 - Cardinal.aleph_natCast_eq_lift π Mathlib.SetTheory.Cardinal.Aleph
{c : Cardinal.{u}} {n : β} : Cardinal.aleph βn = Cardinal.lift.{v, u} c β Cardinal.aleph βn = c - Cardinal.lift_eq_aleph_natCast π Mathlib.SetTheory.Cardinal.Aleph
{c : Cardinal.{u}} {n : β} : Cardinal.lift.{v, u} c = Cardinal.aleph βn β c = Cardinal.aleph βn - Cardinal.aleph_one_le_lift π Mathlib.SetTheory.Cardinal.Aleph
{c : Cardinal.{u}} : Cardinal.aleph 1 β€ Cardinal.lift.{v, u} c β Cardinal.aleph 1 β€ c - Cardinal.lift_le_aleph_one π Mathlib.SetTheory.Cardinal.Aleph
{c : Cardinal.{u}} : Cardinal.lift.{v, u} c β€ Cardinal.aleph 1 β c β€ Cardinal.aleph 1 - Cardinal.aleph_natCast_le_lift π Mathlib.SetTheory.Cardinal.Aleph
{c : Cardinal.{u}} {n : β} : Cardinal.aleph βn β€ Cardinal.lift.{v, u} c β Cardinal.aleph βn β€ c - Cardinal.lift_le_aleph_natCast π Mathlib.SetTheory.Cardinal.Aleph
{c : Cardinal.{u}} {n : β} : Cardinal.lift.{v, u} c β€ Cardinal.aleph βn β c β€ Cardinal.aleph βn - Cardinal.aleph_one_lt_lift π Mathlib.SetTheory.Cardinal.Aleph
{c : Cardinal.{u}} : Cardinal.aleph 1 < Cardinal.lift.{v, u} c β Cardinal.aleph 1 < c - Cardinal.lift_lt_aleph_one π Mathlib.SetTheory.Cardinal.Aleph
{c : Cardinal.{u}} : Cardinal.lift.{v, u} c < Cardinal.aleph 1 β c < Cardinal.aleph 1 - Cardinal.aleph_natCast_lt_lift π Mathlib.SetTheory.Cardinal.Aleph
{c : Cardinal.{u}} {n : β} : Cardinal.aleph βn < Cardinal.lift.{v, u} c β Cardinal.aleph βn < c - Cardinal.lift_lt_aleph_natCast π Mathlib.SetTheory.Cardinal.Aleph
{c : Cardinal.{u}} {n : β} : Cardinal.lift.{v, u} c < Cardinal.aleph βn β c < Cardinal.aleph βn - Cardinal.aleph_ofNat_eq_lift π Mathlib.SetTheory.Cardinal.Aleph
{c : Cardinal.{u}} {n : β} [n.AtLeastTwo] : Cardinal.aleph (OfNat.ofNat n) = Cardinal.lift.{v, u} c β Cardinal.aleph (OfNat.ofNat n) = c - Cardinal.lift_eq_aleph_ofNat π Mathlib.SetTheory.Cardinal.Aleph
{c : Cardinal.{u}} {n : β} [n.AtLeastTwo] : Cardinal.lift.{v, u} c = Cardinal.aleph (OfNat.ofNat n) β c = Cardinal.aleph (OfNat.ofNat n) - Cardinal.aleph_ofNat_le_lift π Mathlib.SetTheory.Cardinal.Aleph
{c : Cardinal.{u}} {n : β} [n.AtLeastTwo] : Cardinal.aleph (OfNat.ofNat n) β€ Cardinal.lift.{v, u} c β Cardinal.aleph (OfNat.ofNat n) β€ c - Cardinal.lift_le_aleph_ofNat π Mathlib.SetTheory.Cardinal.Aleph
{c : Cardinal.{u}} {n : β} [n.AtLeastTwo] : Cardinal.lift.{v, u} c β€ Cardinal.aleph (OfNat.ofNat n) β c β€ Cardinal.aleph (OfNat.ofNat n) - Cardinal.aleph_ofNat_lt_lift π Mathlib.SetTheory.Cardinal.Aleph
{c : Cardinal.{u}} {n : β} [n.AtLeastTwo] : Cardinal.aleph (OfNat.ofNat n) < Cardinal.lift.{v, u} c β Cardinal.aleph (OfNat.ofNat n) < c - Cardinal.lift_lt_aleph_ofNat π Mathlib.SetTheory.Cardinal.Aleph
{c : Cardinal.{u}} {n : β} [n.AtLeastTwo] : Cardinal.lift.{v, u} c < Cardinal.aleph (OfNat.ofNat n) β c < Cardinal.aleph (OfNat.ofNat n) - Cardinal.mk_equiv_eq_arrow_of_lift_eq π Mathlib.SetTheory.Cardinal.Arithmetic
{Ξ± : Type u} {Ξ²' : Type v} [Infinite Ξ±] (leq : Cardinal.lift.{v, u} (Cardinal.mk Ξ±) = Cardinal.lift.{u, v} (Cardinal.mk Ξ²')) : Cardinal.mk (Ξ± β Ξ²') = Cardinal.mk (Ξ± β Ξ²') - Cardinal.mk_embedding_eq_arrow_of_lift_le π Mathlib.SetTheory.Cardinal.Arithmetic
{Ξ± : Type u} {Ξ²' : Type v} [Infinite Ξ±] (lle : Cardinal.lift.{u, v} (Cardinal.mk Ξ²') β€ Cardinal.lift.{v, u} (Cardinal.mk Ξ±)) : Cardinal.mk (Ξ²' βͺ Ξ±) = Cardinal.mk (Ξ²' β Ξ±) - Cardinal.mk_equiv_eq_zero_iff_lift_ne π Mathlib.SetTheory.Cardinal.Arithmetic
{Ξ± : Type u} {Ξ²' : Type v} : Cardinal.mk (Ξ± β Ξ²') = 0 β Cardinal.lift.{v, u} (Cardinal.mk Ξ±) β Cardinal.lift.{u, v} (Cardinal.mk Ξ²') - Cardinal.mk_embedding_eq_zero_iff_lift_lt π Mathlib.SetTheory.Cardinal.Arithmetic
{Ξ± : Type u} {Ξ²' : Type v} : Cardinal.mk (Ξ± βͺ Ξ²') = 0 β Cardinal.lift.{u, v} (Cardinal.mk Ξ²') < Cardinal.lift.{v, u} (Cardinal.mk Ξ±)
About
Loogle searches Lean and Mathlib definitions and theorems.
You can use Loogle from within the Lean4 VSCode language extension
using the Loogle command from the command palette. You can also try the
#loogle command from LeanSearchClient,
the CLI version, the Loogle
VS Code extension, the lean.nvim
integration or the Zulip bot.
Usage
Loogle finds definitions and lemmas in various ways:
By constant:
πReal.sin
finds all lemmas whose statement somehow mentions the sine function.By lemma name substring:
π"differ"
finds all lemmas that have"differ"somewhere in their lemma name.By subexpression:
π_ * (_ ^ _)
finds all lemmas whose statements somewhere include a product where the second argument is raised to some power.The pattern can also be non-linear, as in
πReal.sqrt ?a * Real.sqrt ?aIf the pattern has parameters, they are matched in any order. Both of these will find
List.map:
π(?a -> ?b) -> List ?a -> List ?b
πList ?a -> (?a -> ?b) -> List ?bBy main conclusion:
π|- tsum _ = _ * tsum _
finds all lemmas where the conclusion (the subexpression to the right of allβandβ) has the given shape.As before, if the pattern has parameters, they are matched against the hypotheses of the lemma in any order; for example,
π|- _ < _ β tsum _ < tsum _
will findtsum_lt_tsumeven though the hypothesisf i < g iis not the last.You can filter for definitions vs theorems: Using
β’ (_ : Type _)finds all definitions which provide data whileβ’ (_ : Prop)finds all theorems (and definitions of proofs).
If you pass more than one such search filter, separated by commas
Loogle will return lemmas which match all of them. The
search
π Real.sin, "two", tsum, _ * _, _ ^ _, |- _ < _ β _
would find all lemmas which mention the constants Real.sin
and tsum, have "two" as a substring of the
lemma name, include a product and a power somewhere in the type,
and have a hypothesis of the form _ < _ (if
there were any such lemmas). Metavariables (?a) are
assigned independently in each filter.
The #lucky button will directly send you to the
documentation of the first hit.
Source code
You can find the source code for this service at https://github.com/nomeata/loogle. The https://loogle.lean-lang.org/ service is provided by the Lean FRO. Please review the Lean FRO Terms of Use and Privacy Policy.
This is Loogle revision 9f11169 serving mathlib revision ce5dd8c