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 37432
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 8466 . . 3 (𝐴 ∈ 𝑃 → (rec(𝐺, 𝐴)‘∅) = 𝐴)
2 eleq1a 2859 . . 3 (𝐴 ∈ 𝑃 → ((rec(𝐺, 𝐴)‘∅) = 𝐴 → (rec(𝐺, 𝐴)‘∅) ∈ 𝑃))
31, 2mpd 16 . 2 (𝐴 ∈ 𝑃 → (rec(𝐺, 𝐴)‘∅) ∈ 𝑃)
4 nnon 7910 . . . 4 (𝑦 ∈ ω → 𝑦 ∈ On)
5 fveq2 6911 . . . . . . 7 (𝑧 = (rec(𝐺, 𝐴)‘𝑦) → (𝐺‘𝑧) = (𝐺‘(rec(𝐺, 𝐴)‘𝑦)))
65eleq1d 2849 . . . . . 6 (𝑧 = (rec(𝐺, 𝐴)‘𝑦) → ((𝐺‘𝑧) ∈ 𝑃 ↔ (𝐺‘(rec(𝐺, 𝐴)‘𝑦)) ∈ 𝑃))
7 findreccl.1 . . . . . 6 (𝑧 ∈ 𝑃 → (𝐺‘𝑧) ∈ 𝑃)
86, 7vtoclga 3540 . . . . 5 ((rec(𝐺, 𝐴)‘𝑦) ∈ 𝑃 → (𝐺‘(rec(𝐺, 𝐴)‘𝑦)) ∈ 𝑃)
9 rdgsuc 8463 . . . . . 6 (𝑦 ∈ On → (rec(𝐺, 𝐴)‘suc 𝑦) = (𝐺‘(rec(𝐺, 𝐴)‘𝑦)))
109eleq1d 2849 . . . . 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 37431 1 (𝐶 ∈ ω → (𝐴 ∈ 𝑃 → (rec(𝐺, 𝐴)‘𝐶) ∈ 𝑃))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2147  ∅c0 4281  Oncon0 6383  suc csuc 6385  ‘cfv 6561  ωcom 7904  reccrdg 8448
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5236  ax-sep 5253  ax-nul 5264  ax-pr 5396  ax-un 7778
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5172  df-mpt 5191  df-tr 5217  df-id 5551  df-eprel 5556  df-po 5564  df-so 5565  df-fr 5609  df-we 5611  df-xp 5662  df-rel 5663  df-cnv 5664  df-co 5665  df-dm 5666  df-rn 5667  df-res 5668  df-ima 5669  df-pred 6325  df-ord 6386  df-on 6387  df-lim 6388  df-suc 6389  df-iota 6515  df-fun 6563  df-fn 6564  df-f 6565  df-f1 6566  df-fo 6567  df-f1o 6568  df-fv 6569  df-ov 7449  df-om 7905  df-2nd 8029  df-frecs 8330  df-wrecs 8361  df-recs 8410  df-rdg 8449
This theorem is used by:  findabrcl  37433
  Copyright terms: Public domain W3C validator