MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  elharval Structured version   Visualization version   GIF version

Theorem elharval 9473
Description: The Hartogs number of a set contains exactly the ordinals that set dominates. Combined with harcl 9471, 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.)
Assertion
Ref Expression
elharval (𝑌 ∈ (har‘𝑋) ↔ (𝑌 ∈ On ∧ 𝑌𝑋))

Proof of Theorem elharval
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 elfvex 6869 . 2 (𝑌 ∈ (har‘𝑋) → 𝑋 ∈ V)
2 reldom 8896 . . . 4 Rel ≼
32brrelex2i 5682 . . 3 (𝑌𝑋𝑋 ∈ V)
43adantl 482 . 2 ((𝑌 ∈ On ∧ 𝑌𝑋) → 𝑋 ∈ V)
5 harval 9472 . . . 4 (𝑋 ∈ V → (har‘𝑋) = {𝑦 ∈ On ∣ 𝑦𝑋})
65eleq2d 2826 . . 3 (𝑋 ∈ V → (𝑌 ∈ (har‘𝑋) ↔ 𝑌 ∈ {𝑦 ∈ On ∣ 𝑦𝑋}))
7 breq1 5082 . . . 4 (𝑦 = 𝑌 → (𝑦𝑋𝑌𝑋))
87elrab 3636 . . 3 (𝑌 ∈ {𝑦 ∈ On ∣ 𝑦𝑋} ↔ (𝑌 ∈ On ∧ 𝑌𝑋))
96, 8bitrdi 288 . 2 (𝑋 ∈ V → (𝑌 ∈ (har‘𝑋) ↔ (𝑌 ∈ On ∧ 𝑌𝑋)))
101, 4, 9pm5.21nii 379 1 (𝑌 ∈ (har‘𝑋) ↔ (𝑌 ∈ On ∧ 𝑌𝑋))
Colors of variables: wff setvar class
Syntax hints:  wb 207  wa 396  wcel 2119  {crab 3392  Vcvv 3432   class class class wbr 5079  Oncon0 6317  cfv 6492  cdom 8888  harchar 9468
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2712  ax-rep 5206  ax-sep 5225  ax-nul 5235  ax-pow 5301  ax-pr 5369  ax-un 7685
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3or 1093  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2719  df-cleq 2732  df-clel 2815  df-nfc 2889  df-ne 2936  df-ral 3055  df-rex 3065  df-rmo 3345  df-reu 3346  df-rab 3393  df-v 3434  df-sbc 3731  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-pss 3910  df-nul 4269  df-if 4462  df-pw 4538  df-sn 4563  df-pr 4565  df-op 4569  df-uni 4846  df-iun 4930  df-br 5080  df-opab 5142  df-mpt 5161  df-tr 5187  df-id 5520  df-eprel 5525  df-po 5533  df-so 5534  df-fr 5578  df-se 5579  df-we 5580  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  df-pred 6259  df-ord 6320  df-on 6321  df-lim 6322  df-suc 6323  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-isom 6501  df-riota 7320  df-ov 7366  df-2nd 7939  df-frecs 8228  df-wrecs 8259  df-recs 8308  df-en 8891  df-dom 8892  df-oi 9422  df-har 9469
This theorem is referenced by:  harndom  9474  harcard  9900  cardprclem  9901  cardaleph  10009  dfac12lem2  10065  hsmexlem1  10346  pwcfsdom  10504  pwfseqlem5  10584  hargch  10594  harinf  43486  harn0  43554
  Copyright terms: Public domain W3C validator