Description: Given any cardinal number A , there exists an argument x , which yields the least regular uncountable value of aleph which is greater to or equal to A . This proof uses AC. (Contributed by RP, 23-Nov-2023)
Ref | Expression | ||
---|---|---|---|
Assertion | minregex | |