Users' Mathboxes Mathbox for Jeff Hoffman < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  findreccl Structured version   Visualization version   GIF version

Theorem findreccl 37211
Description: Please add description here. (Contributed by Jeff Hoffman, 19-Feb-2008.)
Hypothesis
Ref Expression
findreccl.1 (𝑧 ∈ 𝑃 → (𝐺‘𝑧) ∈ 𝑃)
Assertion
Ref Expression
findreccl (𝐶 ∈ ω → (𝐴 ∈ 𝑃 → (rec(𝐺, 𝐴)‘𝐶) ∈ 𝑃))
Distinct variable groups:   𝑧,𝐺   𝑧,𝐴   𝑧,𝑃
Allowed substitution hint:   𝐶(𝑧)

Proof of Theorem findreccl
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 rdg0g 8419 . . 3 (𝐴 ∈ 𝑃 → (rec(𝐺, 𝐴)‘∅) = 𝐴)
2 eleq1a 2856 . . 3 (𝐴 ∈ 𝑃 → ((rec(𝐺, 𝐴)‘∅) = 𝐴 → (rec(𝐺, 𝐴)‘∅) ∈ 𝑃))
31, 2mpd 16 . 2 (𝐴 ∈ 𝑃 → (rec(𝐺, 𝐴)‘∅) ∈ 𝑃)
4 nnon 7872 . . . 4 (𝑦 ∈ ω → 𝑦 ∈ On)
5 fveq2 6877 . . . . . . 7 (𝑧 = (rec(𝐺, 𝐴)‘𝑦) → (𝐺‘𝑧) = (𝐺‘(rec(𝐺, 𝐴)‘𝑦)))
65eleq1d 2846 . . . . . 6 (𝑧 = (rec(𝐺, 𝐴)‘𝑦) → ((𝐺‘𝑧) ∈ 𝑃 ↔ (𝐺‘(rec(𝐺, 𝐴)‘𝑦)) ∈ 𝑃))
7 findreccl.1 . . . . . 6 (𝑧 ∈ 𝑃 → (𝐺‘𝑧) ∈ 𝑃)
86, 7vtoclga 3537 . . . . 5 ((rec(𝐺, 𝐴)‘𝑦) ∈ 𝑃 → (𝐺‘(rec(𝐺, 𝐴)‘𝑦)) ∈ 𝑃)
9 rdgsuc 8416 . . . . . 6 (𝑦 ∈ On → (rec(𝐺, 𝐴)‘suc 𝑦) = (𝐺‘(rec(𝐺, 𝐴)‘𝑦)))
109eleq1d 2846 . . . . 5 (𝑦 ∈ On → ((rec(𝐺, 𝐴)‘suc 𝑦) ∈ 𝑃 ↔ (𝐺‘(rec(𝐺, 𝐴)‘𝑦)) ∈ 𝑃))
118, 10imbitrrid 249 . . . 4 (𝑦 ∈ On → ((rec(𝐺, 𝐴)‘𝑦) ∈ 𝑃 → (rec(𝐺, 𝐴)‘suc 𝑦) ∈ 𝑃))
124, 11syl 18 . . 3 (𝑦 ∈ ω → ((rec(𝐺, 𝐴)‘𝑦) ∈ 𝑃 → (rec(𝐺, 𝐴)‘suc 𝑦) ∈ 𝑃))
1312a1d 26 . 2 (𝑦 ∈ ω → (𝐴 ∈ 𝑃 → ((rec(𝐺, 𝐴)‘𝑦) ∈ 𝑃 → (rec(𝐺, 𝐴)‘suc 𝑦) ∈ 𝑃)))
143, 13findfvcl 37210 1 (𝐶 ∈ ω → (𝐴 ∈ 𝑃 → (rec(𝐺, 𝐴)‘𝐶) ∈ 𝑃))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2145  ∅c0 4279  Oncon0 6355  suc csuc 6357  ‘cfv 6531  ωcom 7866  reccrdg 8401
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pr 5391  ax-un 7740
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-pred 6297  df-ord 6358  df-on 6359  df-lim 6360  df-suc 6361  df-iota 6487  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-ov 7415  df-om 7867  df-2nd 7991  df-frecs 8283  df-wrecs 8314  df-recs 8363  df-rdg 8402
This theorem is used by:  findabrcl  37212
  Copyright terms: Public domain W3C validator