Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  ax-cc Structured version   Unicode version

Axiom ax-cc 8315
 Description: The axiom of countable choice (CC), also known as the axiom of denumerable choice. It is clearly a special case of ac5 8357, but is weak enough that it can be proven using DC (see axcc 8338). It is, however, strictly stronger than ZF and cannot be proven in ZF. It states that any countable collection of non-empty sets must have a choice function. (Contributed by Mario Carneiro, 9-Feb-2013.)
Assertion
Ref Expression
ax-cc
Distinct variable group:   ,,

Detailed syntax breakdown of Axiom ax-cc
StepHypRef Expression
1 vx . . . 4
21cv 1651 . . 3
3 com 4845 . . 3
4 cen 7106 . . 3
52, 3, 4wbr 4212 . 2
6 vz . . . . . . 7
76cv 1651 . . . . . 6
8 c0 3628 . . . . . 6
97, 8wne 2599 . . . . 5
10 vf . . . . . . . 8
1110cv 1651 . . . . . . 7
127, 11cfv 5454 . . . . . 6
1312, 7wcel 1725 . . . . 5
149, 13wi 4 . . . 4
1514, 6, 2wral 2705 . . 3
1615, 10wex 1550 . 2
175, 16wi 4 1
 Colors of variables: wff set class This axiom is referenced by:  axcc2lem  8316
 Copyright terms: Public domain W3C validator