Metamath Proof Explorer


Axiom ax-cc

Description: The axiom of countable choice (CC), also known as the axiom of denumerable choice. It is clearly a special case of ac5 , but is weak enough that it can be proven using DC (see axcc ). It is, however, strictly stronger than ZF and cannot be proven in ZF. It states that any countable collection of nonempty sets must have a choice function. (Contributed by Mario Carneiro, 9-Feb-2013)

Ref Expression
Assertion ax-cc xωfzxzfzz

Detailed syntax breakdown

Step Hyp Ref Expression
0 vx setvarx
1 0 cv setvarx
2 cen class
3 com classω
4 1 3 2 wbr wffxω
5 vf setvarf
6 vz setvarz
7 6 cv setvarz
8 c0 class
9 7 8 wne wffz
10 5 cv setvarf
11 7 10 cfv classfz
12 11 7 wcel wfffzz
13 9 12 wi wffzfzz
14 13 6 1 wral wffzxzfzz
15 14 5 wex wfffzxzfzz
16 4 15 wi wffxωfzxzfzz