![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > wfrresex | Structured version Visualization version GIF version |
Description: Show without using the axiom of replacement that the restriction of the well-ordered recursion generator to a predecessor class is a set. (Contributed by Scott Fenton, 18-Nov-2024.) |
Ref | Expression |
---|---|
wfrfun.1 | ⊢ 𝐹 = wrecs(𝑅, 𝐴, 𝐺) |
Ref | Expression |
---|---|
wfrresex | ⊢ (((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) ∧ 𝑋 ∈ dom 𝐹) → (𝐹 ↾ Pred(𝑅, 𝐴, 𝑋)) ∈ V) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | wefr 5659 | . . . 4 ⊢ (𝑅 We 𝐴 → 𝑅 Fr 𝐴) | |
2 | 1 | adantr 480 | . . 3 ⊢ ((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) → 𝑅 Fr 𝐴) |
3 | weso 5660 | . . . . 5 ⊢ (𝑅 We 𝐴 → 𝑅 Or 𝐴) | |
4 | sopo 5600 | . . . . 5 ⊢ (𝑅 Or 𝐴 → 𝑅 Po 𝐴) | |
5 | 3, 4 | syl 17 | . . . 4 ⊢ (𝑅 We 𝐴 → 𝑅 Po 𝐴) |
6 | 5 | adantr 480 | . . 3 ⊢ ((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) → 𝑅 Po 𝐴) |
7 | simpr 484 | . . 3 ⊢ ((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) → 𝑅 Se 𝐴) | |
8 | 2, 6, 7 | 3jca 1125 | . 2 ⊢ ((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) → (𝑅 Fr 𝐴 ∧ 𝑅 Po 𝐴 ∧ 𝑅 Se 𝐴)) |
9 | wfrfun.1 | . . . 4 ⊢ 𝐹 = wrecs(𝑅, 𝐴, 𝐺) | |
10 | df-wrecs 8298 | . . . 4 ⊢ wrecs(𝑅, 𝐴, 𝐺) = frecs(𝑅, 𝐴, (𝐺 ∘ 2nd )) | |
11 | 9, 10 | eqtri 2754 | . . 3 ⊢ 𝐹 = frecs(𝑅, 𝐴, (𝐺 ∘ 2nd )) |
12 | 11 | fprresex 8296 | . 2 ⊢ (((𝑅 Fr 𝐴 ∧ 𝑅 Po 𝐴 ∧ 𝑅 Se 𝐴) ∧ 𝑋 ∈ dom 𝐹) → (𝐹 ↾ Pred(𝑅, 𝐴, 𝑋)) ∈ V) |
13 | 8, 12 | sylan 579 | 1 ⊢ (((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) ∧ 𝑋 ∈ dom 𝐹) → (𝐹 ↾ Pred(𝑅, 𝐴, 𝑋)) ∈ V) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1084 = wceq 1533 ∈ wcel 2098 Vcvv 3468 Po wpo 5579 Or wor 5580 Fr wfr 5621 Se wse 5622 We wwe 5623 dom cdm 5669 ↾ cres 5671 ∘ ccom 5673 Predcpred 6293 2nd c2nd 7973 frecscfrecs 8266 wrecscwrecs 8297 |
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 2163 ax-ext 2697 ax-sep 5292 ax-nul 5299 ax-pr 5420 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 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 2704 df-cleq 2718 df-clel 2804 df-nfc 2879 df-ne 2935 df-ral 3056 df-rex 3065 df-rab 3427 df-v 3470 df-sbc 3773 df-csb 3889 df-dif 3946 df-un 3948 df-in 3950 df-ss 3960 df-nul 4318 df-if 4524 df-pw 4599 df-sn 4624 df-pr 4626 df-op 4630 df-uni 4903 df-iun 4992 df-br 5142 df-opab 5204 df-mpt 5225 df-id 5567 df-po 5581 df-so 5582 df-fr 5624 df-se 5625 df-we 5626 df-xp 5675 df-rel 5676 df-cnv 5677 df-co 5678 df-dm 5679 df-rn 5680 df-res 5681 df-ima 5682 df-pred 6294 df-iota 6489 df-fun 6539 df-fn 6540 df-fv 6545 df-ov 7408 df-frecs 8267 df-wrecs 8298 |
This theorem is referenced by: wfr2a 8335 |
Copyright terms: Public domain | W3C validator |