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

Theorem rdgellim 38133
Description: Elementhood in a recursive definition at a limit ordinal. (Contributed by ML, 30-Mar-2022.)
Assertion
Ref Expression
rdgellim (((𝐵 ∈ On ∧ Lim 𝐵) ∧ 𝐶𝐵) → (𝑋 ∈ (rec(𝐹, 𝐴)‘𝐶) → 𝑋 ∈ (rec(𝐹, 𝐴)‘𝐵)))

Proof of Theorem rdgellim
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 fveq2 6879 . . . . . . 7 (𝑦 = 𝐶 → (rec(𝐹, 𝐴)‘𝑦) = (rec(𝐹, 𝐴)‘𝐶))
21eleq2d 2846 . . . . . 6 (𝑦 = 𝐶 → (𝑋 ∈ (rec(𝐹, 𝐴)‘𝑦) ↔ 𝑋 ∈ (rec(𝐹, 𝐴)‘𝐶)))
32rspcev 3576 . . . . 5 ((𝐶𝐵𝑋 ∈ (rec(𝐹, 𝐴)‘𝐶)) → ∃𝑦𝐵 𝑋 ∈ (rec(𝐹, 𝐴)‘𝑦))
43ex 418 . . . 4 (𝐶𝐵 → (𝑋 ∈ (rec(𝐹, 𝐴)‘𝐶) → ∃𝑦𝐵 𝑋 ∈ (rec(𝐹, 𝐴)‘𝑦)))
5 eliun 4955 . . . 4 (𝑋 𝑦𝐵 (rec(𝐹, 𝐴)‘𝑦) ↔ ∃𝑦𝐵 𝑋 ∈ (rec(𝐹, 𝐴)‘𝑦))
64, 5imbitrrdi 255 . . 3 (𝐶𝐵 → (𝑋 ∈ (rec(𝐹, 𝐴)‘𝐶) → 𝑋 𝑦𝐵 (rec(𝐹, 𝐴)‘𝑦)))
76adantl 487 . 2 (((𝐵 ∈ On ∧ Lim 𝐵) ∧ 𝐶𝐵) → (𝑋 ∈ (rec(𝐹, 𝐴)‘𝐶) → 𝑋 𝑦𝐵 (rec(𝐹, 𝐴)‘𝑦)))
8 rdglim2a 8423 . . . 4 ((𝐵 ∈ On ∧ Lim 𝐵) → (rec(𝐹, 𝐴)‘𝐵) = 𝑦𝐵 (rec(𝐹, 𝐴)‘𝑦))
98eleq2d 2846 . . 3 ((𝐵 ∈ On ∧ Lim 𝐵) → (𝑋 ∈ (rec(𝐹, 𝐴)‘𝐵) ↔ 𝑋 𝑦𝐵 (rec(𝐹, 𝐴)‘𝑦)))
109adantr 486 . 2 (((𝐵 ∈ On ∧ Lim 𝐵) ∧ 𝐶𝐵) → (𝑋 ∈ (rec(𝐹, 𝐴)‘𝐵) ↔ 𝑋 𝑦𝐵 (rec(𝐹, 𝐴)‘𝑦)))
117, 10sylibrd 262 1 (((𝐵 ∈ On ∧ Lim 𝐵) ∧ 𝐶𝐵) → (𝑋 ∈ (rec(𝐹, 𝐴)‘𝐶) → 𝑋 ∈ (rec(𝐹, 𝐴)‘𝐵)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wb 209  wa 401   = wceq 1570  wcel 2145  wrex 3086   ciun 4951  Oncon0 6357  Lim wlim 6358  cfv 6533  reccrdg 8399
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 2732  ax-rep 5232  ax-sep 5251  ax-nul 5263  ax-pr 5398  ax-un 7737
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 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  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 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6299  df-ord 6360  df-on 6361  df-lim 6362  df-suc 6363  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-ov 7417  df-2nd 7988  df-frecs 8281  df-wrecs 8312  df-recs 8361  df-rdg 8400
This theorem is used by:  rdglimss  38134  exrecfnlem  38136
  Copyright terms: Public domain W3C validator