![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > hsmexlem6 | Structured version Visualization version GIF version |
Description: Lemma for hsmex 10469. (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 6919 | . 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 10467 | . . . 4 ⊢ (𝑑 ∈ 𝑆 → (rank‘𝑑) ∈ (har‘𝒫 (ω × ∪ ran 𝐻))) |
8 | 5 | ssrab3 4091 | . . . . . 6 ⊢ 𝑆 ⊆ ∪ (𝑅1 “ On) |
9 | 8 | sseli 3990 | . . . . 5 ⊢ (𝑑 ∈ 𝑆 → 𝑑 ∈ ∪ (𝑅1 “ On)) |
10 | harcl 9596 | . . . . . 6 ⊢ (har‘𝒫 (ω × ∪ ran 𝐻)) ∈ On | |
11 | r1fnon 9804 | . . . . . . 7 ⊢ 𝑅1 Fn On | |
12 | 11 | fndmi 6672 | . . . . . 6 ⊢ dom 𝑅1 = On |
13 | 10, 12 | eleqtrri 2837 | . . . . 5 ⊢ (har‘𝒫 (ω × ∪ ran 𝐻)) ∈ dom 𝑅1 |
14 | rankr1ag 9839 | . . . . 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 3998 | . 2 ⊢ 𝑆 ⊆ (𝑅1‘(har‘𝒫 (ω × ∪ ran 𝐻))) |
18 | 1, 17 | ssexi 5327 | 1 ⊢ 𝑆 ∈ V |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 206 = wceq 1536 ∈ wcel 2105 ∀wral 3058 {crab 3432 Vcvv 3477 𝒫 cpw 4604 {csn 4630 ∪ cuni 4911 class class class wbr 5147 ↦ cmpt 5230 E cep 5587 × cxp 5686 dom cdm 5688 ran crn 5689 ↾ cres 5690 “ cima 5691 Oncon0 6385 ‘cfv 6562 ωcom 7886 reccrdg 8447 ≼ cdom 8981 OrdIsocoi 9546 harchar 9593 TCctc 9773 𝑅1cr1 9799 rankcrnk 9800 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1791 ax-4 1805 ax-5 1907 ax-6 1964 ax-7 2004 ax-8 2107 ax-9 2115 ax-10 2138 ax-11 2154 ax-12 2174 ax-ext 2705 ax-rep 5284 ax-sep 5301 ax-nul 5311 ax-pow 5370 ax-pr 5437 ax-un 7753 ax-inf2 9678 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1539 df-fal 1549 df-ex 1776 df-nf 1780 df-sb 2062 df-mo 2537 df-eu 2566 df-clab 2712 df-cleq 2726 df-clel 2813 df-nfc 2889 df-ne 2938 df-ral 3059 df-rex 3068 df-rmo 3377 df-reu 3378 df-rab 3433 df-v 3479 df-sbc 3791 df-csb 3908 df-dif 3965 df-un 3967 df-in 3969 df-ss 3979 df-pss 3982 df-nul 4339 df-if 4531 df-pw 4606 df-sn 4631 df-pr 4633 df-op 4637 df-uni 4912 df-int 4951 df-iun 4997 df-iin 4998 df-br 5148 df-opab 5210 df-mpt 5231 df-tr 5265 df-id 5582 df-eprel 5588 df-po 5596 df-so 5597 df-fr 5640 df-se 5641 df-we 5642 df-xp 5694 df-rel 5695 df-cnv 5696 df-co 5697 df-dm 5698 df-rn 5699 df-res 5700 df-ima 5701 df-pred 6322 df-ord 6388 df-on 6389 df-lim 6390 df-suc 6391 df-iota 6515 df-fun 6564 df-fn 6565 df-f 6566 df-f1 6567 df-fo 6568 df-f1o 6569 df-fv 6570 df-isom 6571 df-riota 7387 df-ov 7433 df-om 7887 df-1st 8012 df-2nd 8013 df-frecs 8304 df-wrecs 8335 df-smo 8384 df-recs 8409 df-rdg 8448 df-en 8984 df-dom 8985 df-sdom 8986 df-oi 9547 df-har 9594 df-wdom 9602 df-tc 9774 df-r1 9801 df-rank 9802 |
This theorem is referenced by: hsmex 10469 |
Copyright terms: Public domain | W3C validator |