| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > rdgeq2 | Structured version Visualization version GIF version | ||
| Description: Equality theorem for the recursive definition generator. (Contributed by NM, 9-Apr-1995.) (Revised by Mario Carneiro, 9-May-2015.) |
| Ref | Expression |
|---|---|
| rdgeq2 | ⊢ (𝐴 = 𝐵 → rec(𝐹, 𝐴) = rec(𝐹, 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ifeq1 4471 | . . . 4 ⊢ (𝐴 = 𝐵 → if(𝑔 = ∅, 𝐴, if(Lim dom 𝑔, ∪ ran 𝑔, (𝐹‘(𝑔‘∪ dom 𝑔)))) = if(𝑔 = ∅, 𝐵, if(Lim dom 𝑔, ∪ ran 𝑔, (𝐹‘(𝑔‘∪ dom 𝑔))))) | |
| 2 | 1 | mpteq2dv 5180 | . . 3 ⊢ (𝐴 = 𝐵 → (𝑔 ∈ V ↦ if(𝑔 = ∅, 𝐴, if(Lim dom 𝑔, ∪ ran 𝑔, (𝐹‘(𝑔‘∪ dom 𝑔))))) = (𝑔 ∈ V ↦ if(𝑔 = ∅, 𝐵, if(Lim dom 𝑔, ∪ ran 𝑔, (𝐹‘(𝑔‘∪ dom 𝑔)))))) |
| 3 | recseq 8306 | . . 3 ⊢ ((𝑔 ∈ V ↦ if(𝑔 = ∅, 𝐴, if(Lim dom 𝑔, ∪ ran 𝑔, (𝐹‘(𝑔‘∪ dom 𝑔))))) = (𝑔 ∈ V ↦ if(𝑔 = ∅, 𝐵, if(Lim dom 𝑔, ∪ ran 𝑔, (𝐹‘(𝑔‘∪ dom 𝑔))))) → recs((𝑔 ∈ V ↦ if(𝑔 = ∅, 𝐴, if(Lim dom 𝑔, ∪ ran 𝑔, (𝐹‘(𝑔‘∪ dom 𝑔)))))) = recs((𝑔 ∈ V ↦ if(𝑔 = ∅, 𝐵, if(Lim dom 𝑔, ∪ ran 𝑔, (𝐹‘(𝑔‘∪ dom 𝑔))))))) | |
| 4 | 2, 3 | syl 17 | . 2 ⊢ (𝐴 = 𝐵 → recs((𝑔 ∈ V ↦ if(𝑔 = ∅, 𝐴, if(Lim dom 𝑔, ∪ ran 𝑔, (𝐹‘(𝑔‘∪ dom 𝑔)))))) = recs((𝑔 ∈ V ↦ if(𝑔 = ∅, 𝐵, if(Lim dom 𝑔, ∪ ran 𝑔, (𝐹‘(𝑔‘∪ dom 𝑔))))))) |
| 5 | df-rdg 8342 | . 2 ⊢ rec(𝐹, 𝐴) = recs((𝑔 ∈ V ↦ if(𝑔 = ∅, 𝐴, if(Lim dom 𝑔, ∪ ran 𝑔, (𝐹‘(𝑔‘∪ dom 𝑔)))))) | |
| 6 | df-rdg 8342 | . 2 ⊢ rec(𝐹, 𝐵) = recs((𝑔 ∈ V ↦ if(𝑔 = ∅, 𝐵, if(Lim dom 𝑔, ∪ ran 𝑔, (𝐹‘(𝑔‘∪ dom 𝑔)))))) | |
| 7 | 4, 5, 6 | 3eqtr4g 2797 | 1 ⊢ (𝐴 = 𝐵 → rec(𝐹, 𝐴) = rec(𝐹, 𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1542 Vcvv 3430 ∅c0 4274 ifcif 4467 ∪ cuni 4851 ↦ cmpt 5167 dom cdm 5624 ran crn 5625 Lim wlim 6318 ‘cfv 6492 recscrecs 8303 reccrdg 8341 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-ext 2709 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-sb 2069 df-clab 2716 df-cleq 2729 df-clel 2812 df-ral 3053 df-rab 3391 df-v 3432 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4275 df-if 4468 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-br 5087 df-opab 5149 df-mpt 5168 df-xp 5630 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-iota 6448 df-fv 6500 df-ov 7363 df-frecs 8224 df-wrecs 8255 df-recs 8304 df-rdg 8342 |
| This theorem is referenced by: rdgeq12 8345 rdg0g 8359 oav 8439 itunifval 10329 hsmex 10345 ltweuz 13914 seqeq1 13957 dfrdg2 35991 ttcid 36690 finxpeq2 37717 finxpreclem6 37726 finxpsuclem 37727 |
| Copyright terms: Public domain | W3C validator |