Users' Mathboxes Mathbox for Richard Penner < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  minregex2 Structured version   Visualization version   GIF version

Theorem minregex2 43437
Description: Given any cardinal number 𝐴, there exists an argument 𝑥, which yields the least regular uncountable value of which dominates 𝐴. This proof uses AC. (Contributed by RP, 24-Nov-2023.)
Assertion
Ref Expression
minregex2 (𝐴 ∈ (ran card ∖ ω) → ∃𝑥 ∈ On 𝑥 = {𝑦 ∈ On ∣ (∅ ∈ 𝑦𝐴 ≼ (ℵ‘𝑦) ∧ (cf‘(ℵ‘𝑦)) = (ℵ‘𝑦))})
Distinct variable group:   𝑥,𝐴,𝑦

Proof of Theorem minregex2
StepHypRef Expression
1 minregex 43436 . 2 (𝐴 ∈ (ran card ∖ ω) → ∃𝑥 ∈ On 𝑥 = {𝑦 ∈ On ∣ (∅ ∈ 𝑦𝐴 ⊆ (ℵ‘𝑦) ∧ (cf‘(ℵ‘𝑦)) = (ℵ‘𝑦))})
2 eldifi 4148 . . . . . . . . . . 11 (𝐴 ∈ (ran card ∖ ω) → 𝐴 ∈ ran card)
3 iscard4 43435 . . . . . . . . . . 11 ((card‘𝐴) = 𝐴𝐴 ∈ ran card)
42, 3sylibr 234 . . . . . . . . . 10 (𝐴 ∈ (ran card ∖ ω) → (card‘𝐴) = 𝐴)
54adantr 480 . . . . . . . . 9 ((𝐴 ∈ (ran card ∖ ω) ∧ 𝑦 ∈ On) → (card‘𝐴) = 𝐴)
6 alephcard 10135 . . . . . . . . . 10 (card‘(ℵ‘𝑦)) = (ℵ‘𝑦)
76a1i 11 . . . . . . . . 9 ((𝐴 ∈ (ran card ∖ ω) ∧ 𝑦 ∈ On) → (card‘(ℵ‘𝑦)) = (ℵ‘𝑦))
85, 7sseq12d 4036 . . . . . . . 8 ((𝐴 ∈ (ran card ∖ ω) ∧ 𝑦 ∈ On) → ((card‘𝐴) ⊆ (card‘(ℵ‘𝑦)) ↔ 𝐴 ⊆ (ℵ‘𝑦)))
9 numth3 10535 . . . . . . . . 9 (𝐴 ∈ (ran card ∖ ω) → 𝐴 ∈ dom card)
10 alephon 10134 . . . . . . . . . 10 (ℵ‘𝑦) ∈ On
11 onenon 10014 . . . . . . . . . 10 ((ℵ‘𝑦) ∈ On → (ℵ‘𝑦) ∈ dom card)
1210, 11mp1i 13 . . . . . . . . 9 (𝑦 ∈ On → (ℵ‘𝑦) ∈ dom card)
13 carddom2 10042 . . . . . . . . 9 ((𝐴 ∈ dom card ∧ (ℵ‘𝑦) ∈ dom card) → ((card‘𝐴) ⊆ (card‘(ℵ‘𝑦)) ↔ 𝐴 ≼ (ℵ‘𝑦)))
149, 12, 13syl2an 595 . . . . . . . 8 ((𝐴 ∈ (ran card ∖ ω) ∧ 𝑦 ∈ On) → ((card‘𝐴) ⊆ (card‘(ℵ‘𝑦)) ↔ 𝐴 ≼ (ℵ‘𝑦)))
158, 14bitr3d 281 . . . . . . 7 ((𝐴 ∈ (ran card ∖ ω) ∧ 𝑦 ∈ On) → (𝐴 ⊆ (ℵ‘𝑦) ↔ 𝐴 ≼ (ℵ‘𝑦)))
16153anbi2d 1441 . . . . . 6 ((𝐴 ∈ (ran card ∖ ω) ∧ 𝑦 ∈ On) → ((∅ ∈ 𝑦𝐴 ⊆ (ℵ‘𝑦) ∧ (cf‘(ℵ‘𝑦)) = (ℵ‘𝑦)) ↔ (∅ ∈ 𝑦𝐴 ≼ (ℵ‘𝑦) ∧ (cf‘(ℵ‘𝑦)) = (ℵ‘𝑦))))
1716rabbidva 3445 . . . . 5 (𝐴 ∈ (ran card ∖ ω) → {𝑦 ∈ On ∣ (∅ ∈ 𝑦𝐴 ⊆ (ℵ‘𝑦) ∧ (cf‘(ℵ‘𝑦)) = (ℵ‘𝑦))} = {𝑦 ∈ On ∣ (∅ ∈ 𝑦𝐴 ≼ (ℵ‘𝑦) ∧ (cf‘(ℵ‘𝑦)) = (ℵ‘𝑦))})
1817inteqd 4977 . . . 4 (𝐴 ∈ (ran card ∖ ω) → {𝑦 ∈ On ∣ (∅ ∈ 𝑦𝐴 ⊆ (ℵ‘𝑦) ∧ (cf‘(ℵ‘𝑦)) = (ℵ‘𝑦))} = {𝑦 ∈ On ∣ (∅ ∈ 𝑦𝐴 ≼ (ℵ‘𝑦) ∧ (cf‘(ℵ‘𝑦)) = (ℵ‘𝑦))})
1918eqeq2d 2745 . . 3 (𝐴 ∈ (ran card ∖ ω) → (𝑥 = {𝑦 ∈ On ∣ (∅ ∈ 𝑦𝐴 ⊆ (ℵ‘𝑦) ∧ (cf‘(ℵ‘𝑦)) = (ℵ‘𝑦))} ↔ 𝑥 = {𝑦 ∈ On ∣ (∅ ∈ 𝑦𝐴 ≼ (ℵ‘𝑦) ∧ (cf‘(ℵ‘𝑦)) = (ℵ‘𝑦))}))
2019rexbidv 3181 . 2 (𝐴 ∈ (ran card ∖ ω) → (∃𝑥 ∈ On 𝑥 = {𝑦 ∈ On ∣ (∅ ∈ 𝑦𝐴 ⊆ (ℵ‘𝑦) ∧ (cf‘(ℵ‘𝑦)) = (ℵ‘𝑦))} ↔ ∃𝑥 ∈ On 𝑥 = {𝑦 ∈ On ∣ (∅ ∈ 𝑦𝐴 ≼ (ℵ‘𝑦) ∧ (cf‘(ℵ‘𝑦)) = (ℵ‘𝑦))}))
211, 20mpbid 232 1 (𝐴 ∈ (ran card ∖ ω) → ∃𝑥 ∈ On 𝑥 = {𝑦 ∈ On ∣ (∅ ∈ 𝑦𝐴 ≼ (ℵ‘𝑦) ∧ (cf‘(ℵ‘𝑦)) = (ℵ‘𝑦))})
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  w3a 1087   = wceq 1537  wcel 2103  wrex 3072  {crab 3438  cdif 3967  wss 3970  c0 4347   cint 4972   class class class wbr 5169  dom cdm 5699  ran crn 5700  Oncon0 6394  cfv 6572  ωcom 7899  cdom 8997  cardccrd 10000  cale 10001  cfccf 10002
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2105  ax-9 2113  ax-10 2136  ax-11 2153  ax-12 2173  ax-ext 2705  ax-rep 5306  ax-sep 5320  ax-nul 5327  ax-pow 5386  ax-pr 5450  ax-un 7766  ax-inf2 9706  ax-ac2 10528
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3or 1088  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2537  df-eu 2566  df-clab 2712  df-cleq 2726  df-clel 2813  df-nfc 2890  df-ne 2943  df-ral 3064  df-rex 3073  df-rmo 3383  df-reu 3384  df-rab 3439  df-v 3484  df-sbc 3799  df-csb 3916  df-dif 3973  df-un 3975  df-in 3977  df-ss 3987  df-pss 3990  df-nul 4348  df-if 4549  df-pw 4624  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-int 4973  df-iun 5021  df-br 5170  df-opab 5232  df-mpt 5253  df-tr 5287  df-id 5597  df-eprel 5603  df-po 5611  df-so 5612  df-fr 5654  df-se 5655  df-we 5656  df-xp 5705  df-rel 5706  df-cnv 5707  df-co 5708  df-dm 5709  df-rn 5710  df-res 5711  df-ima 5712  df-pred 6331  df-ord 6397  df-on 6398  df-lim 6399  df-suc 6400  df-iota 6524  df-fun 6574  df-fn 6575  df-f 6576  df-f1 6577  df-fo 6578  df-f1o 6579  df-fv 6580  df-isom 6581  df-riota 7401  df-ov 7448  df-oprab 7449  df-mpo 7450  df-om 7900  df-1st 8026  df-2nd 8027  df-frecs 8318  df-wrecs 8349  df-recs 8423  df-rdg 8462  df-1o 8518  df-er 8759  df-map 8882  df-en 9000  df-dom 9001  df-sdom 9002  df-fin 9003  df-oi 9575  df-har 9622  df-card 10004  df-aleph 10005  df-cf 10006  df-acn 10007  df-ac 10181
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator