Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > hsmex | Structured version Visualization version GIF version |
Description: The collection of hereditarily size-limited well-founded sets comprise a set. The proof is that of Randall Holmes at http://math.boisestate.edu/~holmes/holmes/hereditary.pdf, with modifications to use Hartogs' theorem instead of the weak variant (inconsequentially weakening some intermediate results), and making the well-foundedness condition explicit to avoid a direct dependence on ax-reg 9441. (Contributed by Stefan O'Rear, 14-Feb-2015.) |
Ref | Expression |
---|---|
hsmex | ⊢ (𝑋 ∈ 𝑉 → {𝑠 ∈ ∪ (𝑅1 “ On) ∣ ∀𝑥 ∈ (TC‘{𝑠})𝑥 ≼ 𝑋} ∈ V) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | breq2 5093 | . . . . 5 ⊢ (𝑎 = 𝑋 → (𝑥 ≼ 𝑎 ↔ 𝑥 ≼ 𝑋)) | |
2 | 1 | ralbidv 3170 | . . . 4 ⊢ (𝑎 = 𝑋 → (∀𝑥 ∈ (TC‘{𝑠})𝑥 ≼ 𝑎 ↔ ∀𝑥 ∈ (TC‘{𝑠})𝑥 ≼ 𝑋)) |
3 | 2 | rabbidv 3411 | . . 3 ⊢ (𝑎 = 𝑋 → {𝑠 ∈ ∪ (𝑅1 “ On) ∣ ∀𝑥 ∈ (TC‘{𝑠})𝑥 ≼ 𝑎} = {𝑠 ∈ ∪ (𝑅1 “ On) ∣ ∀𝑥 ∈ (TC‘{𝑠})𝑥 ≼ 𝑋}) |
4 | 3 | eleq1d 2821 | . 2 ⊢ (𝑎 = 𝑋 → ({𝑠 ∈ ∪ (𝑅1 “ On) ∣ ∀𝑥 ∈ (TC‘{𝑠})𝑥 ≼ 𝑎} ∈ V ↔ {𝑠 ∈ ∪ (𝑅1 “ On) ∣ ∀𝑥 ∈ (TC‘{𝑠})𝑥 ≼ 𝑋} ∈ V)) |
5 | vex 3445 | . . 3 ⊢ 𝑎 ∈ V | |
6 | eqid 2736 | . . 3 ⊢ (rec((𝑑 ∈ V ↦ (har‘𝒫 (𝑎 × 𝑑))), (har‘𝒫 𝑎)) ↾ ω) = (rec((𝑑 ∈ V ↦ (har‘𝒫 (𝑎 × 𝑑))), (har‘𝒫 𝑎)) ↾ ω) | |
7 | rdgeq2 8305 | . . . . . 6 ⊢ (𝑒 = 𝑏 → rec((𝑓 ∈ V ↦ ∪ 𝑓), 𝑒) = rec((𝑓 ∈ V ↦ ∪ 𝑓), 𝑏)) | |
8 | unieq 4862 | . . . . . . . 8 ⊢ (𝑓 = 𝑐 → ∪ 𝑓 = ∪ 𝑐) | |
9 | 8 | cbvmptv 5202 | . . . . . . 7 ⊢ (𝑓 ∈ V ↦ ∪ 𝑓) = (𝑐 ∈ V ↦ ∪ 𝑐) |
10 | rdgeq1 8304 | . . . . . . 7 ⊢ ((𝑓 ∈ V ↦ ∪ 𝑓) = (𝑐 ∈ V ↦ ∪ 𝑐) → rec((𝑓 ∈ V ↦ ∪ 𝑓), 𝑏) = rec((𝑐 ∈ V ↦ ∪ 𝑐), 𝑏)) | |
11 | 9, 10 | ax-mp 5 | . . . . . 6 ⊢ rec((𝑓 ∈ V ↦ ∪ 𝑓), 𝑏) = rec((𝑐 ∈ V ↦ ∪ 𝑐), 𝑏) |
12 | 7, 11 | eqtrdi 2792 | . . . . 5 ⊢ (𝑒 = 𝑏 → rec((𝑓 ∈ V ↦ ∪ 𝑓), 𝑒) = rec((𝑐 ∈ V ↦ ∪ 𝑐), 𝑏)) |
13 | 12 | reseq1d 5916 | . . . 4 ⊢ (𝑒 = 𝑏 → (rec((𝑓 ∈ V ↦ ∪ 𝑓), 𝑒) ↾ ω) = (rec((𝑐 ∈ V ↦ ∪ 𝑐), 𝑏) ↾ ω)) |
14 | 13 | cbvmptv 5202 | . . 3 ⊢ (𝑒 ∈ V ↦ (rec((𝑓 ∈ V ↦ ∪ 𝑓), 𝑒) ↾ ω)) = (𝑏 ∈ V ↦ (rec((𝑐 ∈ V ↦ ∪ 𝑐), 𝑏) ↾ ω)) |
15 | eqid 2736 | . . 3 ⊢ {𝑠 ∈ ∪ (𝑅1 “ On) ∣ ∀𝑥 ∈ (TC‘{𝑠})𝑥 ≼ 𝑎} = {𝑠 ∈ ∪ (𝑅1 “ On) ∣ ∀𝑥 ∈ (TC‘{𝑠})𝑥 ≼ 𝑎} | |
16 | eqid 2736 | . . 3 ⊢ OrdIso( E , (rank “ (((𝑒 ∈ V ↦ (rec((𝑓 ∈ V ↦ ∪ 𝑓), 𝑒) ↾ ω))‘𝑧)‘𝑦))) = OrdIso( E , (rank “ (((𝑒 ∈ V ↦ (rec((𝑓 ∈ V ↦ ∪ 𝑓), 𝑒) ↾ ω))‘𝑧)‘𝑦))) | |
17 | 5, 6, 14, 15, 16 | hsmexlem6 10280 | . 2 ⊢ {𝑠 ∈ ∪ (𝑅1 “ On) ∣ ∀𝑥 ∈ (TC‘{𝑠})𝑥 ≼ 𝑎} ∈ V |
18 | 4, 17 | vtoclg 3514 | 1 ⊢ (𝑋 ∈ 𝑉 → {𝑠 ∈ ∪ (𝑅1 “ On) ∣ ∀𝑥 ∈ (TC‘{𝑠})𝑥 ≼ 𝑋} ∈ V) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1540 ∈ wcel 2105 ∀wral 3061 {crab 3403 Vcvv 3441 𝒫 cpw 4546 {csn 4572 ∪ cuni 4851 class class class wbr 5089 ↦ cmpt 5172 E cep 5517 × cxp 5612 ↾ cres 5616 “ cima 5617 Oncon0 6296 ‘cfv 6473 ωcom 7772 reccrdg 8302 ≼ cdom 8794 OrdIsocoi 9358 harchar 9405 TCctc 9585 𝑅1cr1 9611 rankcrnk 9612 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1912 ax-6 1970 ax-7 2010 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2153 ax-12 2170 ax-ext 2707 ax-rep 5226 ax-sep 5240 ax-nul 5247 ax-pow 5305 ax-pr 5369 ax-un 7642 ax-inf2 9490 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1781 df-nf 1785 df-sb 2067 df-mo 2538 df-eu 2567 df-clab 2714 df-cleq 2728 df-clel 2814 df-nfc 2886 df-ne 2941 df-ral 3062 df-rex 3071 df-rmo 3349 df-reu 3350 df-rab 3404 df-v 3443 df-sbc 3727 df-csb 3843 df-dif 3900 df-un 3902 df-in 3904 df-ss 3914 df-pss 3916 df-nul 4269 df-if 4473 df-pw 4548 df-sn 4573 df-pr 4575 df-op 4579 df-uni 4852 df-int 4894 df-iun 4940 df-iin 4941 df-br 5090 df-opab 5152 df-mpt 5173 df-tr 5207 df-id 5512 df-eprel 5518 df-po 5526 df-so 5527 df-fr 5569 df-se 5570 df-we 5571 df-xp 5620 df-rel 5621 df-cnv 5622 df-co 5623 df-dm 5624 df-rn 5625 df-res 5626 df-ima 5627 df-pred 6232 df-ord 6299 df-on 6300 df-lim 6301 df-suc 6302 df-iota 6425 df-fun 6475 df-fn 6476 df-f 6477 df-f1 6478 df-fo 6479 df-f1o 6480 df-fv 6481 df-isom 6482 df-riota 7286 df-ov 7332 df-om 7773 df-1st 7891 df-2nd 7892 df-frecs 8159 df-wrecs 8190 df-smo 8239 df-recs 8264 df-rdg 8303 df-en 8797 df-dom 8798 df-sdom 8799 df-oi 9359 df-har 9406 df-wdom 9414 df-tc 9586 df-r1 9613 df-rank 9614 |
This theorem is referenced by: hsmex2 10282 |
Copyright terms: Public domain | W3C validator |