Theorem axdclem2 10433

Description: Lemma for axdc 10434. 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.

Step	Hyp	Ref	Expression
1		frfnom 8367	. . . . . . 7 ⊢ (rec((𝑦 ∈ V ↦ (𝑔‘{𝑧 ∣ 𝑦𝑥𝑧})), 𝑠) ↾ ω) Fn ω
2		axdclem2.1	. . . . . . . 8 ⊢ 𝐹 = (rec((𝑦 ∈ V ↦ (𝑔‘{𝑧 ∣ 𝑦𝑥𝑧})), 𝑠) ↾ ω)
3	2	fneq1i 6589	. . . . . . 7 ⊢ (𝐹 Fn ω ↔ (rec((𝑦 ∈ V ↦ (𝑔‘{𝑧 ∣ 𝑦𝑥𝑧})), 𝑠) ↾ ω) Fn ω)
4	1, 3	mpbir 231	. . . . . 6 ⊢ 𝐹 Fn ω
5	4	a1i 11	. . . . 5 ⊢ ((∀𝑦 ∈ 𝒫 dom 𝑥(𝑦 ≠ ∅ → (𝑔‘𝑦) ∈ 𝑦) ∧ ∃𝑧 𝑠𝑥𝑧 ∧ ran 𝑥 ⊆ dom 𝑥) → 𝐹 Fn ω)
6		omex 9555	. . . . . 6 ⊢ ω ∈ V
7	6	a1i 11	. . . . 5 ⊢ ((∀𝑦 ∈ 𝒫 dom 𝑥(𝑦 ≠ ∅ → (𝑔‘𝑦) ∈ 𝑦) ∧ ∃𝑧 𝑠𝑥𝑧 ∧ ran 𝑥 ⊆ dom 𝑥) → ω ∈ V)
8	5, 7	fnexd 7166	. . . 4 ⊢ ((∀𝑦 ∈ 𝒫 dom 𝑥(𝑦 ≠ ∅ → (𝑔‘𝑦) ∈ 𝑦) ∧ ∃𝑧 𝑠𝑥𝑧 ∧ ran 𝑥 ⊆ dom 𝑥) → 𝐹 ∈ V)
9		fveq2 6834	. . . . . . . 8 ⊢ (𝑛 = ∅ → (𝐹‘𝑛) = (𝐹‘∅))
10		suceq 6385	. . . . . . . . 9 ⊢ (𝑛 = ∅ → suc 𝑛 = suc ∅)
11	10	fveq2d 6838	. . . . . . . 8 ⊢ (𝑛 = ∅ → (𝐹‘suc 𝑛) = (𝐹‘suc ∅))
12	9, 11	breq12d 5099	. . . . . . 7 ⊢ (𝑛 = ∅ → ((𝐹‘𝑛)𝑥(𝐹‘suc 𝑛) ↔ (𝐹‘∅)𝑥(𝐹‘suc ∅)))
13		fveq2 6834	. . . . . . . 8 ⊢ (𝑛 = 𝑘 → (𝐹‘𝑛) = (𝐹‘𝑘))
14		suceq 6385	. . . . . . . . 9 ⊢ (𝑛 = 𝑘 → suc 𝑛 = suc 𝑘)
15	14	fveq2d 6838	. . . . . . . 8 ⊢ (𝑛 = 𝑘 → (𝐹‘suc 𝑛) = (𝐹‘suc 𝑘))
16	13, 15	breq12d 5099	. . . . . . 7 ⊢ (𝑛 = 𝑘 → ((𝐹‘𝑛)𝑥(𝐹‘suc 𝑛) ↔ (𝐹‘𝑘)𝑥(𝐹‘suc 𝑘)))
17		fveq2 6834	. . . . . . . 8 ⊢ (𝑛 = suc 𝑘 → (𝐹‘𝑛) = (𝐹‘suc 𝑘))
18		suceq 6385	. . . . . . . . 9 ⊢ (𝑛 = suc 𝑘 → suc 𝑛 = suc suc 𝑘)
19	18	fveq2d 6838	. . . . . . . 8 ⊢ (𝑛 = suc 𝑘 → (𝐹‘suc 𝑛) = (𝐹‘suc suc 𝑘))
20	17, 19	breq12d 5099	. . . . . . 7 ⊢ (𝑛 = suc 𝑘 → ((𝐹‘𝑛)𝑥(𝐹‘suc 𝑛) ↔ (𝐹‘suc 𝑘)𝑥(𝐹‘suc suc 𝑘)))
21	2	fveq1i 6835	. . . . . . . . . . . . 13 ⊢ (𝐹‘∅) = ((rec((𝑦 ∈ V ↦ (𝑔‘{𝑧 ∣ 𝑦𝑥𝑧})), 𝑠) ↾ ω)‘∅)
22		fr0g 8368	. . . . . . . . . . . . . 14 ⊢ (𝑠 ∈ V → ((rec((𝑦 ∈ V ↦ (𝑔‘{𝑧 ∣ 𝑦𝑥𝑧})), 𝑠) ↾ ω)‘∅) = 𝑠)
23	22	elv 3435	. . . . . . . . . . . . 13 ⊢ ((rec((𝑦 ∈ V ↦ (𝑔‘{𝑧 ∣ 𝑦𝑥𝑧})), 𝑠) ↾ ω)‘∅) = 𝑠
24	21, 23	eqtri 2760	. . . . . . . . . . . 12 ⊢ (𝐹‘∅) = 𝑠
25	24	breq1i 5093	. . . . . . . . . . 11 ⊢ ((𝐹‘∅)𝑥𝑧 ↔ 𝑠𝑥𝑧)
26	25	biimpri 228	. . . . . . . . . 10 ⊢ (𝑠𝑥𝑧 → (𝐹‘∅)𝑥𝑧)
27	26	eximi 1837	. . . . . . . . 9 ⊢ (∃𝑧 𝑠𝑥𝑧 → ∃𝑧(𝐹‘∅)𝑥𝑧)
28		peano1 7833	. . . . . . . . . 10 ⊢ ∅ ∈ ω
29	2	axdclem 10432	. . . . . . . . . 10 ⊢ ((∀𝑦 ∈ 𝒫 dom 𝑥(𝑦 ≠ ∅ → (𝑔‘𝑦) ∈ 𝑦) ∧ ran 𝑥 ⊆ dom 𝑥 ∧ ∃𝑧(𝐹‘∅)𝑥𝑧) → (∅ ∈ ω → (𝐹‘∅)𝑥(𝐹‘suc ∅)))
30	28, 29	mpi 20	. . . . . . . . 9 ⊢ ((∀𝑦 ∈ 𝒫 dom 𝑥(𝑦 ≠ ∅ → (𝑔‘𝑦) ∈ 𝑦) ∧ ran 𝑥 ⊆ dom 𝑥 ∧ ∃𝑧(𝐹‘∅)𝑥𝑧) → (𝐹‘∅)𝑥(𝐹‘suc ∅))
31	27, 30	syl3an3 1166	. . . . . . . 8 ⊢ ((∀𝑦 ∈ 𝒫 dom 𝑥(𝑦 ≠ ∅ → (𝑔‘𝑦) ∈ 𝑦) ∧ ran 𝑥 ⊆ dom 𝑥 ∧ ∃𝑧 𝑠𝑥𝑧) → (𝐹‘∅)𝑥(𝐹‘suc ∅))
32	31	3com23 1127	. . . . . . 7 ⊢ ((∀𝑦 ∈ 𝒫 dom 𝑥(𝑦 ≠ ∅ → (𝑔‘𝑦) ∈ 𝑦) ∧ ∃𝑧 𝑠𝑥𝑧 ∧ ran 𝑥 ⊆ dom 𝑥) → (𝐹‘∅)𝑥(𝐹‘suc ∅))
33		fvex 6847	. . . . . . . . . . . . . 14 ⊢ (𝐹‘𝑘) ∈ V
34		fvex 6847	. . . . . . . . . . . . . 14 ⊢ (𝐹‘suc 𝑘) ∈ V
35	33, 34	brelrn 5891	. . . . . . . . . . . . 13 ⊢ ((𝐹‘𝑘)𝑥(𝐹‘suc 𝑘) → (𝐹‘suc 𝑘) ∈ ran 𝑥)
36		ssel 3916	. . . . . . . . . . . . 13 ⊢ (ran 𝑥 ⊆ dom 𝑥 → ((𝐹‘suc 𝑘) ∈ ran 𝑥 → (𝐹‘suc 𝑘) ∈ dom 𝑥))
37	35, 36	syl5 34	. . . . . . . . . . . 12 ⊢ (ran 𝑥 ⊆ dom 𝑥 → ((𝐹‘𝑘)𝑥(𝐹‘suc 𝑘) → (𝐹‘suc 𝑘) ∈ dom 𝑥))
38	34	eldm 5849	. . . . . . . . . . . 12 ⊢ ((𝐹‘suc 𝑘) ∈ dom 𝑥 ↔ ∃𝑧(𝐹‘suc 𝑘)𝑥𝑧)
39	37, 38	imbitrdi 251	. . . . . . . . . . 11 ⊢ (ran 𝑥 ⊆ dom 𝑥 → ((𝐹‘𝑘)𝑥(𝐹‘suc 𝑘) → ∃𝑧(𝐹‘suc 𝑘)𝑥𝑧))
40	39	ad2antll 730	. . . . . . . . . 10 ⊢ ((𝑘 ∈ ω ∧ (∀𝑦 ∈ 𝒫 dom 𝑥(𝑦 ≠ ∅ → (𝑔‘𝑦) ∈ 𝑦) ∧ ran 𝑥 ⊆ dom 𝑥)) → ((𝐹‘𝑘)𝑥(𝐹‘suc 𝑘) → ∃𝑧(𝐹‘suc 𝑘)𝑥𝑧))
41		peano2 7834	. . . . . . . . . . . . . 14 ⊢ (𝑘 ∈ ω → suc 𝑘 ∈ ω)
42	2	axdclem 10432	. . . . . . . . . . . . . 14 ⊢ ((∀𝑦 ∈ 𝒫 dom 𝑥(𝑦 ≠ ∅ → (𝑔‘𝑦) ∈ 𝑦) ∧ ran 𝑥 ⊆ dom 𝑥 ∧ ∃𝑧(𝐹‘suc 𝑘)𝑥𝑧) → (suc 𝑘 ∈ ω → (𝐹‘suc 𝑘)𝑥(𝐹‘suc suc 𝑘)))
43	41, 42	syl5 34	. . . . . . . . . . . . 13 ⊢ ((∀𝑦 ∈ 𝒫 dom 𝑥(𝑦 ≠ ∅ → (𝑔‘𝑦) ∈ 𝑦) ∧ ran 𝑥 ⊆ dom 𝑥 ∧ ∃𝑧(𝐹‘suc 𝑘)𝑥𝑧) → (𝑘 ∈ ω → (𝐹‘suc 𝑘)𝑥(𝐹‘suc suc 𝑘)))
44	43	3expia 1122	. . . . . . . . . . . 12 ⊢ ((∀𝑦 ∈ 𝒫 dom 𝑥(𝑦 ≠ ∅ → (𝑔‘𝑦) ∈ 𝑦) ∧ ran 𝑥 ⊆ dom 𝑥) → (∃𝑧(𝐹‘suc 𝑘)𝑥𝑧 → (𝑘 ∈ ω → (𝐹‘suc 𝑘)𝑥(𝐹‘suc suc 𝑘))))
45	44	com3r 87	. . . . . . . . . . 11 ⊢ (𝑘 ∈ ω → ((∀𝑦 ∈ 𝒫 dom 𝑥(𝑦 ≠ ∅ → (𝑔‘𝑦) ∈ 𝑦) ∧ ran 𝑥 ⊆ dom 𝑥) → (∃𝑧(𝐹‘suc 𝑘)𝑥𝑧 → (𝐹‘suc 𝑘)𝑥(𝐹‘suc suc 𝑘))))
46	45	imp 406	. . . . . . . . . 10 ⊢ ((𝑘 ∈ ω ∧ (∀𝑦 ∈ 𝒫 dom 𝑥(𝑦 ≠ ∅ → (𝑔‘𝑦) ∈ 𝑦) ∧ ran 𝑥 ⊆ dom 𝑥)) → (∃𝑧(𝐹‘suc 𝑘)𝑥𝑧 → (𝐹‘suc 𝑘)𝑥(𝐹‘suc suc 𝑘)))
47	40, 46	syld 47	. . . . . . . . 9 ⊢ ((𝑘 ∈ ω ∧ (∀𝑦 ∈ 𝒫 dom 𝑥(𝑦 ≠ ∅ → (𝑔‘𝑦) ∈ 𝑦) ∧ ran 𝑥 ⊆ dom 𝑥)) → ((𝐹‘𝑘)𝑥(𝐹‘suc 𝑘) → (𝐹‘suc 𝑘)𝑥(𝐹‘suc suc 𝑘)))
48	47	3adantr2 1172	. . . . . . . 8 ⊢ ((𝑘 ∈ ω ∧ (∀𝑦 ∈ 𝒫 dom 𝑥(𝑦 ≠ ∅ → (𝑔‘𝑦) ∈ 𝑦) ∧ ∃𝑧 𝑠𝑥𝑧 ∧ ran 𝑥 ⊆ dom 𝑥)) → ((𝐹‘𝑘)𝑥(𝐹‘suc 𝑘) → (𝐹‘suc 𝑘)𝑥(𝐹‘suc suc 𝑘)))
49	48	ex 412	. . . . . . 7 ⊢ (𝑘 ∈ ω → ((∀𝑦 ∈ 𝒫 dom 𝑥(𝑦 ≠ ∅ → (𝑔‘𝑦) ∈ 𝑦) ∧ ∃𝑧 𝑠𝑥𝑧 ∧ ran 𝑥 ⊆ dom 𝑥) → ((𝐹‘𝑘)𝑥(𝐹‘suc 𝑘) → (𝐹‘suc 𝑘)𝑥(𝐹‘suc suc 𝑘))))
50	12, 16, 20, 32, 49	finds2 7842	. . . . . 6 ⊢ (𝑛 ∈ ω → ((∀𝑦 ∈ 𝒫 dom 𝑥(𝑦 ≠ ∅ → (𝑔‘𝑦) ∈ 𝑦) ∧ ∃𝑧 𝑠𝑥𝑧 ∧ ran 𝑥 ⊆ dom 𝑥) → (𝐹‘𝑛)𝑥(𝐹‘suc 𝑛)))
51	50	com12 32	. . . . 5 ⊢ ((∀𝑦 ∈ 𝒫 dom 𝑥(𝑦 ≠ ∅ → (𝑔‘𝑦) ∈ 𝑦) ∧ ∃𝑧 𝑠𝑥𝑧 ∧ ran 𝑥 ⊆ dom 𝑥) → (𝑛 ∈ ω → (𝐹‘𝑛)𝑥(𝐹‘suc 𝑛)))
52	51	ralrimiv 3129	. . . 4 ⊢ ((∀𝑦 ∈ 𝒫 dom 𝑥(𝑦 ≠ ∅ → (𝑔‘𝑦) ∈ 𝑦) ∧ ∃𝑧 𝑠𝑥𝑧 ∧ ran 𝑥 ⊆ dom 𝑥) → ∀𝑛 ∈ ω (𝐹‘𝑛)𝑥(𝐹‘suc 𝑛))
53		fveq1 6833	. . . . . 6 ⊢ (𝑓 = 𝐹 → (𝑓‘𝑛) = (𝐹‘𝑛))
54		fveq1 6833	. . . . . 6 ⊢ (𝑓 = 𝐹 → (𝑓‘suc 𝑛) = (𝐹‘suc 𝑛))
55	53, 54	breq12d 5099	. . . . 5 ⊢ (𝑓 = 𝐹 → ((𝑓‘𝑛)𝑥(𝑓‘suc 𝑛) ↔ (𝐹‘𝑛)𝑥(𝐹‘suc 𝑛)))
56	55	ralbidv 3161	. . . 4 ⊢ (𝑓 = 𝐹 → (∀𝑛 ∈ ω (𝑓‘𝑛)𝑥(𝑓‘suc 𝑛) ↔ ∀𝑛 ∈ ω (𝐹‘𝑛)𝑥(𝐹‘suc 𝑛)))
57	8, 52, 56	spcedv 3541	. . 3 ⊢ ((∀𝑦 ∈ 𝒫 dom 𝑥(𝑦 ≠ ∅ → (𝑔‘𝑦) ∈ 𝑦) ∧ ∃𝑧 𝑠𝑥𝑧 ∧ ran 𝑥 ⊆ dom 𝑥) → ∃𝑓∀𝑛 ∈ ω (𝑓‘𝑛)𝑥(𝑓‘suc 𝑛))
58	57	3exp 1120	. 2 ⊢ (∀𝑦 ∈ 𝒫 dom 𝑥(𝑦 ≠ ∅ → (𝑔‘𝑦) ∈ 𝑦) → (∃𝑧 𝑠𝑥𝑧 → (ran 𝑥 ⊆ dom 𝑥 → ∃𝑓∀𝑛 ∈ ω (𝑓‘𝑛)𝑥(𝑓‘suc 𝑛))))
59		vex 3434	. . . . 5 ⊢ 𝑥 ∈ V
60	59	dmex 7853	. . . 4 ⊢ dom 𝑥 ∈ V
61	60	pwex 5317	. . 3 ⊢ 𝒫 dom 𝑥 ∈ V
62	61	ac4c 10389	. 2 ⊢ ∃𝑔∀𝑦 ∈ 𝒫 dom 𝑥(𝑦 ≠ ∅ → (𝑔‘𝑦) ∈ 𝑦)
63	58, 62	exlimiiv 1933	1 ⊢ (∃𝑧 𝑠𝑥𝑧 → (ran 𝑥 ⊆ dom 𝑥 → ∃𝑓∀𝑛 ∈ ω (𝑓‘𝑛)𝑥(𝑓‘suc 𝑛)))

Syntax hints:   → wi 4   ∧ wa 395   ∧ w3a 1087   = wceq 1542  ∃wex 1781   ∈ wcel 2114  {cab 2715   ≠ wne 2933  ∀wral 3052  Vcvv 3430   ⊆ wss 3890  ∅c0 4274  𝒫 cpw 4542   class class class wbr 5086   ↦ cmpt 5167  dom cdm 5624  ran crn 5625   ↾ cres 5626  suc csuc 6319   Fn wfn 6487  ‘cfv 6492  ωcom 7810  reccrdg 8341

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pow 5302  ax-pr 5370  ax-un 7682  ax-inf2 9553  ax-ac2 10376

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-reu 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-pss 3910  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-iun 4936  df-br 5087  df-opab 5149  df-mpt 5168  df-tr 5194  df-id 5519  df-eprel 5524  df-po 5532  df-so 5533  df-fr 5577  df-we 5579  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-pred 6259  df-ord 6320  df-on 6321  df-lim 6322  df-suc 6323  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-ov 7363  df-om 7811  df-2nd 7936  df-frecs 8224  df-wrecs 8255  df-recs 8304  df-rdg 8342  df-ac 10029

This theorem is referenced by:  axdc  10434