| Mathbox for ML |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > rdgsucuni | Structured version Visualization version GIF version | ||
| Description: If an ordinal number has a predecessor, the value of the recursive definition generator at that number in terms of its predecessor. (Contributed by ML, 17-Oct-2020.) |
| Ref | Expression |
|---|---|
| rdgsucuni | ⊢ ((𝐵 ∈ On ∧ 𝐵 ≠ ∅ ∧ ¬ Lim 𝐵) → (rec(𝐹, 𝐼)‘𝐵) = (𝐹‘(rec(𝐹, 𝐼)‘∪ 𝐵))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | onsucuni3 38129 | . . 3 ⊢ ((𝐵 ∈ On ∧ 𝐵 ≠ ∅ ∧ ¬ Lim 𝐵) → 𝐵 = suc ∪ 𝐵) | |
| 2 | 1 | fveq2d 6886 | . 2 ⊢ ((𝐵 ∈ On ∧ 𝐵 ≠ ∅ ∧ ¬ Lim 𝐵) → (rec(𝐹, 𝐼)‘𝐵) = (rec(𝐹, 𝐼)‘suc ∪ 𝐵)) |
| 3 | onuni 7791 | . . . 4 ⊢ (𝐵 ∈ On → ∪ 𝐵 ∈ On) | |
| 4 | 3 | 3ad2ant1 1151 | . . 3 ⊢ ((𝐵 ∈ On ∧ 𝐵 ≠ ∅ ∧ ¬ Lim 𝐵) → ∪ 𝐵 ∈ On) |
| 5 | rdgsuc 8417 | . . 3 ⊢ (∪ 𝐵 ∈ On → (rec(𝐹, 𝐼)‘suc ∪ 𝐵) = (𝐹‘(rec(𝐹, 𝐼)‘∪ 𝐵))) | |
| 6 | 4, 5 | syl 18 | . 2 ⊢ ((𝐵 ∈ On ∧ 𝐵 ≠ ∅ ∧ ¬ Lim 𝐵) → (rec(𝐹, 𝐼)‘suc ∪ 𝐵) = (𝐹‘(rec(𝐹, 𝐼)‘∪ 𝐵))) |
| 7 | 2, 6 | eqtrd 2797 | 1 ⊢ ((𝐵 ∈ On ∧ 𝐵 ≠ ∅ ∧ ¬ Lim 𝐵) → (rec(𝐹, 𝐼)‘𝐵) = (𝐹‘(rec(𝐹, 𝐼)‘∪ 𝐵))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 ≠ wne 2957 ∅c0 4282 ∪ cuni 4870 Oncon0 6361 Lim wlim 6362 suc csuc 6363 ‘cfv 6537 reccrdg 8402 |
| 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 2215 ax-ext 2734 ax-rep 5236 ax-sep 5255 ax-nul 5267 ax-pr 5402 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 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3079 df-rex 3089 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-iun 4956 df-br 5108 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5554 df-eprel 5559 df-po 5567 df-so 5568 df-fr 5612 df-we 5614 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-ov 7420 df-2nd 7991 df-frecs 8284 df-wrecs 8315 df-recs 8364 df-rdg 8403 |
| This theorem is used by: finxp1o 38154 finxpreclem4 38156 |
| Copyright terms: Public domain | W3C validator |