| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > hsmexlem6 | Structured version Visualization version GIF version | ||
| Description: Lemma for hsmex 10437. (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 6895 | . 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 10435 | . . . 4 ⊢ (𝑑 ∈ 𝑆 → (rank‘𝑑) ∈ (har‘𝒫 (ω × ∪ ran 𝐻))) |
| 8 | 5 | ssrab3 4033 | . . . . . 6 ⊢ 𝑆 ⊆ ∪ (𝑅1 “ On) |
| 9 | 8 | sseli 3930 | . . . . 5 ⊢ (𝑑 ∈ 𝑆 → 𝑑 ∈ ∪ (𝑅1 “ On)) |
| 10 | harcl 9534 | . . . . . 6 ⊢ (har‘𝒫 (ω × ∪ ran 𝐻)) ∈ On | |
| 11 | r1fnon 9752 | . . . . . . 7 ⊢ 𝑅1 Fn On | |
| 12 | 11 | fndmi 6640 | . . . . . 6 ⊢ dom 𝑅1 = On |
| 13 | 10, 12 | eleqtrri 2861 | . . . . 5 ⊢ (har‘𝒫 (ω × ∪ ran 𝐻)) ∈ dom 𝑅1 |
| 14 | rankr1ag 9787 | . . . . 5 ⊢ ((𝑑 ∈ ∪ (𝑅1 “ On) ∧ (har‘𝒫 (ω × ∪ ran 𝐻)) ∈ dom 𝑅1) → (𝑑 ∈ (𝑅1‘(har‘𝒫 (ω × ∪ ran 𝐻))) ↔ (rank‘𝑑) ∈ (har‘𝒫 (ω × ∪ ran 𝐻)))) | |
| 15 | 9, 13, 14 | sylancl 598 | . . . 4 ⊢ (𝑑 ∈ 𝑆 → (𝑑 ∈ (𝑅1‘(har‘𝒫 (ω × ∪ ran 𝐻))) ↔ (rank‘𝑑) ∈ (har‘𝒫 (ω × ∪ ran 𝐻)))) |
| 16 | 7, 15 | mpbird 260 | . . 3 ⊢ (𝑑 ∈ 𝑆 → 𝑑 ∈ (𝑅1‘(har‘𝒫 (ω × ∪ ran 𝐻)))) |
| 17 | 16 | ssriv 3938 | . 2 ⊢ 𝑆 ⊆ (𝑅1‘(har‘𝒫 (ω × ∪ ran 𝐻))) |
| 18 | 1, 17 | ssexi 5291 | 1 ⊢ 𝑆 ∈ V |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 = wceq 1570 ∈ wcel 2145 ∀wral 3078 {crab 3414 Vcvv 3453 𝒫 cpw 4560 {csn 4587 ∪ cuni 4870 class class class wbr 5107 ↦ cmpt 5190 E cep 5558 × cxp 5657 dom cdm 5659 ran crn 5660 ↾ cres 5661 “ cima 5662 Oncon0 6361 ‘cfv 6537 ωcom 7865 reccrdg 8401 ≼ cdom 8953 OrdIsocoi 9484 harchar 9531 TCctc 9716 𝑅1cr1 9747 rankcrnk 9748 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2734 ax-rep 5236 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 ax-un 7739 ax-inf2 9623 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3079 df-rex 3089 df-rmo 3367 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-int 4911 df-iun 4956 df-iin 4957 df-br 5108 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5554 df-eprel 5559 df-po 5567 df-so 5568 df-fr 5612 df-se 5613 df-we 5614 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-isom 6546 df-riota 7373 df-ov 7419 df-om 7866 df-1st 7989 df-2nd 7990 df-frecs 8283 df-wrecs 8314 df-smo 8338 df-recs 8363 df-rdg 8402 df-en 8956 df-dom 8957 df-sdom 8958 df-oi 9485 df-har 9532 df-wdom 9540 df-tc 9717 df-r1 9749 df-rank 9750 |
| This theorem is used by: hsmex 10437 |
| Copyright terms: Public domain | W3C validator |