| 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 9240 | . . 3 ⊢ (𝐴 ≈ 𝐵 → (𝐴 ∈ Fin ↔ 𝐵 ∈ Fin)) | |
| 2 | sdomen1 9178 | . . . . . 6 ⊢ (𝐴 ≈ 𝐵 → (𝐴 ≺ 𝑥 ↔ 𝐵 ≺ 𝑥)) | |
| 3 | pwen 9207 | . . . . . . 7 ⊢ (𝐴 ≈ 𝐵 → 𝒫 𝐴 ≈ 𝒫 𝐵) | |
| 4 | sdomen2 9179 | . . . . . . 7 ⊢ (𝒫 𝐴 ≈ 𝒫 𝐵 → (𝑥 ≺ 𝒫 𝐴 ↔ 𝑥 ≺ 𝒫 𝐵)) | |
| 5 | 3, 4 | syl 18 | . . . . . 6 ⊢ (𝐴 ≈ 𝐵 → (𝑥 ≺ 𝒫 𝐴 ↔ 𝑥 ≺ 𝒫 𝐵)) |
| 6 | 2, 5 | anbi12d 644 | . . . . 5 ⊢ (𝐴 ≈ 𝐵 → ((𝐴 ≺ 𝑥 ∧ 𝑥 ≺ 𝒫 𝐴) ↔ (𝐵 ≺ 𝑥 ∧ 𝑥 ≺ 𝒫 𝐵))) |
| 7 | 6 | notbid 321 | . . . 4 ⊢ (𝐴 ≈ 𝐵 → (¬ (𝐴 ≺ 𝑥 ∧ 𝑥 ≺ 𝒫 𝐴) ↔ ¬ (𝐵 ≺ 𝑥 ∧ 𝑥 ≺ 𝒫 𝐵))) |
| 8 | 7 | albidv 1955 | . . 3 ⊢ (𝐴 ≈ 𝐵 → (∀𝑥 ¬ (𝐴 ≺ 𝑥 ∧ 𝑥 ≺ 𝒫 𝐴) ↔ ∀𝑥 ¬ (𝐵 ≺ 𝑥 ∧ 𝑥 ≺ 𝒫 𝐵))) |
| 9 | 1, 8 | orbi12d 932 | . 2 ⊢ (𝐴 ≈ 𝐵 → ((𝐴 ∈ Fin ∨ ∀𝑥 ¬ (𝐴 ≺ 𝑥 ∧ 𝑥 ≺ 𝒫 𝐴)) ↔ (𝐵 ∈ Fin ∨ ∀𝑥 ¬ (𝐵 ≺ 𝑥 ∧ 𝑥 ≺ 𝒫 𝐵)))) |
| 10 | relen 9016 | . . . 4 ⊢ Rel ≈ | |
| 11 | 10 | brrelex1i 5714 | . . 3 ⊢ (𝐴 ≈ 𝐵 → 𝐴 ∈ V) |
| 12 | elgch 10746 | . . 3 ⊢ (𝐴 ∈ V → (𝐴 ∈ GCH ↔ (𝐴 ∈ Fin ∨ ∀𝑥 ¬ (𝐴 ≺ 𝑥 ∧ 𝑥 ≺ 𝒫 𝐴)))) | |
| 13 | 11, 12 | syl 18 | . 2 ⊢ (𝐴 ≈ 𝐵 → (𝐴 ∈ GCH ↔ (𝐴 ∈ Fin ∨ ∀𝑥 ¬ (𝐴 ≺ 𝑥 ∧ 𝑥 ≺ 𝒫 𝐴)))) |
| 14 | 10 | brrelex2i 5715 | . . 3 ⊢ (𝐴 ≈ 𝐵 → 𝐵 ∈ V) |
| 15 | elgch 10746 | . . 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 1568 ∈ wcel 2147 Vcvv 3454 𝒫 cpw 4560 class class class wbr 5108 ≈ cen 9008 ≺ csdm 9010 Fincfn 9011 GCHcgch 10744 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-ov 7454 df-oprab 7455 df-mpo 7456 df-om 7912 df-1st 8035 df-2nd 8036 df-1o 8514 df-2o 8515 df-er 8755 df-map 8887 df-en 9012 df-dom 9013 df-sdom 9014 df-fin 9015 df-gch 10745 |
| This theorem is used by: gch2 10799 |
| Copyright terms: Public domain | W3C validator |