| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > isnumi | GIF version | ||
| Description: A set equinumerous to an ordinal is numerable. (Contributed by Mario Carneiro, 29-Apr-2015.) |
| Ref | Expression |
|---|---|
| isnumi | ⊢ ((𝐴 ∈ On ∧ 𝐴 ≈ 𝐵) → 𝐵 ∈ dom card) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | breq1 4133 | . . . . 5 ⊢ (𝑦 = 𝐴 → (𝑦 ≈ 𝐵 ↔ 𝐴 ≈ 𝐵)) | |
| 2 | 1 | rspcev 2929 | . . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐴 ≈ 𝐵) → ∃𝑦 ∈ On 𝑦 ≈ 𝐵) |
| 3 | intexrabim 4289 | . . . 4 ⊢ (∃𝑦 ∈ On 𝑦 ≈ 𝐵 → ∩ {𝑦 ∈ On ∣ 𝑦 ≈ 𝐵} ∈ V) | |
| 4 | 2, 3 | syl 14 | . . 3 ⊢ ((𝐴 ∈ On ∧ 𝐴 ≈ 𝐵) → ∩ {𝑦 ∈ On ∣ 𝑦 ≈ 𝐵} ∈ V) |
| 5 | encv 7028 | . . . . . 6 ⊢ (𝐴 ≈ 𝐵 → (𝐴 ∈ V ∧ 𝐵 ∈ V)) | |
| 6 | 5 | simprd 114 | . . . . 5 ⊢ (𝐴 ≈ 𝐵 → 𝐵 ∈ V) |
| 7 | breq2 4134 | . . . . . . . . 9 ⊢ (𝑥 = 𝐵 → (𝑦 ≈ 𝑥 ↔ 𝑦 ≈ 𝐵)) | |
| 8 | 7 | rabbidv 2810 | . . . . . . . 8 ⊢ (𝑥 = 𝐵 → {𝑦 ∈ On ∣ 𝑦 ≈ 𝑥} = {𝑦 ∈ On ∣ 𝑦 ≈ 𝐵}) |
| 9 | 8 | inteqd 3975 | . . . . . . 7 ⊢ (𝑥 = 𝐵 → ∩ {𝑦 ∈ On ∣ 𝑦 ≈ 𝑥} = ∩ {𝑦 ∈ On ∣ 𝑦 ≈ 𝐵}) |
| 10 | 9 | eleq1d 2307 | . . . . . 6 ⊢ (𝑥 = 𝐵 → (∩ {𝑦 ∈ On ∣ 𝑦 ≈ 𝑥} ∈ V ↔ ∩ {𝑦 ∈ On ∣ 𝑦 ≈ 𝐵} ∈ V)) |
| 11 | 10 | elrab3 2983 | . . . . 5 ⊢ (𝐵 ∈ V → (𝐵 ∈ {𝑥 ∈ V ∣ ∩ {𝑦 ∈ On ∣ 𝑦 ≈ 𝑥} ∈ V} ↔ ∩ {𝑦 ∈ On ∣ 𝑦 ≈ 𝐵} ∈ V)) |
| 12 | 6, 11 | syl 14 | . . . 4 ⊢ (𝐴 ≈ 𝐵 → (𝐵 ∈ {𝑥 ∈ V ∣ ∩ {𝑦 ∈ On ∣ 𝑦 ≈ 𝑥} ∈ V} ↔ ∩ {𝑦 ∈ On ∣ 𝑦 ≈ 𝐵} ∈ V)) |
| 13 | 12 | adantl 277 | . . 3 ⊢ ((𝐴 ∈ On ∧ 𝐴 ≈ 𝐵) → (𝐵 ∈ {𝑥 ∈ V ∣ ∩ {𝑦 ∈ On ∣ 𝑦 ≈ 𝑥} ∈ V} ↔ ∩ {𝑦 ∈ On ∣ 𝑦 ≈ 𝐵} ∈ V)) |
| 14 | 4, 13 | mpbird 167 | . 2 ⊢ ((𝐴 ∈ On ∧ 𝐴 ≈ 𝐵) → 𝐵 ∈ {𝑥 ∈ V ∣ ∩ {𝑦 ∈ On ∣ 𝑦 ≈ 𝑥} ∈ V}) |
| 15 | df-card 7524 | . . 3 ⊢ card = (𝑥 ∈ V ↦ ∩ {𝑦 ∈ On ∣ 𝑦 ≈ 𝑥}) | |
| 16 | 15 | dmmpt 5283 | . 2 ⊢ dom card = {𝑥 ∈ V ∣ ∩ {𝑦 ∈ On ∣ 𝑦 ≈ 𝑥} ∈ V} |
| 17 | 14, 16 | eleqtrrdi 2332 | 1 ⊢ ((𝐴 ∈ On ∧ 𝐴 ≈ 𝐵) → 𝐵 ∈ dom card) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1402 ∈ wcel 2209 ∃wrex 2529 {crab 2532 Vcvv 2821 ∩ cint 3970 class class class wbr 4130 Oncon0 4508 dom cdm 4774 ≈ cen 7020 cardccrd 7522 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-sep 4249 ax-pow 4311 ax-pr 4346 |
| This proof depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ral 2533 df-rex 2534 df-rab 2537 df-v 2823 df-un 3224 df-in 3226 df-ss 3233 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-int 3971 df-br 4131 df-opab 4193 df-mpt 4194 df-xp 4780 df-rel 4781 df-cnv 4782 df-dm 4784 df-rn 4785 df-res 4786 df-ima 4787 df-en 7023 df-card 7524 |
| This theorem is used by: finnum 7528 onenon 7529 |
| Copyright terms: Public domain | W3C validator |