Theorem frecuzrdgrcl 10862

Description: The function 𝑅 (used in the definition of the recursive definition generator on upper integers) is a function defined for all natural numbers. (Contributed by Jim Kingdon, 1-Apr-2022.)

Hypotheses

Ref	Expression
frec2uz.1	⊢ (𝜑 → 𝐶 ∈ ℤ)
frec2uz.2	⊢ 𝐺 = frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 𝐶)
frecuzrdgrrn.a	⊢ (𝜑 → 𝐴 ∈ 𝑆)
frecuzrdgrrn.f	⊢ ((𝜑 ∧ (𝑥 ∈ (ℤ≥‘𝐶) ∧ 𝑦 ∈ 𝑆)) → (𝑥𝐹𝑦) ∈ 𝑆)
frecuzrdgrrn.2	⊢ 𝑅 = frec((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑆 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩)

Assertion

Ref	Expression
frecuzrdgrcl	⊢ (𝜑 → 𝑅:ω⟶((ℤ≥‘𝐶) × 𝑆))

Distinct variable groups:   𝑦,𝐴   𝑥,𝐶,𝑦   𝑦,𝐺   𝑥,𝐹,𝑦   𝑥,𝑆,𝑦   𝜑,𝑥,𝑦

Allowed substitution hints:   𝐴(𝑥)   𝑅(𝑥, 𝑦)   𝐺(𝑥)

Proof of Theorem frecuzrdgrcl

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		1st2nd2 6409	. . . . . . 7 ⊢ (𝑧 ∈ ((ℤ≥‘𝐶) × 𝑆) → 𝑧 = ⟨(1st ‘𝑧), (2nd ‘𝑧)⟩)
2	1	adantl 277	. . . . . 6 ⊢ ((𝜑 ∧ 𝑧 ∈ ((ℤ≥‘𝐶) × 𝑆)) → 𝑧 = ⟨(1st ‘𝑧), (2nd ‘𝑧)⟩)
3	2	fveq2d 5699	. . . . 5 ⊢ ((𝜑 ∧ 𝑧 ∈ ((ℤ≥‘𝐶) × 𝑆)) → ((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑆 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)‘𝑧) = ((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑆 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)‘⟨(1st ‘𝑧), (2nd ‘𝑧)⟩))
4		df-ov 6088	. . . . . . 7 ⊢ ((1st ‘𝑧)(𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑆 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)(2nd ‘𝑧)) = ((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑆 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)‘⟨(1st ‘𝑧), (2nd ‘𝑧)⟩)
5		xp1st 6399	. . . . . . . . 9 ⊢ (𝑧 ∈ ((ℤ≥‘𝐶) × 𝑆) → (1st ‘𝑧) ∈ (ℤ≥‘𝐶))
6	5	adantl 277	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑧 ∈ ((ℤ≥‘𝐶) × 𝑆)) → (1st ‘𝑧) ∈ (ℤ≥‘𝐶))
7		xp2nd 6400	. . . . . . . . 9 ⊢ (𝑧 ∈ ((ℤ≥‘𝐶) × 𝑆) → (2nd ‘𝑧) ∈ 𝑆)
8	7	adantl 277	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑧 ∈ ((ℤ≥‘𝐶) × 𝑆)) → (2nd ‘𝑧) ∈ 𝑆)
9		peano2uz 9993	. . . . . . . . . 10 ⊢ ((1st ‘𝑧) ∈ (ℤ≥‘𝐶) → ((1st ‘𝑧) + 1) ∈ (ℤ≥‘𝐶))
10	6, 9	syl 14	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑧 ∈ ((ℤ≥‘𝐶) × 𝑆)) → ((1st ‘𝑧) + 1) ∈ (ℤ≥‘𝐶))
11		frecuzrdgrrn.f	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑥 ∈ (ℤ≥‘𝐶) ∧ 𝑦 ∈ 𝑆)) → (𝑥𝐹𝑦) ∈ 𝑆)
12	11	ralrimivva 2632	. . . . . . . . . . 11 ⊢ (𝜑 → ∀𝑥 ∈ (ℤ≥‘𝐶)∀𝑦 ∈ 𝑆 (𝑥𝐹𝑦) ∈ 𝑆)
13	12	adantr 276	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑧 ∈ ((ℤ≥‘𝐶) × 𝑆)) → ∀𝑥 ∈ (ℤ≥‘𝐶)∀𝑦 ∈ 𝑆 (𝑥𝐹𝑦) ∈ 𝑆)
14		oveq1 6092	. . . . . . . . . . . . 13 ⊢ (𝑥 = (1st ‘𝑧) → (𝑥𝐹𝑦) = ((1st ‘𝑧)𝐹𝑦))
15	14	eleq1d 2307	. . . . . . . . . . . 12 ⊢ (𝑥 = (1st ‘𝑧) → ((𝑥𝐹𝑦) ∈ 𝑆 ↔ ((1st ‘𝑧)𝐹𝑦) ∈ 𝑆))
16		oveq2 6093	. . . . . . . . . . . . 13 ⊢ (𝑦 = (2nd ‘𝑧) → ((1st ‘𝑧)𝐹𝑦) = ((1st ‘𝑧)𝐹(2nd ‘𝑧)))
17	16	eleq1d 2307	. . . . . . . . . . . 12 ⊢ (𝑦 = (2nd ‘𝑧) → (((1st ‘𝑧)𝐹𝑦) ∈ 𝑆 ↔ ((1st ‘𝑧)𝐹(2nd ‘𝑧)) ∈ 𝑆))
18	15, 17	rspc2v 2943	. . . . . . . . . . 11 ⊢ (((1st ‘𝑧) ∈ (ℤ≥‘𝐶) ∧ (2nd ‘𝑧) ∈ 𝑆) → (∀𝑥 ∈ (ℤ≥‘𝐶)∀𝑦 ∈ 𝑆 (𝑥𝐹𝑦) ∈ 𝑆 → ((1st ‘𝑧)𝐹(2nd ‘𝑧)) ∈ 𝑆))
19	6, 8, 18	syl2anc 415	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑧 ∈ ((ℤ≥‘𝐶) × 𝑆)) → (∀𝑥 ∈ (ℤ≥‘𝐶)∀𝑦 ∈ 𝑆 (𝑥𝐹𝑦) ∈ 𝑆 → ((1st ‘𝑧)𝐹(2nd ‘𝑧)) ∈ 𝑆))
20	13, 19	mpd 13	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑧 ∈ ((ℤ≥‘𝐶) × 𝑆)) → ((1st ‘𝑧)𝐹(2nd ‘𝑧)) ∈ 𝑆)
21		opelxp 4804	. . . . . . . . 9 ⊢ (⟨((1st ‘𝑧) + 1), ((1st ‘𝑧)𝐹(2nd ‘𝑧))⟩ ∈ ((ℤ≥‘𝐶) × 𝑆) ↔ (((1st ‘𝑧) + 1) ∈ (ℤ≥‘𝐶) ∧ ((1st ‘𝑧)𝐹(2nd ‘𝑧)) ∈ 𝑆))
22	10, 20, 21	sylanbrc 421	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑧 ∈ ((ℤ≥‘𝐶) × 𝑆)) → ⟨((1st ‘𝑧) + 1), ((1st ‘𝑧)𝐹(2nd ‘𝑧))⟩ ∈ ((ℤ≥‘𝐶) × 𝑆))
23		oveq1 6092	. . . . . . . . . 10 ⊢ (𝑥 = (1st ‘𝑧) → (𝑥 + 1) = ((1st ‘𝑧) + 1))
24	23, 14	opeq12d 3912	. . . . . . . . 9 ⊢ (𝑥 = (1st ‘𝑧) → ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩ = ⟨((1st ‘𝑧) + 1), ((1st ‘𝑧)𝐹𝑦)⟩)
25	16	opeq2d 3911	. . . . . . . . 9 ⊢ (𝑦 = (2nd ‘𝑧) → ⟨((1st ‘𝑧) + 1), ((1st ‘𝑧)𝐹𝑦)⟩ = ⟨((1st ‘𝑧) + 1), ((1st ‘𝑧)𝐹(2nd ‘𝑧))⟩)
26		eqid 2238	. . . . . . . . 9 ⊢ (𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑆 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩) = (𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑆 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)
27	24, 25, 26	ovmpog 6223	. . . . . . . 8 ⊢ (((1st ‘𝑧) ∈ (ℤ≥‘𝐶) ∧ (2nd ‘𝑧) ∈ 𝑆 ∧ ⟨((1st ‘𝑧) + 1), ((1st ‘𝑧)𝐹(2nd ‘𝑧))⟩ ∈ ((ℤ≥‘𝐶) × 𝑆)) → ((1st ‘𝑧)(𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑆 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)(2nd ‘𝑧)) = ⟨((1st ‘𝑧) + 1), ((1st ‘𝑧)𝐹(2nd ‘𝑧))⟩)
28	6, 8, 22, 27	syl3anc 1278	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑧 ∈ ((ℤ≥‘𝐶) × 𝑆)) → ((1st ‘𝑧)(𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑆 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)(2nd ‘𝑧)) = ⟨((1st ‘𝑧) + 1), ((1st ‘𝑧)𝐹(2nd ‘𝑧))⟩)
29	4, 28	eqtr3id 2285	. . . . . 6 ⊢ ((𝜑 ∧ 𝑧 ∈ ((ℤ≥‘𝐶) × 𝑆)) → ((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑆 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)‘⟨(1st ‘𝑧), (2nd ‘𝑧)⟩) = ⟨((1st ‘𝑧) + 1), ((1st ‘𝑧)𝐹(2nd ‘𝑧))⟩)
30	29, 22	eqeltrd 2315	. . . . 5 ⊢ ((𝜑 ∧ 𝑧 ∈ ((ℤ≥‘𝐶) × 𝑆)) → ((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑆 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)‘⟨(1st ‘𝑧), (2nd ‘𝑧)⟩) ∈ ((ℤ≥‘𝐶) × 𝑆))
31	3, 30	eqeltrd 2315	. . . 4 ⊢ ((𝜑 ∧ 𝑧 ∈ ((ℤ≥‘𝐶) × 𝑆)) → ((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑆 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)‘𝑧) ∈ ((ℤ≥‘𝐶) × 𝑆))
32	31	ralrimiva 2623	. . 3 ⊢ (𝜑 → ∀𝑧 ∈ ((ℤ≥‘𝐶) × 𝑆)((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑆 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)‘𝑧) ∈ ((ℤ≥‘𝐶) × 𝑆))
33		frec2uz.1	. . . . 5 ⊢ (𝜑 → 𝐶 ∈ ℤ)
34		uzid 9946	. . . . 5 ⊢ (𝐶 ∈ ℤ → 𝐶 ∈ (ℤ≥‘𝐶))
35	33, 34	syl 14	. . . 4 ⊢ (𝜑 → 𝐶 ∈ (ℤ≥‘𝐶))
36		frecuzrdgrrn.a	. . . 4 ⊢ (𝜑 → 𝐴 ∈ 𝑆)
37		opelxp 4804	. . . 4 ⊢ (⟨𝐶, 𝐴⟩ ∈ ((ℤ≥‘𝐶) × 𝑆) ↔ (𝐶 ∈ (ℤ≥‘𝐶) ∧ 𝐴 ∈ 𝑆))
38	35, 36, 37	sylanbrc 421	. . 3 ⊢ (𝜑 → ⟨𝐶, 𝐴⟩ ∈ ((ℤ≥‘𝐶) × 𝑆))
39		frecfcl 6676	. . 3 ⊢ ((∀𝑧 ∈ ((ℤ≥‘𝐶) × 𝑆)((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑆 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)‘𝑧) ∈ ((ℤ≥‘𝐶) × 𝑆) ∧ ⟨𝐶, 𝐴⟩ ∈ ((ℤ≥‘𝐶) × 𝑆)) → frec((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑆 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩):ω⟶((ℤ≥‘𝐶) × 𝑆))
40	32, 38, 39	syl2anc 415	. 2 ⊢ (𝜑 → frec((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑆 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩):ω⟶((ℤ≥‘𝐶) × 𝑆))
41		frecuzrdgrrn.2	. . 3 ⊢ 𝑅 = frec((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑆 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩)
42	41	feq1i 5526	. 2 ⊢ (𝑅:ω⟶((ℤ≥‘𝐶) × 𝑆) ↔ frec((𝑥 ∈ (ℤ≥‘𝐶), 𝑦 ∈ 𝑆 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩):ω⟶((ℤ≥‘𝐶) × 𝑆))
43	40, 42	sylibr 134	1 ⊢ (𝜑 → 𝑅:ω⟶((ℤ≥‘𝐶) × 𝑆))

This proof depends on syntax axioms:   → wi 4   ∧ wa 104   = wceq 1402   ∈ wcel 2209  ∀wral 2528  ⟨cop 3712   ↦ cmpt 4192  ωcom 4737   × cxp 4772  ⟶wf 5373  ‘cfv 5377  (class class class)co 6085   ∈ cmpo 6087  1^st c1st 6372  2^nd c2nd 6373  freccfrec 6661  1c1 8181   + caddc 8183  ℤcz 9649  ℤ_≥cuz 9931

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4246  ax-sep 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-iinf 4735  ax-cnex 8271  ax-resscn 8272  ax-1cn 8273  ax-1re 8274  ax-icn 8275  ax-addcl 8276  ax-addrcl 8277  ax-mulcl 8278  ax-addcom 8280  ax-addass 8282  ax-distr 8284  ax-i2m1 8285  ax-0lt1 8286  ax-0id 8288  ax-rnegex 8289  ax-cnre 8291  ax-pre-ltirr 8292  ax-pre-ltwlin 8293  ax-pre-lttrn 8294  ax-pre-ltadd 8296

This proof depends on definitions:  df-bi 117  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-tr 4230  df-id 4438  df-iord 4511  df-on 4513  df-ilim 4514  df-suc 4516  df-iom 4738  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-recs 6576  df-frec 6662  df-pnf 8363  df-mnf 8364  df-xr 8365  df-ltxr 8366  df-le 8367  df-sub 8501  df-neg 8502  df-inn 9308  df-n0 9569  df-z 9650  df-uz 9932

This theorem is used by:  frecuzrdglem  10863  frecuzrdgtcl  10864  frecuzrdg0  10865