| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > gchacg | Structured version Visualization version GIF version | ||
| Description: A "local" form of gchac 10578. If 𝐴 and 𝒫 𝐴 are GCH-sets, then 𝒫 𝐴 is well-orderable. The proof is due to Specker. Theorem 2.1 of [KanamoriPincus] p. 419. (Contributed by Mario Carneiro, 15-May-2015.) |
| Ref | Expression |
|---|---|
| gchacg | ⊢ ((ω ≼ 𝐴 ∧ 𝐴 ∈ GCH ∧ 𝒫 𝐴 ∈ GCH) → 𝒫 𝐴 ∈ dom card) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | harcl 9451 | . 2 ⊢ (har‘𝐴) ∈ On | |
| 2 | gchhar 10576 | . 2 ⊢ ((ω ≼ 𝐴 ∧ 𝐴 ∈ GCH ∧ 𝒫 𝐴 ∈ GCH) → (har‘𝐴) ≈ 𝒫 𝐴) | |
| 3 | isnumi 9845 | . 2 ⊢ (((har‘𝐴) ∈ On ∧ (har‘𝐴) ≈ 𝒫 𝐴) → 𝒫 𝐴 ∈ dom card) | |
| 4 | 1, 2, 3 | sylancr 587 | 1 ⊢ ((ω ≼ 𝐴 ∧ 𝐴 ∈ GCH ∧ 𝒫 𝐴 ∈ GCH) → 𝒫 𝐴 ∈ dom card) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ w3a 1086 ∈ wcel 2111 𝒫 cpw 4549 class class class wbr 5093 dom cdm 5619 Oncon0 6312 ‘cfv 6487 ωcom 7802 ≈ cen 8872 ≼ cdom 8873 harchar 9448 cardccrd 9834 GCHcgch 10517 |
| 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 1911 ax-6 1968 ax-7 2009 ax-8 2113 ax-9 2121 ax-10 2144 ax-11 2160 ax-12 2180 ax-ext 2703 ax-rep 5219 ax-sep 5236 ax-nul 5246 ax-pow 5305 ax-pr 5372 ax-un 7674 ax-inf2 9537 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2535 df-eu 2564 df-clab 2710 df-cleq 2723 df-clel 2806 df-nfc 2881 df-ne 2929 df-ral 3048 df-rex 3057 df-rmo 3346 df-reu 3347 df-rab 3396 df-v 3438 df-sbc 3737 df-csb 3846 df-dif 3900 df-un 3902 df-in 3904 df-ss 3914 df-pss 3917 df-nul 4283 df-if 4475 df-pw 4551 df-sn 4576 df-pr 4578 df-tp 4580 df-op 4582 df-uni 4859 df-int 4898 df-iun 4943 df-br 5094 df-opab 5156 df-mpt 5175 df-tr 5201 df-id 5514 df-eprel 5519 df-po 5527 df-so 5528 df-fr 5572 df-se 5573 df-we 5574 df-xp 5625 df-rel 5626 df-cnv 5627 df-co 5628 df-dm 5629 df-rn 5630 df-res 5631 df-ima 5632 df-pred 6254 df-ord 6315 df-on 6316 df-lim 6317 df-suc 6318 df-iota 6443 df-fun 6489 df-fn 6490 df-f 6491 df-f1 6492 df-fo 6493 df-f1o 6494 df-fv 6495 df-isom 6496 df-riota 7309 df-ov 7355 df-oprab 7356 df-mpo 7357 df-om 7803 df-1st 7927 df-2nd 7928 df-supp 8097 df-frecs 8217 df-wrecs 8248 df-recs 8297 df-rdg 8335 df-seqom 8373 df-1o 8391 df-2o 8392 df-oadd 8395 df-omul 8396 df-oexp 8397 df-er 8628 df-map 8758 df-en 8876 df-dom 8877 df-sdom 8878 df-fin 8879 df-fsupp 9252 df-oi 9402 df-har 9449 df-wdom 9457 df-cnf 9558 df-dju 9800 df-card 9838 df-fin4 10184 df-gch 10518 |
| This theorem is referenced by: gchac 10578 |
| Copyright terms: Public domain | W3C validator |