| 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 9522, 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 6918 | . 2 ⊢ (𝑌 ∈ (har‘𝑋) → 𝑋 ∈ V) | |
| 2 | reldom 8950 | . . . 4 ⊢ Rel ≼ | |
| 3 | 2 | brrelex2i 5720 | . . 3 ⊢ (𝑌 ≼ 𝑋 → 𝑋 ∈ V) |
| 4 | 3 | adantl 486 | . 2 ⊢ ((𝑌 ∈ On ∧ 𝑌 ≼ 𝑋) → 𝑋 ∈ V) |
| 5 | harval 9523 | . . . 4 ⊢ (𝑋 ∈ V → (har‘𝑋) = {𝑦 ∈ On ∣ 𝑦 ≼ 𝑋}) | |
| 6 | 5 | eleq2d 2849 | . . 3 ⊢ (𝑋 ∈ V → (𝑌 ∈ (har‘𝑋) ↔ 𝑌 ∈ {𝑦 ∈ On ∣ 𝑦 ≼ 𝑋})) |
| 7 | breq1 5113 | . . . 4 ⊢ (𝑦 = 𝑌 → (𝑦 ≼ 𝑋 ↔ 𝑌 ≼ 𝑋)) | |
| 8 | 7 | elrab 3651 | . . 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 |
| Syntax hints: ↔ wb 209 ∧ wa 400 ∈ wcel 2143 {crab 3416 Vcvv 3455 class class class wbr 5110 Oncon0 6362 ‘cfv 6538 ≼ cdom 8942 harchar 9519 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-rep 5239 ax-sep 5258 ax-nul 5270 ax-pow 5338 ax-pr 5406 ax-un 7734 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-ral 3080 df-rex 3090 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3746 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4288 df-if 4489 df-pw 4565 df-sn 4591 df-pr 4593 df-op 4597 df-uni 4874 df-iun 4959 df-br 5111 df-opab 5175 df-mpt 5194 df-tr 5220 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-se 5617 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-isom 6547 df-riota 7369 df-ov 7415 df-2nd 7988 df-frecs 8279 df-wrecs 8310 df-recs 8359 df-en 8945 df-dom 8946 df-oi 9473 df-har 9520 |
| This theorem is referenced by: harndom 9525 harcard 9965 cardprclem 9966 cardaleph 10074 dfac12lem2 10129 hsmexlem1 10411 pwcfsdom 10569 pwfseqlem5 10649 hargch 10659 harinf 43744 harn0 43812 |
| Copyright terms: Public domain | W3C validator |