| 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 9500, 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 6896 | . 2 ⊢ (𝑌 ∈ (har‘𝑋) → 𝑋 ∈ V) | |
| 2 | reldom 8926 | . . . 4 ⊢ Rel ≼ | |
| 3 | 2 | brrelex2i 5700 | . . 3 ⊢ (𝑌 ≼ 𝑋 → 𝑋 ∈ V) |
| 4 | 3 | adantl 485 | . 2 ⊢ ((𝑌 ∈ On ∧ 𝑌 ≼ 𝑋) → 𝑋 ∈ V) |
| 5 | harval 9501 | . . . 4 ⊢ (𝑋 ∈ V → (har‘𝑋) = {𝑦 ∈ On ∣ 𝑦 ≼ 𝑋}) | |
| 6 | 5 | eleq2d 2847 | . . 3 ⊢ (𝑋 ∈ V → (𝑌 ∈ (har‘𝑋) ↔ 𝑌 ∈ {𝑦 ∈ On ∣ 𝑦 ≼ 𝑋})) |
| 7 | breq1 5100 | . . . 4 ⊢ (𝑦 = 𝑌 → (𝑦 ≼ 𝑋 ↔ 𝑌 ≼ 𝑋)) | |
| 8 | 7 | elrab 3649 | . . 3 ⊢ (𝑌 ∈ {𝑦 ∈ On ∣ 𝑦 ≼ 𝑋} ↔ (𝑌 ∈ On ∧ 𝑌 ≼ 𝑋)) |
| 9 | 6, 8 | bitrdi 289 | . 2 ⊢ (𝑋 ∈ V → (𝑌 ∈ (har‘𝑋) ↔ (𝑌 ∈ On ∧ 𝑌 ≼ 𝑋))) |
| 10 | 1, 4, 9 | pm5.21nii 380 | 1 ⊢ (𝑌 ∈ (har‘𝑋) ↔ (𝑌 ∈ On ∧ 𝑌 ≼ 𝑋)) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 208 ∧ wa 399 ∈ wcel 2141 {crab 3413 Vcvv 3453 class class class wbr 5097 Oncon0 6340 ‘cfv 6515 ≼ cdom 8918 harchar 9497 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-rep 5224 ax-sep 5243 ax-nul 5253 ax-pow 5319 ax-pr 5387 ax-un 7712 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1098 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3076 df-rex 3086 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4580 df-pr 4582 df-op 4586 df-uni 4863 df-iun 4948 df-br 5098 df-opab 5160 df-mpt 5179 df-tr 5205 df-id 5538 df-eprel 5543 df-po 5551 df-so 5552 df-fr 5596 df-se 5597 df-we 5598 df-xp 5649 df-rel 5650 df-cnv 5651 df-co 5652 df-dm 5653 df-rn 5654 df-res 5655 df-ima 5656 df-pred 6282 df-ord 6343 df-on 6344 df-lim 6345 df-suc 6346 df-iota 6471 df-fun 6517 df-fn 6518 df-f 6519 df-f1 6520 df-fo 6521 df-f1o 6522 df-fv 6523 df-isom 6524 df-riota 7347 df-ov 7393 df-2nd 7965 df-frecs 8255 df-wrecs 8286 df-recs 8335 df-en 8921 df-dom 8922 df-oi 9451 df-har 9498 |
| This theorem is referenced by: harndom 9503 harcard 9929 cardprclem 9930 cardaleph 10038 dfac12lem2 10094 hsmexlem1 10376 pwcfsdom 10534 pwfseqlem5 10614 hargch 10624 harinf 43571 harn0 43639 |
| Copyright terms: Public domain | W3C validator |