![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > rdg0n | Structured version Visualization version GIF version |
Description: If 𝐴 is a proper class, then the recursive function generator at ∅ is the empty set. (Contributed by Scott Fenton, 31-Oct-2024.) |
Ref | Expression |
---|---|
rdg0n | ⊢ (¬ 𝐴 ∈ V → (rec(𝐹, 𝐴)‘∅) = ∅) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 0elon 6421 | . . . 4 ⊢ ∅ ∈ On | |
2 | df-rdg 8431 | . . . . 5 ⊢ rec(𝐹, 𝐴) = recs((𝑔 ∈ V ↦ if(𝑔 = ∅, 𝐴, if(Lim dom 𝑔, ∪ ran 𝑔, (𝐹‘(𝑔‘∪ dom 𝑔)))))) | |
3 | 2 | tfr2 8419 | . . . 4 ⊢ (∅ ∈ On → (rec(𝐹, 𝐴)‘∅) = ((𝑔 ∈ V ↦ if(𝑔 = ∅, 𝐴, if(Lim dom 𝑔, ∪ ran 𝑔, (𝐹‘(𝑔‘∪ dom 𝑔)))))‘(rec(𝐹, 𝐴) ↾ ∅))) |
4 | 1, 3 | ax-mp 5 | . . 3 ⊢ (rec(𝐹, 𝐴)‘∅) = ((𝑔 ∈ V ↦ if(𝑔 = ∅, 𝐴, if(Lim dom 𝑔, ∪ ran 𝑔, (𝐹‘(𝑔‘∪ dom 𝑔)))))‘(rec(𝐹, 𝐴) ↾ ∅)) |
5 | res0 5985 | . . . 4 ⊢ (rec(𝐹, 𝐴) ↾ ∅) = ∅ | |
6 | 5 | fveq2i 6895 | . . 3 ⊢ ((𝑔 ∈ V ↦ if(𝑔 = ∅, 𝐴, if(Lim dom 𝑔, ∪ ran 𝑔, (𝐹‘(𝑔‘∪ dom 𝑔)))))‘(rec(𝐹, 𝐴) ↾ ∅)) = ((𝑔 ∈ V ↦ if(𝑔 = ∅, 𝐴, if(Lim dom 𝑔, ∪ ran 𝑔, (𝐹‘(𝑔‘∪ dom 𝑔)))))‘∅) |
7 | 4, 6 | eqtri 2754 | . 2 ⊢ (rec(𝐹, 𝐴)‘∅) = ((𝑔 ∈ V ↦ if(𝑔 = ∅, 𝐴, if(Lim dom 𝑔, ∪ ran 𝑔, (𝐹‘(𝑔‘∪ dom 𝑔)))))‘∅) |
8 | iftrue 4531 | . . 3 ⊢ (𝑔 = ∅ → if(𝑔 = ∅, 𝐴, if(Lim dom 𝑔, ∪ ran 𝑔, (𝐹‘(𝑔‘∪ dom 𝑔)))) = 𝐴) | |
9 | eqid 2726 | . . 3 ⊢ (𝑔 ∈ V ↦ if(𝑔 = ∅, 𝐴, if(Lim dom 𝑔, ∪ ran 𝑔, (𝐹‘(𝑔‘∪ dom 𝑔))))) = (𝑔 ∈ V ↦ if(𝑔 = ∅, 𝐴, if(Lim dom 𝑔, ∪ ran 𝑔, (𝐹‘(𝑔‘∪ dom 𝑔))))) | |
10 | 8, 9 | fvmptn 7025 | . 2 ⊢ (¬ 𝐴 ∈ V → ((𝑔 ∈ V ↦ if(𝑔 = ∅, 𝐴, if(Lim dom 𝑔, ∪ ran 𝑔, (𝐹‘(𝑔‘∪ dom 𝑔)))))‘∅) = ∅) |
11 | 7, 10 | eqtrid 2778 | 1 ⊢ (¬ 𝐴 ∈ V → (rec(𝐹, 𝐴)‘∅) = ∅) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 = wceq 1534 ∈ wcel 2099 Vcvv 3464 ∅c0 4324 ifcif 4525 ∪ cuni 4907 ↦ cmpt 5228 dom cdm 5674 ran crn 5675 ↾ cres 5676 Oncon0 6367 Lim wlim 6368 ‘cfv 6545 reccrdg 8430 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1906 ax-6 1964 ax-7 2004 ax-8 2101 ax-9 2109 ax-10 2130 ax-11 2147 ax-12 2167 ax-ext 2697 ax-rep 5282 ax-sep 5296 ax-nul 5303 ax-pr 5425 ax-un 7737 |
This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3or 1085 df-3an 1086 df-tru 1537 df-fal 1547 df-ex 1775 df-nf 1779 df-sb 2061 df-mo 2529 df-eu 2558 df-clab 2704 df-cleq 2718 df-clel 2803 df-nfc 2878 df-ne 2931 df-ral 3052 df-rex 3061 df-reu 3366 df-rab 3421 df-v 3466 df-sbc 3778 df-csb 3894 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-pss 3968 df-nul 4325 df-if 4526 df-pw 4601 df-sn 4626 df-pr 4628 df-op 4632 df-uni 4908 df-iun 4997 df-br 5146 df-opab 5208 df-mpt 5229 df-tr 5263 df-id 5572 df-eprel 5578 df-po 5586 df-so 5587 df-fr 5629 df-we 5631 df-xp 5680 df-rel 5681 df-cnv 5682 df-co 5683 df-dm 5684 df-rn 5685 df-res 5686 df-ima 5687 df-pred 6304 df-ord 6370 df-on 6371 df-suc 6373 df-iota 6497 df-fun 6547 df-fn 6548 df-f 6549 df-f1 6550 df-fo 6551 df-f1o 6552 df-fv 6553 df-ov 7418 df-2nd 7995 df-frecs 8287 df-wrecs 8318 df-recs 8392 df-rdg 8431 |
This theorem is referenced by: ttrclselem1 9760 |
Copyright terms: Public domain | W3C validator |