| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > hsmexlem6 | Structured version Visualization version GIF version | ||
| Description: Lemma for hsmex 10446. (Contributed by Stefan O'Rear, 14-Feb-2015.) |
| Ref | Expression |
|---|---|
| hsmexlem4.x | ⊢ 𝑋 ∈ V |
| hsmexlem4.h | ⊢ 𝐻 = (rec((𝑧 ∈ V ↦ (har‘𝒫 (𝑋 × 𝑧))), (har‘𝒫 𝑋)) ↾ ω) |
| hsmexlem4.u | ⊢ 𝑈 = (𝑥 ∈ V ↦ (rec((𝑦 ∈ V ↦ ∪ 𝑦), 𝑥) ↾ ω)) |
| hsmexlem4.s | ⊢ 𝑆 = {𝑎 ∈ ∪ (𝑅1 “ On) ∣ ∀𝑏 ∈ (TC‘{𝑎})𝑏 ≼ 𝑋} |
| hsmexlem4.o | ⊢ 𝑂 = OrdIso( E , (rank “ ((𝑈‘𝑑)‘𝑐))) |
| Ref | Expression |
|---|---|
| hsmexlem6 | ⊢ 𝑆 ∈ V |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fvex 6889 | . 2 ⊢ (𝑅1‘(har‘𝒫 (ω × ∪ ran 𝐻))) ∈ V | |
| 2 | hsmexlem4.x | . . . . 5 ⊢ 𝑋 ∈ V | |
| 3 | hsmexlem4.h | . . . . 5 ⊢ 𝐻 = (rec((𝑧 ∈ V ↦ (har‘𝒫 (𝑋 × 𝑧))), (har‘𝒫 𝑋)) ↾ ω) | |
| 4 | hsmexlem4.u | . . . . 5 ⊢ 𝑈 = (𝑥 ∈ V ↦ (rec((𝑦 ∈ V ↦ ∪ 𝑦), 𝑥) ↾ ω)) | |
| 5 | hsmexlem4.s | . . . . 5 ⊢ 𝑆 = {𝑎 ∈ ∪ (𝑅1 “ On) ∣ ∀𝑏 ∈ (TC‘{𝑎})𝑏 ≼ 𝑋} | |
| 6 | hsmexlem4.o | . . . . 5 ⊢ 𝑂 = OrdIso( E , (rank “ ((𝑈‘𝑑)‘𝑐))) | |
| 7 | 2, 3, 4, 5, 6 | hsmexlem5 10444 | . . . 4 ⊢ (𝑑 ∈ 𝑆 → (rank‘𝑑) ∈ (har‘𝒫 (ω × ∪ ran 𝐻))) |
| 8 | 5 | ssrab3 4057 | . . . . . 6 ⊢ 𝑆 ⊆ ∪ (𝑅1 “ On) |
| 9 | 8 | sseli 3954 | . . . . 5 ⊢ (𝑑 ∈ 𝑆 → 𝑑 ∈ ∪ (𝑅1 “ On)) |
| 10 | harcl 9573 | . . . . . 6 ⊢ (har‘𝒫 (ω × ∪ ran 𝐻)) ∈ On | |
| 11 | r1fnon 9781 | . . . . . . 7 ⊢ 𝑅1 Fn On | |
| 12 | 11 | fndmi 6642 | . . . . . 6 ⊢ dom 𝑅1 = On |
| 13 | 10, 12 | eleqtrri 2833 | . . . . 5 ⊢ (har‘𝒫 (ω × ∪ ran 𝐻)) ∈ dom 𝑅1 |
| 14 | rankr1ag 9816 | . . . . 5 ⊢ ((𝑑 ∈ ∪ (𝑅1 “ On) ∧ (har‘𝒫 (ω × ∪ ran 𝐻)) ∈ dom 𝑅1) → (𝑑 ∈ (𝑅1‘(har‘𝒫 (ω × ∪ ran 𝐻))) ↔ (rank‘𝑑) ∈ (har‘𝒫 (ω × ∪ ran 𝐻)))) | |
| 15 | 9, 13, 14 | sylancl 586 | . . . 4 ⊢ (𝑑 ∈ 𝑆 → (𝑑 ∈ (𝑅1‘(har‘𝒫 (ω × ∪ ran 𝐻))) ↔ (rank‘𝑑) ∈ (har‘𝒫 (ω × ∪ ran 𝐻)))) |
| 16 | 7, 15 | mpbird 257 | . . 3 ⊢ (𝑑 ∈ 𝑆 → 𝑑 ∈ (𝑅1‘(har‘𝒫 (ω × ∪ ran 𝐻)))) |
| 17 | 16 | ssriv 3962 | . 2 ⊢ 𝑆 ⊆ (𝑅1‘(har‘𝒫 (ω × ∪ ran 𝐻))) |
| 18 | 1, 17 | ssexi 5292 | 1 ⊢ 𝑆 ∈ V |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 206 = wceq 1540 ∈ wcel 2108 ∀wral 3051 {crab 3415 Vcvv 3459 𝒫 cpw 4575 {csn 4601 ∪ cuni 4883 class class class wbr 5119 ↦ cmpt 5201 E cep 5552 × cxp 5652 dom cdm 5654 ran crn 5655 ↾ cres 5656 “ cima 5657 Oncon0 6352 ‘cfv 6531 ωcom 7861 reccrdg 8423 ≼ cdom 8957 OrdIsocoi 9523 harchar 9570 TCctc 9750 𝑅1cr1 9776 rankcrnk 9777 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2157 ax-12 2177 ax-ext 2707 ax-rep 5249 ax-sep 5266 ax-nul 5276 ax-pow 5335 ax-pr 5402 ax-un 7729 ax-inf2 9655 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2065 df-mo 2539 df-eu 2568 df-clab 2714 df-cleq 2727 df-clel 2809 df-nfc 2885 df-ne 2933 df-ral 3052 df-rex 3061 df-rmo 3359 df-reu 3360 df-rab 3416 df-v 3461 df-sbc 3766 df-csb 3875 df-dif 3929 df-un 3931 df-in 3933 df-ss 3943 df-pss 3946 df-nul 4309 df-if 4501 df-pw 4577 df-sn 4602 df-pr 4604 df-op 4608 df-uni 4884 df-int 4923 df-iun 4969 df-iin 4970 df-br 5120 df-opab 5182 df-mpt 5202 df-tr 5230 df-id 5548 df-eprel 5553 df-po 5561 df-so 5562 df-fr 5606 df-se 5607 df-we 5608 df-xp 5660 df-rel 5661 df-cnv 5662 df-co 5663 df-dm 5664 df-rn 5665 df-res 5666 df-ima 5667 df-pred 6290 df-ord 6355 df-on 6356 df-lim 6357 df-suc 6358 df-iota 6484 df-fun 6533 df-fn 6534 df-f 6535 df-f1 6536 df-fo 6537 df-f1o 6538 df-fv 6539 df-isom 6540 df-riota 7362 df-ov 7408 df-om 7862 df-1st 7988 df-2nd 7989 df-frecs 8280 df-wrecs 8311 df-smo 8360 df-recs 8385 df-rdg 8424 df-en 8960 df-dom 8961 df-sdom 8962 df-oi 9524 df-har 9571 df-wdom 9579 df-tc 9751 df-r1 9778 df-rank 9779 |
| This theorem is referenced by: hsmex 10446 |
| Copyright terms: Public domain | W3C validator |