Metamath Proof Explorer

Axiom ax-dc

Description: Dependent Choice. Axiom DC1 of Schechter p. 149. This theorem is weaker than the Axiom of Choice but is stronger than Countable Choice. It shows the existence of a sequence whose values can only be shown to exist (but cannot be constructed explicitly) and also depend on earlier values in the sequence. Dependent choice is equivalent to the statement that every (nonempty) pruned tree has a branch. This axiom is redundant in ZFC; see axdc . But ZF+DC is strictly weaker than ZF+AC, so this axiom provides for theorems that do not need the full power of AC. (Contributed by Mario Carneiro, 25-Jan-2013)

Ref Expression
Assertion ax-dc ⊢ ∃ y ∃ z y x z ∧ ran ⁡ x ⊆ dom ⁡ x → ∃ f ∀ n ∈ ω f ⁡ n x f ⁡ suc ⁡ n

Detailed syntax breakdown

Step Hyp Ref Expression
0 vy setvar y
1 vz setvar z
2 0 cv setvar y
3 vx setvar x
4 3 cv setvar x
5 1 cv setvar z
6 2 5 4 wbr wff y x z
7 6 1 wex wff ∃ z y x z
8 7 0 wex wff ∃ y ∃ z y x z
9 4 crn class ran ⁡ x
10 4 cdm class dom ⁡ x
11 9 10 wss wff ran ⁡ x ⊆ dom ⁡ x
12 8 11 wa wff ∃ y ∃ z y x z ∧ ran ⁡ x ⊆ dom ⁡ x
13 vf setvar f
14 vn setvar n
15 com class ω
16 13 cv setvar f
17 14 cv setvar n
18 17 16 cfv class f ⁡ n
19 17 csuc class suc ⁡ n
20 19 16 cfv class f ⁡ suc ⁡ n
21 18 20 4 wbr wff f ⁡ n x f ⁡ suc ⁡ n
22 21 14 15 wral wff ∀ n ∈ ω f ⁡ n x f ⁡ suc ⁡ n
23 22 13 wex wff ∃ f ∀ n ∈ ω f ⁡ n x f ⁡ suc ⁡ n
24 12 23 wi wff ∃ y ∃ z y x z ∧ ran ⁡ x ⊆ dom ⁡ x → ∃ f ∀ n ∈ ω f ⁡ n x f ⁡ suc ⁡ n