ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  frecrdg GIF version

Theorem frecrdg 6679
Description: Transfinite recursion restricted to omega.

Given a suitable characteristic function, df-frec 6662 produces the same results as df-irdg 6641 restricted to ω.

Presumably the theorem would also hold if 𝐹 Fn V were changed to ∀𝑧(𝐹‘𝑧) ∈ V. (Contributed by Jim Kingdon, 29-Aug-2019.)

Hypotheses
Ref Expression
frecrdg.1 (𝜑 → 𝐹 Fn V)
frecrdg.2 (𝜑 → 𝐴 ∈ 𝑉)
frecrdg.inc (𝜑 → ∀𝑥 𝑥 ⊆ (𝐹‘𝑥))
Assertion
Ref Expression
frecrdg (𝜑 → frec(𝐹, 𝐴) = (rec(𝐹, 𝐴) ↾ ω))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐹   𝑥,𝑉   𝜑,𝑥

Proof of Theorem frecrdg
Dummy variables 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 frecrdg.1 . . . 4 (𝜑 → 𝐹 Fn V)
2 vex 2824 . . . . . 6 𝑧 ∈ V
3 funfvex 5712 . . . . . . 7 ((Fun 𝐹 ∧ 𝑧 ∈ dom 𝐹) → (𝐹‘𝑧) ∈ V)
43funfni 5483 . . . . . 6 ((𝐹 Fn V ∧ 𝑧 ∈ V) → (𝐹‘𝑧) ∈ V)
52, 4mpan2 429 . . . . 5 (𝐹 Fn V → (𝐹‘𝑧) ∈ V)
65alrimiv 1927 . . . 4 (𝐹 Fn V → ∀𝑧(𝐹‘𝑧) ∈ V)
71, 6syl 14 . . 3 (𝜑 → ∀𝑧(𝐹‘𝑧) ∈ V)
8 frecrdg.2 . . 3 (𝜑 → 𝐴 ∈ 𝑉)
9 frecfnom 6672 . . 3 ((∀𝑧(𝐹‘𝑧) ∈ V ∧ 𝐴 ∈ 𝑉) → frec(𝐹, 𝐴) Fn ω)
107, 8, 9syl2anc 415 . 2 (𝜑 → frec(𝐹, 𝐴) Fn ω)
11 rdgifnon2 6651 . . . 4 ((∀𝑧(𝐹‘𝑧) ∈ V ∧ 𝐴 ∈ 𝑉) → rec(𝐹, 𝐴) Fn On)
127, 8, 11syl2anc 415 . . 3 (𝜑 → rec(𝐹, 𝐴) Fn On)
13 omsson 4760 . . 3 ω ⊆ On
14 fnssres 5496 . . 3 ((rec(𝐹, 𝐴) Fn On ∧ ω ⊆ On) → (rec(𝐹, 𝐴) ↾ ω) Fn ω)
1512, 13, 14sylancl 417 . 2 (𝜑 → (rec(𝐹, 𝐴) ↾ ω) Fn ω)
16 fveq2 5695 . . . . 5 (𝑥 = ∅ → (frec(𝐹, 𝐴)‘𝑥) = (frec(𝐹, 𝐴)‘∅))
17 fveq2 5695 . . . . 5 (𝑥 = ∅ → ((rec(𝐹, 𝐴) ↾ ω)‘𝑥) = ((rec(𝐹, 𝐴) ↾ ω)‘∅))
1816, 17eqeq12d 2253 . . . 4 (𝑥 = ∅ → ((frec(𝐹, 𝐴)‘𝑥) = ((rec(𝐹, 𝐴) ↾ ω)‘𝑥) ↔ (frec(𝐹, 𝐴)‘∅) = ((rec(𝐹, 𝐴) ↾ ω)‘∅)))
19 fveq2 5695 . . . . 5 (𝑥 = 𝑦 → (frec(𝐹, 𝐴)‘𝑥) = (frec(𝐹, 𝐴)‘𝑦))
20 fveq2 5695 . . . . 5 (𝑥 = 𝑦 → ((rec(𝐹, 𝐴) ↾ ω)‘𝑥) = ((rec(𝐹, 𝐴) ↾ ω)‘𝑦))
2119, 20eqeq12d 2253 . . . 4 (𝑥 = 𝑦 → ((frec(𝐹, 𝐴)‘𝑥) = ((rec(𝐹, 𝐴) ↾ ω)‘𝑥) ↔ (frec(𝐹, 𝐴)‘𝑦) = ((rec(𝐹, 𝐴) ↾ ω)‘𝑦)))
22 fveq2 5695 . . . . 5 (𝑥 = suc 𝑦 → (frec(𝐹, 𝐴)‘𝑥) = (frec(𝐹, 𝐴)‘suc 𝑦))
23 fveq2 5695 . . . . 5 (𝑥 = suc 𝑦 → ((rec(𝐹, 𝐴) ↾ ω)‘𝑥) = ((rec(𝐹, 𝐴) ↾ ω)‘suc 𝑦))
2422, 23eqeq12d 2253 . . . 4 (𝑥 = suc 𝑦 → ((frec(𝐹, 𝐴)‘𝑥) = ((rec(𝐹, 𝐴) ↾ ω)‘𝑥) ↔ (frec(𝐹, 𝐴)‘suc 𝑦) = ((rec(𝐹, 𝐴) ↾ ω)‘suc 𝑦)))
25 frec0g 6668 . . . . . 6 (𝐴 ∈ 𝑉 → (frec(𝐹, 𝐴)‘∅) = 𝐴)
268, 25syl 14 . . . . 5 (𝜑 → (frec(𝐹, 𝐴)‘∅) = 𝐴)
27 peano1 4741 . . . . . . 7 ∅ ∈ ω
28 fvres 5719 . . . . . . 7 (∅ ∈ ω → ((rec(𝐹, 𝐴) ↾ ω)‘∅) = (rec(𝐹, 𝐴)‘∅))
2927, 28ax-mp 5 . . . . . 6 ((rec(𝐹, 𝐴) ↾ ω)‘∅) = (rec(𝐹, 𝐴)‘∅)
30 rdg0g 6659 . . . . . . 7 (𝐴 ∈ 𝑉 → (rec(𝐹, 𝐴)‘∅) = 𝐴)
318, 30syl 14 . . . . . 6 (𝜑 → (rec(𝐹, 𝐴)‘∅) = 𝐴)
3229, 31eqtrid 2283 . . . . 5 (𝜑 → ((rec(𝐹, 𝐴) ↾ ω)‘∅) = 𝐴)
3326, 32eqtr4d 2274 . . . 4 (𝜑 → (frec(𝐹, 𝐴)‘∅) = ((rec(𝐹, 𝐴) ↾ ω)‘∅))
34 simpr 110 . . . . . . . . . 10 (((𝜑 ∧ 𝑦 ∈ ω) ∧ (frec(𝐹, 𝐴)‘𝑦) = ((rec(𝐹, 𝐴) ↾ ω)‘𝑦)) → (frec(𝐹, 𝐴)‘𝑦) = ((rec(𝐹, 𝐴) ↾ ω)‘𝑦))
35 fvres 5719 . . . . . . . . . . 11 (𝑦 ∈ ω → ((rec(𝐹, 𝐴) ↾ ω)‘𝑦) = (rec(𝐹, 𝐴)‘𝑦))
3635ad2antlr 493 . . . . . . . . . 10 (((𝜑 ∧ 𝑦 ∈ ω) ∧ (frec(𝐹, 𝐴)‘𝑦) = ((rec(𝐹, 𝐴) ↾ ω)‘𝑦)) → ((rec(𝐹, 𝐴) ↾ ω)‘𝑦) = (rec(𝐹, 𝐴)‘𝑦))
3734, 36eqtrd 2271 . . . . . . . . 9 (((𝜑 ∧ 𝑦 ∈ ω) ∧ (frec(𝐹, 𝐴)‘𝑦) = ((rec(𝐹, 𝐴) ↾ ω)‘𝑦)) → (frec(𝐹, 𝐴)‘𝑦) = (rec(𝐹, 𝐴)‘𝑦))
3837fveq2d 5699 . . . . . . . 8 (((𝜑 ∧ 𝑦 ∈ ω) ∧ (frec(𝐹, 𝐴)‘𝑦) = ((rec(𝐹, 𝐴) ↾ ω)‘𝑦)) → (𝐹‘(frec(𝐹, 𝐴)‘𝑦)) = (𝐹‘(rec(𝐹, 𝐴)‘𝑦)))
397, 8jca 306 . . . . . . . . . 10 (𝜑 → (∀𝑧(𝐹‘𝑧) ∈ V ∧ 𝐴 ∈ 𝑉))
40 simp1 1028 . . . . . . . . . . . . 13 ((∀𝑧(𝐹‘𝑧) ∈ V ∧ 𝐴 ∈ 𝑉 ∧ 𝑦 ∈ ω) → ∀𝑧(𝐹‘𝑧) ∈ V)
41 ralv 2839 . . . . . . . . . . . . 13 (∀𝑧 ∈ V (𝐹‘𝑧) ∈ V ↔ ∀𝑧(𝐹‘𝑧) ∈ V)
4240, 41sylibr 134 . . . . . . . . . . . 12 ((∀𝑧(𝐹‘𝑧) ∈ V ∧ 𝐴 ∈ 𝑉 ∧ 𝑦 ∈ ω) → ∀𝑧 ∈ V (𝐹‘𝑧) ∈ V)
43 simp2 1029 . . . . . . . . . . . . 13 ((∀𝑧(𝐹‘𝑧) ∈ V ∧ 𝐴 ∈ 𝑉 ∧ 𝑦 ∈ ω) → 𝐴 ∈ 𝑉)
4443elexd 2835 . . . . . . . . . . . 12 ((∀𝑧(𝐹‘𝑧) ∈ V ∧ 𝐴 ∈ 𝑉 ∧ 𝑦 ∈ ω) → 𝐴 ∈ V)
45 simp3 1030 . . . . . . . . . . . 12 ((∀𝑧(𝐹‘𝑧) ∈ V ∧ 𝐴 ∈ 𝑉 ∧ 𝑦 ∈ ω) → 𝑦 ∈ ω)
46 frecsuc 6678 . . . . . . . . . . . 12 ((∀𝑧 ∈ V (𝐹‘𝑧) ∈ V ∧ 𝐴 ∈ V ∧ 𝑦 ∈ ω) → (frec(𝐹, 𝐴)‘suc 𝑦) = (𝐹‘(frec(𝐹, 𝐴)‘𝑦)))
4742, 44, 45, 46syl3anc 1278 . . . . . . . . . . 11 ((∀𝑧(𝐹‘𝑧) ∈ V ∧ 𝐴 ∈ 𝑉 ∧ 𝑦 ∈ ω) → (frec(𝐹, 𝐴)‘suc 𝑦) = (𝐹‘(frec(𝐹, 𝐴)‘𝑦)))
48473expa 1234 . . . . . . . . . 10 (((∀𝑧(𝐹‘𝑧) ∈ V ∧ 𝐴 ∈ 𝑉) ∧ 𝑦 ∈ ω) → (frec(𝐹, 𝐴)‘suc 𝑦) = (𝐹‘(frec(𝐹, 𝐴)‘𝑦)))
4939, 48sylan 283 . . . . . . . . 9 ((𝜑 ∧ 𝑦 ∈ ω) → (frec(𝐹, 𝐴)‘suc 𝑦) = (𝐹‘(frec(𝐹, 𝐴)‘𝑦)))
5049adantr 276 . . . . . . . 8 (((𝜑 ∧ 𝑦 ∈ ω) ∧ (frec(𝐹, 𝐴)‘𝑦) = ((rec(𝐹, 𝐴) ↾ ω)‘𝑦)) → (frec(𝐹, 𝐴)‘suc 𝑦) = (𝐹‘(frec(𝐹, 𝐴)‘𝑦)))
511adantr 276 . . . . . . . . . 10 ((𝜑 ∧ 𝑦 ∈ ω) → 𝐹 Fn V)
528adantr 276 . . . . . . . . . 10 ((𝜑 ∧ 𝑦 ∈ ω) → 𝐴 ∈ 𝑉)
53 simpr 110 . . . . . . . . . . 11 ((𝜑 ∧ 𝑦 ∈ ω) → 𝑦 ∈ ω)
54 nnon 4757 . . . . . . . . . . 11 (𝑦 ∈ ω → 𝑦 ∈ On)
5553, 54syl 14 . . . . . . . . . 10 ((𝜑 ∧ 𝑦 ∈ ω) → 𝑦 ∈ On)
56 frecrdg.inc . . . . . . . . . . 11 (𝜑 → ∀𝑥 𝑥 ⊆ (𝐹‘𝑥))
5756adantr 276 . . . . . . . . . 10 ((𝜑 ∧ 𝑦 ∈ ω) → ∀𝑥 𝑥 ⊆ (𝐹‘𝑥))
5851, 52, 55, 57rdgisucinc 6656 . . . . . . . . 9 ((𝜑 ∧ 𝑦 ∈ ω) → (rec(𝐹, 𝐴)‘suc 𝑦) = (𝐹‘(rec(𝐹, 𝐴)‘𝑦)))
5958adantr 276 . . . . . . . 8 (((𝜑 ∧ 𝑦 ∈ ω) ∧ (frec(𝐹, 𝐴)‘𝑦) = ((rec(𝐹, 𝐴) ↾ ω)‘𝑦)) → (rec(𝐹, 𝐴)‘suc 𝑦) = (𝐹‘(rec(𝐹, 𝐴)‘𝑦)))
6038, 50, 593eqtr4d 2281 . . . . . . 7 (((𝜑 ∧ 𝑦 ∈ ω) ∧ (frec(𝐹, 𝐴)‘𝑦) = ((rec(𝐹, 𝐴) ↾ ω)‘𝑦)) → (frec(𝐹, 𝐴)‘suc 𝑦) = (rec(𝐹, 𝐴)‘suc 𝑦))
61 peano2 4742 . . . . . . . . 9 (𝑦 ∈ ω → suc 𝑦 ∈ ω)
62 fvres 5719 . . . . . . . . 9 (suc 𝑦 ∈ ω → ((rec(𝐹, 𝐴) ↾ ω)‘suc 𝑦) = (rec(𝐹, 𝐴)‘suc 𝑦))
6361, 62syl 14 . . . . . . . 8 (𝑦 ∈ ω → ((rec(𝐹, 𝐴) ↾ ω)‘suc 𝑦) = (rec(𝐹, 𝐴)‘suc 𝑦))
6463ad2antlr 493 . . . . . . 7 (((𝜑 ∧ 𝑦 ∈ ω) ∧ (frec(𝐹, 𝐴)‘𝑦) = ((rec(𝐹, 𝐴) ↾ ω)‘𝑦)) → ((rec(𝐹, 𝐴) ↾ ω)‘suc 𝑦) = (rec(𝐹, 𝐴)‘suc 𝑦))
6560, 64eqtr4d 2274 . . . . . 6 (((𝜑 ∧ 𝑦 ∈ ω) ∧ (frec(𝐹, 𝐴)‘𝑦) = ((rec(𝐹, 𝐴) ↾ ω)‘𝑦)) → (frec(𝐹, 𝐴)‘suc 𝑦) = ((rec(𝐹, 𝐴) ↾ ω)‘suc 𝑦))
6665ex 115 . . . . 5 ((𝜑 ∧ 𝑦 ∈ ω) → ((frec(𝐹, 𝐴)‘𝑦) = ((rec(𝐹, 𝐴) ↾ ω)‘𝑦) → (frec(𝐹, 𝐴)‘suc 𝑦) = ((rec(𝐹, 𝐴) ↾ ω)‘suc 𝑦)))
6766expcom 116 . . . 4 (𝑦 ∈ ω → (𝜑 → ((frec(𝐹, 𝐴)‘𝑦) = ((rec(𝐹, 𝐴) ↾ ω)‘𝑦) → (frec(𝐹, 𝐴)‘suc 𝑦) = ((rec(𝐹, 𝐴) ↾ ω)‘suc 𝑦))))
6818, 21, 24, 33, 67finds2 4748 . . 3 (𝑥 ∈ ω → (𝜑 → (frec(𝐹, 𝐴)‘𝑥) = ((rec(𝐹, 𝐴) ↾ ω)‘𝑥)))
6968impcom 125 . 2 ((𝜑 ∧ 𝑥 ∈ ω) → (frec(𝐹, 𝐴)‘𝑥) = ((rec(𝐹, 𝐴) ↾ ω)‘𝑥))
7010, 15, 69eqfnfvd 5809 1 (𝜑 → frec(𝐹, 𝐴) = (rec(𝐹, 𝐴) ↾ ω))
Colors of variables:    wff set class
This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ∧ w3a 1009  ∀wal 1400   = wceq 1402   ∈ wcel 2209  ∀wral 2528  Vcvv 2821   ⊆ wss 3220  ∅c0 3520  Oncon0 4508  suc csuc 4510  ωcom 4737   ↾ cres 4776   Fn wfn 5372  ‘cfv 5377  reccrdg 6640  freccfrec 6661
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
This proof depends on definitions:  df-bi 117  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-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-recs 6576  df-irdg 6641  df-frec 6662
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator