| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > elharval | Structured version Visualization version GIF version | ||
| Description: The Hartogs number of a set contains exactly the ordinals that set dominates. Combined with harcl 9537, this implies that the Hartogs number of a set is greater than all ordinals that set dominates. (Contributed by Stefan O'Rear, 11-Feb-2015.) (Revised by Mario Carneiro, 15-May-2015.) |
| Ref | Expression |
|---|---|
| elharval | ⊢ (𝑌 ∈ (har‘𝑋) ↔ (𝑌 ∈ On ∧ 𝑌 ≼ 𝑋)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elfvex 6912 | . 2 ⊢ (𝑌 ∈ (har‘𝑋) → 𝑋 ∈ V) | |
| 2 | reldom 8963 | . . . 4 ⊢ Rel ≼ | |
| 3 | 2 | brrelex2i 5708 | . . 3 ⊢ (𝑌 ≼ 𝑋 → 𝑋 ∈ V) |
| 4 | 3 | adantl 487 | . 2 ⊢ ((𝑌 ∈ On ∧ 𝑌 ≼ 𝑋) → 𝑋 ∈ V) |
| 5 | harval 9538 | . . . 4 ⊢ (𝑋 ∈ V → (har‘𝑋) = {𝑦 ∈ On ∣ 𝑦 ≼ 𝑋}) | |
| 6 | 5 | eleq2d 2847 | . . 3 ⊢ (𝑋 ∈ V → (𝑌 ∈ (har‘𝑋) ↔ 𝑌 ∈ {𝑦 ∈ On ∣ 𝑦 ≼ 𝑋})) |
| 7 | breq1 5106 | . . . 4 ⊢ (𝑦 = 𝑌 → (𝑦 ≼ 𝑋 ↔ 𝑌 ≼ 𝑋)) | |
| 8 | 7 | elrab 3645 | . . 3 ⊢ (𝑌 ∈ {𝑦 ∈ On ∣ 𝑦 ≼ 𝑋} ↔ (𝑌 ∈ On ∧ 𝑌 ≼ 𝑋)) |
| 9 | 6, 8 | bitrdi 290 | . 2 ⊢ (𝑋 ∈ V → (𝑌 ∈ (har‘𝑋) ↔ (𝑌 ∈ On ∧ 𝑌 ≼ 𝑋))) |
| 10 | 1, 4, 9 | pm5.21nii 381 | 1 ⊢ (𝑌 ∈ (har‘𝑋) ↔ (𝑌 ∈ On ∧ 𝑌 ≼ 𝑋)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 ∧ wa 401 ∈ wcel 2145 {crab 3413 Vcvv 3451 class class class wbr 5103 Oncon0 6355 ‘cfv 6531 ≼ cdom 8955 harchar 9534 |
| 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 2213 ax-ext 2733 ax-rep 5232 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7740 |
| 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 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3078 df-rex 3088 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-se 5605 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6297 df-ord 6358 df-on 6359 df-lim 6360 df-suc 6361 df-iota 6487 df-fun 6533 df-fn 6534 df-f 6535 df-f1 6536 df-fo 6537 df-f1o 6538 df-fv 6539 df-isom 6540 df-riota 7369 df-ov 7415 df-2nd 7991 df-frecs 8283 df-wrecs 8314 df-recs 8363 df-en 8958 df-dom 8959 df-oi 9488 df-har 9535 |
| This theorem is used by: harndom 9540 harcard 10040 cardprclem 10041 cardaleph 10149 dfac12lem2 10204 hsmexlem1 10485 pwcfsdom 10649 pwfseqlem5 10729 hargch 10739 harinf 43994 harn0 44062 |
| Copyright terms: Public domain | W3C validator |