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 34642 | . . 3 ⊢ ((𝐵 ∈ On ∧ 𝐵 ≠ ∅ ∧ ¬ Lim 𝐵) → 𝐵 = suc ∪ 𝐵) | |
2 | 1 | fveq2d 6668 | . 2 ⊢ ((𝐵 ∈ On ∧ 𝐵 ≠ ∅ ∧ ¬ Lim 𝐵) → (rec(𝐹, 𝐼)‘𝐵) = (rec(𝐹, 𝐼)‘suc ∪ 𝐵)) |
3 | onuni 7502 | . . . 4 ⊢ (𝐵 ∈ On → ∪ 𝐵 ∈ On) | |
4 | 3 | 3ad2ant1 1129 | . . 3 ⊢ ((𝐵 ∈ On ∧ 𝐵 ≠ ∅ ∧ ¬ Lim 𝐵) → ∪ 𝐵 ∈ On) |
5 | rdgsuc 8054 | . . 3 ⊢ (∪ 𝐵 ∈ On → (rec(𝐹, 𝐼)‘suc ∪ 𝐵) = (𝐹‘(rec(𝐹, 𝐼)‘∪ 𝐵))) | |
6 | 4, 5 | syl 17 | . 2 ⊢ ((𝐵 ∈ On ∧ 𝐵 ≠ ∅ ∧ ¬ Lim 𝐵) → (rec(𝐹, 𝐼)‘suc ∪ 𝐵) = (𝐹‘(rec(𝐹, 𝐼)‘∪ 𝐵))) |
7 | 2, 6 | eqtrd 2856 | 1 ⊢ ((𝐵 ∈ On ∧ 𝐵 ≠ ∅ ∧ ¬ Lim 𝐵) → (rec(𝐹, 𝐼)‘𝐵) = (𝐹‘(rec(𝐹, 𝐼)‘∪ 𝐵))) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ w3a 1083 = wceq 1533 ∈ wcel 2110 ≠ wne 3016 ∅c0 4290 ∪ cuni 4831 Oncon0 6185 Lim wlim 6186 suc csuc 6187 ‘cfv 6349 reccrdg 8039 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-rep 5182 ax-sep 5195 ax-nul 5202 ax-pow 5258 ax-pr 5321 ax-un 7455 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-ral 3143 df-rex 3144 df-reu 3145 df-rab 3147 df-v 3496 df-sbc 3772 df-csb 3883 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-pss 3953 df-nul 4291 df-if 4467 df-pw 4540 df-sn 4561 df-pr 4563 df-tp 4565 df-op 4567 df-uni 4832 df-iun 4913 df-br 5059 df-opab 5121 df-mpt 5139 df-tr 5165 df-id 5454 df-eprel 5459 df-po 5468 df-so 5469 df-fr 5508 df-we 5510 df-xp 5555 df-rel 5556 df-cnv 5557 df-co 5558 df-dm 5559 df-rn 5560 df-res 5561 df-ima 5562 df-pred 6142 df-ord 6188 df-on 6189 df-lim 6190 df-suc 6191 df-iota 6308 df-fun 6351 df-fn 6352 df-f 6353 df-f1 6354 df-fo 6355 df-f1o 6356 df-fv 6357 df-wrecs 7941 df-recs 8002 df-rdg 8040 |
This theorem is referenced by: finxp1o 34667 finxpreclem4 34669 |
Copyright terms: Public domain | W3C validator |