| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > rdgival | GIF version | ||
| Description: Value of the recursive definition generator. (Contributed by Jim Kingdon, 26-Jul-2019.) |
| Ref | Expression |
|---|---|
| rdgival | ⊢ ((𝐹 Fn V ∧ 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ On) → (rec(𝐹, 𝐴)‘𝐵) = (𝐴 ∪ ∪ 𝑥 ∈ 𝐵 (𝐹‘(rec(𝐹, 𝐴)‘𝑥)))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | rdgivallem 6642 | . 2 ⊢ ((𝐹 Fn V ∧ 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ On) → (rec(𝐹, 𝐴)‘𝐵) = (𝐴 ∪ ∪ 𝑥 ∈ 𝐵 (𝐹‘((rec(𝐹, 𝐴) ↾ 𝐵)‘𝑥)))) | |
| 2 | fvres 5714 | . . . . 5 ⊢ (𝑥 ∈ 𝐵 → ((rec(𝐹, 𝐴) ↾ 𝐵)‘𝑥) = (rec(𝐹, 𝐴)‘𝑥)) | |
| 3 | 2 | fveq2d 5694 | . . . 4 ⊢ (𝑥 ∈ 𝐵 → (𝐹‘((rec(𝐹, 𝐴) ↾ 𝐵)‘𝑥)) = (𝐹‘(rec(𝐹, 𝐴)‘𝑥))) |
| 4 | 3 | iuneq2i 4025 | . . 3 ⊢ ∪ 𝑥 ∈ 𝐵 (𝐹‘((rec(𝐹, 𝐴) ↾ 𝐵)‘𝑥)) = ∪ 𝑥 ∈ 𝐵 (𝐹‘(rec(𝐹, 𝐴)‘𝑥)) |
| 5 | 4 | uneq2i 3380 | . 2 ⊢ (𝐴 ∪ ∪ 𝑥 ∈ 𝐵 (𝐹‘((rec(𝐹, 𝐴) ↾ 𝐵)‘𝑥))) = (𝐴 ∪ ∪ 𝑥 ∈ 𝐵 (𝐹‘(rec(𝐹, 𝐴)‘𝑥))) |
| 6 | 1, 5 | eqtrdi 2287 | 1 ⊢ ((𝐹 Fn V ∧ 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ On) → (rec(𝐹, 𝐴)‘𝐵) = (𝐴 ∪ ∪ 𝑥 ∈ 𝐵 (𝐹‘(rec(𝐹, 𝐴)‘𝑥)))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ w3a 1009 = wceq 1402 ∈ wcel 2209 Vcvv 2821 ∪ cun 3218 ∪ ciun 4007 Oncon0 4503 ↾ cres 4771 Fn wfn 5367 ‘cfv 5372 reccrdg 6630 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-coll 4241 ax-sep 4244 ax-pow 4306 ax-pr 4341 ax-un 4573 ax-setind 4679 |
| This theorem depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-ral 2533 df-rex 2534 df-reu 2535 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-nul 3521 df-pw 3687 df-sn 3711 df-pr 3712 df-op 3714 df-uni 3931 df-iun 4009 df-br 4126 df-opab 4188 df-mpt 4189 df-tr 4225 df-id 4433 df-iord 4506 df-on 4508 df-suc 4511 df-xp 4775 df-rel 4776 df-cnv 4777 df-co 4778 df-dm 4779 df-rn 4780 df-res 4781 df-ima 4782 df-iota 5332 df-fun 5374 df-fn 5375 df-f 5376 df-f1 5377 df-fo 5378 df-f1o 5379 df-fv 5380 df-recs 6566 df-irdg 6631 |
| This theorem is referenced by: rdgss 6644 rdgisuc1 6645 rdgisucinc 6646 oav2 6726 omv2 6728 |
| Copyright terms: Public domain | W3C validator |