MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  axdclem2 Structured version   Visualization version   GIF version

Theorem axdclem2 9543
Description: Lemma for axdc 9544. Using the full Axiom of Choice, we can construct a choice function 𝑔 on 𝒫 dom 𝑥. From this, we can build a sequence 𝐹 starting at any value 𝑠 ∈ dom 𝑥 by repeatedly applying 𝑔 to the set (𝐹𝑥) (where 𝑥 is the value from the previous iteration). (Contributed by Mario Carneiro, 25-Jan-2013.)
Hypothesis
Ref Expression
axdclem2.1 𝐹 = (rec((𝑦 ∈ V ↦ (𝑔‘{𝑧𝑦𝑥𝑧})), 𝑠) ↾ ω)
Assertion
Ref Expression
axdclem2 (∃𝑧 𝑠𝑥𝑧 → (ran 𝑥 ⊆ dom 𝑥 → ∃𝑓𝑛 ∈ ω (𝑓𝑛)𝑥(𝑓‘suc 𝑛)))
Distinct variable groups:   𝑓,𝐹,𝑛   𝑦,𝐹,𝑧,𝑛   𝑓,𝑔,𝑥,𝑛   𝑔,𝑠,𝑦,𝑛   𝑧,𝑔   𝑥,𝑦,𝑧
Allowed substitution hints:   𝐹(𝑥,𝑔,𝑠)

Proof of Theorem axdclem2
Dummy variable 𝑘 is distinct from all other variables.
StepHypRef Expression
1 frfnom 7682 . . . . . . . 8 (rec((𝑦 ∈ V ↦ (𝑔‘{𝑧𝑦𝑥𝑧})), 𝑠) ↾ ω) Fn ω
2 axdclem2.1 . . . . . . . . 9 𝐹 = (rec((𝑦 ∈ V ↦ (𝑔‘{𝑧𝑦𝑥𝑧})), 𝑠) ↾ ω)
32fneq1i 6125 . . . . . . . 8 (𝐹 Fn ω ↔ (rec((𝑦 ∈ V ↦ (𝑔‘{𝑧𝑦𝑥𝑧})), 𝑠) ↾ ω) Fn ω)
41, 3mpbir 221 . . . . . . 7 𝐹 Fn ω
54a1i 11 . . . . . 6 ((∀𝑦 ∈ 𝒫 dom 𝑥(𝑦 ≠ ∅ → (𝑔𝑦) ∈ 𝑦) ∧ ∃𝑧 𝑠𝑥𝑧 ∧ ran 𝑥 ⊆ dom 𝑥) → 𝐹 Fn ω)
6 fveq2 6332 . . . . . . . . . . 11 (𝑛 = ∅ → (𝐹𝑛) = (𝐹‘∅))
7 suceq 5933 . . . . . . . . . . . 12 (𝑛 = ∅ → suc 𝑛 = suc ∅)
87fveq2d 6336 . . . . . . . . . . 11 (𝑛 = ∅ → (𝐹‘suc 𝑛) = (𝐹‘suc ∅))
96, 8breq12d 4797 . . . . . . . . . 10 (𝑛 = ∅ → ((𝐹𝑛)𝑥(𝐹‘suc 𝑛) ↔ (𝐹‘∅)𝑥(𝐹‘suc ∅)))
10 fveq2 6332 . . . . . . . . . . 11 (𝑛 = 𝑘 → (𝐹𝑛) = (𝐹𝑘))
11 suceq 5933 . . . . . . . . . . . 12 (𝑛 = 𝑘 → suc 𝑛 = suc 𝑘)
1211fveq2d 6336 . . . . . . . . . . 11 (𝑛 = 𝑘 → (𝐹‘suc 𝑛) = (𝐹‘suc 𝑘))
1310, 12breq12d 4797 . . . . . . . . . 10 (𝑛 = 𝑘 → ((𝐹𝑛)𝑥(𝐹‘suc 𝑛) ↔ (𝐹𝑘)𝑥(𝐹‘suc 𝑘)))
14 fveq2 6332 . . . . . . . . . . 11 (𝑛 = suc 𝑘 → (𝐹𝑛) = (𝐹‘suc 𝑘))
15 suceq 5933 . . . . . . . . . . . 12 (𝑛 = suc 𝑘 → suc 𝑛 = suc suc 𝑘)
1615fveq2d 6336 . . . . . . . . . . 11 (𝑛 = suc 𝑘 → (𝐹‘suc 𝑛) = (𝐹‘suc suc 𝑘))
1714, 16breq12d 4797 . . . . . . . . . 10 (𝑛 = suc 𝑘 → ((𝐹𝑛)𝑥(𝐹‘suc 𝑛) ↔ (𝐹‘suc 𝑘)𝑥(𝐹‘suc suc 𝑘)))
182fveq1i 6333 . . . . . . . . . . . . . . . 16 (𝐹‘∅) = ((rec((𝑦 ∈ V ↦ (𝑔‘{𝑧𝑦𝑥𝑧})), 𝑠) ↾ ω)‘∅)
19 vex 3352 . . . . . . . . . . . . . . . . 17 𝑠 ∈ V
20 fr0g 7683 . . . . . . . . . . . . . . . . 17 (𝑠 ∈ V → ((rec((𝑦 ∈ V ↦ (𝑔‘{𝑧𝑦𝑥𝑧})), 𝑠) ↾ ω)‘∅) = 𝑠)
2119, 20ax-mp 5 . . . . . . . . . . . . . . . 16 ((rec((𝑦 ∈ V ↦ (𝑔‘{𝑧𝑦𝑥𝑧})), 𝑠) ↾ ω)‘∅) = 𝑠
2218, 21eqtri 2792 . . . . . . . . . . . . . . 15 (𝐹‘∅) = 𝑠
2322breq1i 4791 . . . . . . . . . . . . . 14 ((𝐹‘∅)𝑥𝑧𝑠𝑥𝑧)
2423biimpri 218 . . . . . . . . . . . . 13 (𝑠𝑥𝑧 → (𝐹‘∅)𝑥𝑧)
2524eximi 1909 . . . . . . . . . . . 12 (∃𝑧 𝑠𝑥𝑧 → ∃𝑧(𝐹‘∅)𝑥𝑧)
26 peano1 7231 . . . . . . . . . . . . 13 ∅ ∈ ω
272axdclem 9542 . . . . . . . . . . . . 13 ((∀𝑦 ∈ 𝒫 dom 𝑥(𝑦 ≠ ∅ → (𝑔𝑦) ∈ 𝑦) ∧ ran 𝑥 ⊆ dom 𝑥 ∧ ∃𝑧(𝐹‘∅)𝑥𝑧) → (∅ ∈ ω → (𝐹‘∅)𝑥(𝐹‘suc ∅)))
2826, 27mpi 20 . . . . . . . . . . . 12 ((∀𝑦 ∈ 𝒫 dom 𝑥(𝑦 ≠ ∅ → (𝑔𝑦) ∈ 𝑦) ∧ ran 𝑥 ⊆ dom 𝑥 ∧ ∃𝑧(𝐹‘∅)𝑥𝑧) → (𝐹‘∅)𝑥(𝐹‘suc ∅))
2925, 28syl3an3 1168 . . . . . . . . . . 11 ((∀𝑦 ∈ 𝒫 dom 𝑥(𝑦 ≠ ∅ → (𝑔𝑦) ∈ 𝑦) ∧ ran 𝑥 ⊆ dom 𝑥 ∧ ∃𝑧 𝑠𝑥𝑧) → (𝐹‘∅)𝑥(𝐹‘suc ∅))
30293com23 1119 . . . . . . . . . 10 ((∀𝑦 ∈ 𝒫 dom 𝑥(𝑦 ≠ ∅ → (𝑔𝑦) ∈ 𝑦) ∧ ∃𝑧 𝑠𝑥𝑧 ∧ ran 𝑥 ⊆ dom 𝑥) → (𝐹‘∅)𝑥(𝐹‘suc ∅))
31 fvex 6342 . . . . . . . . . . . . . . . . 17 (𝐹𝑘) ∈ V
32 fvex 6342 . . . . . . . . . . . . . . . . 17 (𝐹‘suc 𝑘) ∈ V
3331, 32brelrn 5494 . . . . . . . . . . . . . . . 16 ((𝐹𝑘)𝑥(𝐹‘suc 𝑘) → (𝐹‘suc 𝑘) ∈ ran 𝑥)
34 ssel 3744 . . . . . . . . . . . . . . . 16 (ran 𝑥 ⊆ dom 𝑥 → ((𝐹‘suc 𝑘) ∈ ran 𝑥 → (𝐹‘suc 𝑘) ∈ dom 𝑥))
3533, 34syl5 34 . . . . . . . . . . . . . . 15 (ran 𝑥 ⊆ dom 𝑥 → ((𝐹𝑘)𝑥(𝐹‘suc 𝑘) → (𝐹‘suc 𝑘) ∈ dom 𝑥))
3632eldm 5459 . . . . . . . . . . . . . . 15 ((𝐹‘suc 𝑘) ∈ dom 𝑥 ↔ ∃𝑧(𝐹‘suc 𝑘)𝑥𝑧)
3735, 36syl6ib 241 . . . . . . . . . . . . . 14 (ran 𝑥 ⊆ dom 𝑥 → ((𝐹𝑘)𝑥(𝐹‘suc 𝑘) → ∃𝑧(𝐹‘suc 𝑘)𝑥𝑧))
3837ad2antll 700 . . . . . . . . . . . . 13 ((𝑘 ∈ ω ∧ (∀𝑦 ∈ 𝒫 dom 𝑥(𝑦 ≠ ∅ → (𝑔𝑦) ∈ 𝑦) ∧ ran 𝑥 ⊆ dom 𝑥)) → ((𝐹𝑘)𝑥(𝐹‘suc 𝑘) → ∃𝑧(𝐹‘suc 𝑘)𝑥𝑧))
39 peano2 7232 . . . . . . . . . . . . . . . . 17 (𝑘 ∈ ω → suc 𝑘 ∈ ω)
402axdclem 9542 . . . . . . . . . . . . . . . . 17 ((∀𝑦 ∈ 𝒫 dom 𝑥(𝑦 ≠ ∅ → (𝑔𝑦) ∈ 𝑦) ∧ ran 𝑥 ⊆ dom 𝑥 ∧ ∃𝑧(𝐹‘suc 𝑘)𝑥𝑧) → (suc 𝑘 ∈ ω → (𝐹‘suc 𝑘)𝑥(𝐹‘suc suc 𝑘)))
4139, 40syl5 34 . . . . . . . . . . . . . . . 16 ((∀𝑦 ∈ 𝒫 dom 𝑥(𝑦 ≠ ∅ → (𝑔𝑦) ∈ 𝑦) ∧ ran 𝑥 ⊆ dom 𝑥 ∧ ∃𝑧(𝐹‘suc 𝑘)𝑥𝑧) → (𝑘 ∈ ω → (𝐹‘suc 𝑘)𝑥(𝐹‘suc suc 𝑘)))
42413expia 1113 . . . . . . . . . . . . . . 15 ((∀𝑦 ∈ 𝒫 dom 𝑥(𝑦 ≠ ∅ → (𝑔𝑦) ∈ 𝑦) ∧ ran 𝑥 ⊆ dom 𝑥) → (∃𝑧(𝐹‘suc 𝑘)𝑥𝑧 → (𝑘 ∈ ω → (𝐹‘suc 𝑘)𝑥(𝐹‘suc suc 𝑘))))
4342com3r 87 . . . . . . . . . . . . . 14 (𝑘 ∈ ω → ((∀𝑦 ∈ 𝒫 dom 𝑥(𝑦 ≠ ∅ → (𝑔𝑦) ∈ 𝑦) ∧ ran 𝑥 ⊆ dom 𝑥) → (∃𝑧(𝐹‘suc 𝑘)𝑥𝑧 → (𝐹‘suc 𝑘)𝑥(𝐹‘suc suc 𝑘))))
4443imp 393 . . . . . . . . . . . . 13 ((𝑘 ∈ ω ∧ (∀𝑦 ∈ 𝒫 dom 𝑥(𝑦 ≠ ∅ → (𝑔𝑦) ∈ 𝑦) ∧ ran 𝑥 ⊆ dom 𝑥)) → (∃𝑧(𝐹‘suc 𝑘)𝑥𝑧 → (𝐹‘suc 𝑘)𝑥(𝐹‘suc suc 𝑘)))
4538, 44syld 47 . . . . . . . . . . . 12 ((𝑘 ∈ ω ∧ (∀𝑦 ∈ 𝒫 dom 𝑥(𝑦 ≠ ∅ → (𝑔𝑦) ∈ 𝑦) ∧ ran 𝑥 ⊆ dom 𝑥)) → ((𝐹𝑘)𝑥(𝐹‘suc 𝑘) → (𝐹‘suc 𝑘)𝑥(𝐹‘suc suc 𝑘)))
46453adantr2 1174 . . . . . . . . . . 11 ((𝑘 ∈ ω ∧ (∀𝑦 ∈ 𝒫 dom 𝑥(𝑦 ≠ ∅ → (𝑔𝑦) ∈ 𝑦) ∧ ∃𝑧 𝑠𝑥𝑧 ∧ ran 𝑥 ⊆ dom 𝑥)) → ((𝐹𝑘)𝑥(𝐹‘suc 𝑘) → (𝐹‘suc 𝑘)𝑥(𝐹‘suc suc 𝑘)))
4746ex 397 . . . . . . . . . 10 (𝑘 ∈ ω → ((∀𝑦 ∈ 𝒫 dom 𝑥(𝑦 ≠ ∅ → (𝑔𝑦) ∈ 𝑦) ∧ ∃𝑧 𝑠𝑥𝑧 ∧ ran 𝑥 ⊆ dom 𝑥) → ((𝐹𝑘)𝑥(𝐹‘suc 𝑘) → (𝐹‘suc 𝑘)𝑥(𝐹‘suc suc 𝑘))))
489, 13, 17, 30, 47finds2 7240 . . . . . . . . 9 (𝑛 ∈ ω → ((∀𝑦 ∈ 𝒫 dom 𝑥(𝑦 ≠ ∅ → (𝑔𝑦) ∈ 𝑦) ∧ ∃𝑧 𝑠𝑥𝑧 ∧ ran 𝑥 ⊆ dom 𝑥) → (𝐹𝑛)𝑥(𝐹‘suc 𝑛)))
4948com12 32 . . . . . . . 8 ((∀𝑦 ∈ 𝒫 dom 𝑥(𝑦 ≠ ∅ → (𝑔𝑦) ∈ 𝑦) ∧ ∃𝑧 𝑠𝑥𝑧 ∧ ran 𝑥 ⊆ dom 𝑥) → (𝑛 ∈ ω → (𝐹𝑛)𝑥(𝐹‘suc 𝑛)))
50 fvex 6342 . . . . . . . . 9 (𝐹𝑛) ∈ V
51 fvex 6342 . . . . . . . . 9 (𝐹‘suc 𝑛) ∈ V
5250, 51breldm 5467 . . . . . . . 8 ((𝐹𝑛)𝑥(𝐹‘suc 𝑛) → (𝐹𝑛) ∈ dom 𝑥)
5349, 52syl6 35 . . . . . . 7 ((∀𝑦 ∈ 𝒫 dom 𝑥(𝑦 ≠ ∅ → (𝑔𝑦) ∈ 𝑦) ∧ ∃𝑧 𝑠𝑥𝑧 ∧ ran 𝑥 ⊆ dom 𝑥) → (𝑛 ∈ ω → (𝐹𝑛) ∈ dom 𝑥))
5453ralrimiv 3113 . . . . . 6 ((∀𝑦 ∈ 𝒫 dom 𝑥(𝑦 ≠ ∅ → (𝑔𝑦) ∈ 𝑦) ∧ ∃𝑧 𝑠𝑥𝑧 ∧ ran 𝑥 ⊆ dom 𝑥) → ∀𝑛 ∈ ω (𝐹𝑛) ∈ dom 𝑥)
55 ffnfv 6530 . . . . . 6 (𝐹:ω⟶dom 𝑥 ↔ (𝐹 Fn ω ∧ ∀𝑛 ∈ ω (𝐹𝑛) ∈ dom 𝑥))
565, 54, 55sylanbrc 564 . . . . 5 ((∀𝑦 ∈ 𝒫 dom 𝑥(𝑦 ≠ ∅ → (𝑔𝑦) ∈ 𝑦) ∧ ∃𝑧 𝑠𝑥𝑧 ∧ ran 𝑥 ⊆ dom 𝑥) → 𝐹:ω⟶dom 𝑥)
57 omex 8703 . . . . . 6 ω ∈ V
5857a1i 11 . . . . 5 ((∀𝑦 ∈ 𝒫 dom 𝑥(𝑦 ≠ ∅ → (𝑔𝑦) ∈ 𝑦) ∧ ∃𝑧 𝑠𝑥𝑧 ∧ ran 𝑥 ⊆ dom 𝑥) → ω ∈ V)
59 vex 3352 . . . . . . 7 𝑥 ∈ V
6059dmex 7245 . . . . . 6 dom 𝑥 ∈ V
6160a1i 11 . . . . 5 ((∀𝑦 ∈ 𝒫 dom 𝑥(𝑦 ≠ ∅ → (𝑔𝑦) ∈ 𝑦) ∧ ∃𝑧 𝑠𝑥𝑧 ∧ ran 𝑥 ⊆ dom 𝑥) → dom 𝑥 ∈ V)
62 fex2 7267 . . . . 5 ((𝐹:ω⟶dom 𝑥 ∧ ω ∈ V ∧ dom 𝑥 ∈ V) → 𝐹 ∈ V)
6356, 58, 61, 62syl3anc 1475 . . . 4 ((∀𝑦 ∈ 𝒫 dom 𝑥(𝑦 ≠ ∅ → (𝑔𝑦) ∈ 𝑦) ∧ ∃𝑧 𝑠𝑥𝑧 ∧ ran 𝑥 ⊆ dom 𝑥) → 𝐹 ∈ V)
6449ralrimiv 3113 . . . 4 ((∀𝑦 ∈ 𝒫 dom 𝑥(𝑦 ≠ ∅ → (𝑔𝑦) ∈ 𝑦) ∧ ∃𝑧 𝑠𝑥𝑧 ∧ ran 𝑥 ⊆ dom 𝑥) → ∀𝑛 ∈ ω (𝐹𝑛)𝑥(𝐹‘suc 𝑛))
65 fveq1 6331 . . . . . . 7 (𝑓 = 𝐹 → (𝑓𝑛) = (𝐹𝑛))
66 fveq1 6331 . . . . . . 7 (𝑓 = 𝐹 → (𝑓‘suc 𝑛) = (𝐹‘suc 𝑛))
6765, 66breq12d 4797 . . . . . 6 (𝑓 = 𝐹 → ((𝑓𝑛)𝑥(𝑓‘suc 𝑛) ↔ (𝐹𝑛)𝑥(𝐹‘suc 𝑛)))
6867ralbidv 3134 . . . . 5 (𝑓 = 𝐹 → (∀𝑛 ∈ ω (𝑓𝑛)𝑥(𝑓‘suc 𝑛) ↔ ∀𝑛 ∈ ω (𝐹𝑛)𝑥(𝐹‘suc 𝑛)))
6968spcegv 3443 . . . 4 (𝐹 ∈ V → (∀𝑛 ∈ ω (𝐹𝑛)𝑥(𝐹‘suc 𝑛) → ∃𝑓𝑛 ∈ ω (𝑓𝑛)𝑥(𝑓‘suc 𝑛)))
7063, 64, 69sylc 65 . . 3 ((∀𝑦 ∈ 𝒫 dom 𝑥(𝑦 ≠ ∅ → (𝑔𝑦) ∈ 𝑦) ∧ ∃𝑧 𝑠𝑥𝑧 ∧ ran 𝑥 ⊆ dom 𝑥) → ∃𝑓𝑛 ∈ ω (𝑓𝑛)𝑥(𝑓‘suc 𝑛))
71703exp 1111 . 2 (∀𝑦 ∈ 𝒫 dom 𝑥(𝑦 ≠ ∅ → (𝑔𝑦) ∈ 𝑦) → (∃𝑧 𝑠𝑥𝑧 → (ran 𝑥 ⊆ dom 𝑥 → ∃𝑓𝑛 ∈ ω (𝑓𝑛)𝑥(𝑓‘suc 𝑛))))
7260pwex 4976 . . 3 𝒫 dom 𝑥 ∈ V
7372ac4c 9499 . 2 𝑔𝑦 ∈ 𝒫 dom 𝑥(𝑦 ≠ ∅ → (𝑔𝑦) ∈ 𝑦)
7471, 73exlimiiv 2010 1 (∃𝑧 𝑠𝑥𝑧 → (ran 𝑥 ⊆ dom 𝑥 → ∃𝑓𝑛 ∈ ω (𝑓𝑛)𝑥(𝑓‘suc 𝑛)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 382  w3a 1070   = wceq 1630  wex 1851  wcel 2144  {cab 2756  wne 2942  wral 3060  Vcvv 3349  wss 3721  c0 4061  𝒫 cpw 4295   class class class wbr 4784  cmpt 4861  dom cdm 5249  ran crn 5250  cres 5251  suc csuc 5868   Fn wfn 6026  wf 6027  cfv 6031  ωcom 7211  reccrdg 7657
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1869  ax-4 1884  ax-5 1990  ax-6 2056  ax-7 2092  ax-8 2146  ax-9 2153  ax-10 2173  ax-11 2189  ax-12 2202  ax-13 2407  ax-ext 2750  ax-rep 4902  ax-sep 4912  ax-nul 4920  ax-pow 4971  ax-pr 5034  ax-un 7095  ax-inf2 8701  ax-ac2 9486
This theorem depends on definitions:  df-bi 197  df-an 383  df-or 827  df-3or 1071  df-3an 1072  df-tru 1633  df-ex 1852  df-nf 1857  df-sb 2049  df-eu 2621  df-mo 2622  df-clab 2757  df-cleq 2763  df-clel 2766  df-nfc 2901  df-ne 2943  df-ral 3065  df-rex 3066  df-reu 3067  df-rab 3069  df-v 3351  df-sbc 3586  df-csb 3681  df-dif 3724  df-un 3726  df-in 3728  df-ss 3735  df-pss 3737  df-nul 4062  df-if 4224  df-pw 4297  df-sn 4315  df-pr 4317  df-tp 4319  df-op 4321  df-uni 4573  df-iun 4654  df-br 4785  df-opab 4845  df-mpt 4862  df-tr 4885  df-id 5157  df-eprel 5162  df-po 5170  df-so 5171  df-fr 5208  df-we 5210  df-xp 5255  df-rel 5256  df-cnv 5257  df-co 5258  df-dm 5259  df-rn 5260  df-res 5261  df-ima 5262  df-pred 5823  df-ord 5869  df-on 5870  df-lim 5871  df-suc 5872  df-iota 5994  df-fun 6033  df-fn 6034  df-f 6035  df-f1 6036  df-fo 6037  df-f1o 6038  df-fv 6039  df-om 7212  df-wrecs 7558  df-recs 7620  df-rdg 7658  df-ac 9138
This theorem is referenced by:  axdc  9544
  Copyright terms: Public domain W3C validator