| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > engch | Structured version Visualization version GIF version | ||
| Description: The property of being a GCH-set is a cardinal invariant. (Contributed by Mario Carneiro, 15-May-2015.) |
| Ref | Expression |
|---|---|
| engch | ⊢ (𝐴 ≈ 𝐵 → (𝐴 ∈ GCH ↔ 𝐵 ∈ GCH)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | enfi 9207 | . . 3 ⊢ (𝐴 ≈ 𝐵 → (𝐴 ∈ Fin ↔ 𝐵 ∈ Fin)) | |
| 2 | sdomen1 9145 | . . . . . 6 ⊢ (𝐴 ≈ 𝐵 → (𝐴 ≺ 𝑥 ↔ 𝐵 ≺ 𝑥)) | |
| 3 | pwen 9174 | . . . . . . 7 ⊢ (𝐴 ≈ 𝐵 → 𝒫 𝐴 ≈ 𝒫 𝐵) | |
| 4 | sdomen2 9146 | . . . . . . 7 ⊢ (𝒫 𝐴 ≈ 𝒫 𝐵 → (𝑥 ≺ 𝒫 𝐴 ↔ 𝑥 ≺ 𝒫 𝐵)) | |
| 5 | 3, 4 | syl 18 | . . . . . 6 ⊢ (𝐴 ≈ 𝐵 → (𝑥 ≺ 𝒫 𝐴 ↔ 𝑥 ≺ 𝒫 𝐵)) |
| 6 | 2, 5 | anbi12d 644 | . . . . 5 ⊢ (𝐴 ≈ 𝐵 → ((𝐴 ≺ 𝑥 ∧ 𝑥 ≺ 𝒫 𝐴) ↔ (𝐵 ≺ 𝑥 ∧ 𝑥 ≺ 𝒫 𝐵))) |
| 7 | 6 | notbid 321 | . . . 4 ⊢ (𝐴 ≈ 𝐵 → (¬ (𝐴 ≺ 𝑥 ∧ 𝑥 ≺ 𝒫 𝐴) ↔ ¬ (𝐵 ≺ 𝑥 ∧ 𝑥 ≺ 𝒫 𝐵))) |
| 8 | 7 | albidv 1952 | . . 3 ⊢ (𝐴 ≈ 𝐵 → (∀𝑥 ¬ (𝐴 ≺ 𝑥 ∧ 𝑥 ≺ 𝒫 𝐴) ↔ ∀𝑥 ¬ (𝐵 ≺ 𝑥 ∧ 𝑥 ≺ 𝒫 𝐵))) |
| 9 | 1, 8 | orbi12d 932 | . 2 ⊢ (𝐴 ≈ 𝐵 → ((𝐴 ∈ Fin ∨ ∀𝑥 ¬ (𝐴 ≺ 𝑥 ∧ 𝑥 ≺ 𝒫 𝐴)) ↔ (𝐵 ∈ Fin ∨ ∀𝑥 ¬ (𝐵 ≺ 𝑥 ∧ 𝑥 ≺ 𝒫 𝐵)))) |
| 10 | relen 8983 | . . . 4 ⊢ Rel ≈ | |
| 11 | 10 | brrelex1i 5706 | . . 3 ⊢ (𝐴 ≈ 𝐵 → 𝐴 ∈ V) |
| 12 | elgch 10712 | . . 3 ⊢ (𝐴 ∈ V → (𝐴 ∈ GCH ↔ (𝐴 ∈ Fin ∨ ∀𝑥 ¬ (𝐴 ≺ 𝑥 ∧ 𝑥 ≺ 𝒫 𝐴)))) | |
| 13 | 11, 12 | syl 18 | . 2 ⊢ (𝐴 ≈ 𝐵 → (𝐴 ∈ GCH ↔ (𝐴 ∈ Fin ∨ ∀𝑥 ¬ (𝐴 ≺ 𝑥 ∧ 𝑥 ≺ 𝒫 𝐴)))) |
| 14 | 10 | brrelex2i 5707 | . . 3 ⊢ (𝐴 ≈ 𝐵 → 𝐵 ∈ V) |
| 15 | elgch 10712 | . . 3 ⊢ (𝐵 ∈ V → (𝐵 ∈ GCH ↔ (𝐵 ∈ Fin ∨ ∀𝑥 ¬ (𝐵 ≺ 𝑥 ∧ 𝑥 ≺ 𝒫 𝐵)))) | |
| 16 | 14, 15 | syl 18 | . 2 ⊢ (𝐴 ≈ 𝐵 → (𝐵 ∈ GCH ↔ (𝐵 ∈ Fin ∨ ∀𝑥 ¬ (𝐵 ≺ 𝑥 ∧ 𝑥 ≺ 𝒫 𝐵)))) |
| 17 | 9, 13, 16 | 3bitr4d 314 | 1 ⊢ (𝐴 ≈ 𝐵 → (𝐴 ∈ GCH ↔ 𝐵 ∈ GCH)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 401 ∨ wo 861 ∀wal 1567 ∈ wcel 2144 Vcvv 3450 𝒫 cpw 4556 class class class wbr 5102 ≈ cen 8975 ≺ csdm 8977 Fincfn 8978 GCHcgch 10710 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7753 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3848 df-ss 3897 df-pss 4013 df-dif 4046 df-in 4090 df-un 4150 df-nul 4278 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5545 df-eprel 5550 df-po 5558 df-so 5559 df-fr 5603 df-we 5605 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6496 df-fun 6543 df-fn 6544 df-f 6545 df-f1 6546 df-fo 6547 df-f1o 6548 df-fv 6549 df-ov 7425 df-oprab 7426 df-mpo 7427 df-om 7880 df-1st 8003 df-2nd 8004 df-1o 8481 df-2o 8482 df-er 8722 df-map 8854 df-en 8979 df-dom 8980 df-sdom 8981 df-fin 8982 df-gch 10711 |
| This theorem is used by: gch2 10765 |
| Copyright terms: Public domain | W3C validator |