![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > wfrfun | Structured version Visualization version GIF version |
Description: The "function" generated by the well-ordered recursion generator is indeed a function. Avoids the axiom of replacement. (Contributed by Scott Fenton, 21-Apr-2011.) (Revised by Mario Carneiro, 26-Jun-2015.) (Revised by Scott Fenton, 17-Nov-2024.) |
Ref | Expression |
---|---|
wfrfun.1 | ⊢ 𝐹 = wrecs(𝑅, 𝐴, 𝐺) |
Ref | Expression |
---|---|
wfrfun | ⊢ ((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) → Fun 𝐹) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | wefr 5668 | . . 3 ⊢ (𝑅 We 𝐴 → 𝑅 Fr 𝐴) | |
2 | 1 | adantr 479 | . 2 ⊢ ((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) → 𝑅 Fr 𝐴) |
3 | weso 5669 | . . . 4 ⊢ (𝑅 We 𝐴 → 𝑅 Or 𝐴) | |
4 | sopo 5609 | . . . 4 ⊢ (𝑅 Or 𝐴 → 𝑅 Po 𝐴) | |
5 | 3, 4 | syl 17 | . . 3 ⊢ (𝑅 We 𝐴 → 𝑅 Po 𝐴) |
6 | 5 | adantr 479 | . 2 ⊢ ((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) → 𝑅 Po 𝐴) |
7 | simpr 483 | . 2 ⊢ ((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) → 𝑅 Se 𝐴) | |
8 | wfrfun.1 | . . . 4 ⊢ 𝐹 = wrecs(𝑅, 𝐴, 𝐺) | |
9 | df-wrecs 8318 | . . . 4 ⊢ wrecs(𝑅, 𝐴, 𝐺) = frecs(𝑅, 𝐴, (𝐺 ∘ 2nd )) | |
10 | 8, 9 | eqtri 2753 | . . 3 ⊢ 𝐹 = frecs(𝑅, 𝐴, (𝐺 ∘ 2nd )) |
11 | 10 | fprfung 8315 | . 2 ⊢ ((𝑅 Fr 𝐴 ∧ 𝑅 Po 𝐴 ∧ 𝑅 Se 𝐴) → Fun 𝐹) |
12 | 2, 6, 7, 11 | syl3anc 1368 | 1 ⊢ ((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) → Fun 𝐹) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 394 = wceq 1533 Po wpo 5588 Or wor 5589 Fr wfr 5630 Se wse 5631 We wwe 5632 ∘ ccom 5682 Fun wfun 6543 2nd c2nd 7993 frecscfrecs 8286 wrecscwrecs 8317 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2166 ax-ext 2696 ax-sep 5300 ax-nul 5307 ax-pr 5429 |
This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2528 df-eu 2557 df-clab 2703 df-cleq 2717 df-clel 2802 df-nfc 2877 df-ne 2930 df-ral 3051 df-rex 3060 df-rab 3419 df-v 3463 df-sbc 3774 df-csb 3890 df-dif 3947 df-un 3949 df-in 3951 df-ss 3961 df-nul 4323 df-if 4531 df-pw 4606 df-sn 4631 df-pr 4633 df-op 4637 df-uni 4910 df-iun 4999 df-br 5150 df-opab 5212 df-mpt 5233 df-id 5576 df-po 5590 df-so 5591 df-fr 5633 df-se 5634 df-we 5635 df-xp 5684 df-rel 5685 df-cnv 5686 df-co 5687 df-dm 5688 df-rn 5689 df-res 5690 df-ima 5691 df-pred 6307 df-iota 6501 df-fun 6551 df-fn 6552 df-fv 6557 df-ov 7422 df-frecs 8287 df-wrecs 8318 |
This theorem is referenced by: bpolylem 16028 |
Copyright terms: Public domain | W3C validator |