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 44726
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 44725 . 2 (𝐴 ∈ (ran card ∖ ω) → ∃𝑥 ∈ On 𝑥 = ∩ {𝑦 ∈ On ∣ (∅ ∈ 𝑦 ∧ 𝐴 ⊆ (ℵ‘𝑦) ∧ (cf‘(ℵ‘𝑦)) = (ℵ‘𝑦))})
2 eldifi 4070 . . . . . . . . . . 11 (𝐴 ∈ (ran card ∖ ω) → 𝐴 ∈ ran card)
3 iscard4 44724 . . . . . . . . . . 11 ((card‘𝐴) = 𝐴 ↔ 𝐴 ∈ ran card)
42, 3sylibr 237 . . . . . . . . . 10 (𝐴 ∈ (ran card ∖ ω) → (card‘𝐴) = 𝐴)
54adantr 486 . . . . . . . . 9 ((𝐴 ∈ (ran card ∖ ω) ∧ 𝑦 ∈ On) → (card‘𝐴) = 𝐴)
6 alephcard 10173 . . . . . . . . . 10 (card‘(ℵ‘𝑦)) = (ℵ‘𝑦)
76a1i 11 . . . . . . . . 9 ((𝐴 ∈ (ran card ∖ ω) ∧ 𝑦 ∈ On) → (card‘(ℵ‘𝑦)) = (ℵ‘𝑦))
85, 7sseq12d 3946 . . . . . . . 8 ((𝐴 ∈ (ran card ∖ ω) ∧ 𝑦 ∈ On) → ((card‘𝐴) ⊆ (card‘(ℵ‘𝑦)) ↔ 𝐴 ⊆ (ℵ‘𝑦)))
9 numth3 10572 . . . . . . . . 9 (𝐴 ∈ (ran card ∖ ω) → 𝐴 ∈ dom card)
10 alephon 10172 . . . . . . . . . 10 (ℵ‘𝑦) ∈ On
11 onenon 10054 . . . . . . . . . 10 ((ℵ‘𝑦) ∈ On → (ℵ‘𝑦) ∈ dom card)
1210, 11mp1i 14 . . . . . . . . 9 (𝑦 ∈ On → (ℵ‘𝑦) ∈ dom card)
13 carddom2 10082 . . . . . . . . 9 ((𝐴 ∈ dom card ∧ (ℵ‘𝑦) ∈ dom card) → ((card‘𝐴) ⊆ (card‘(ℵ‘𝑦)) ↔ 𝐴 ≼ (ℵ‘𝑦)))
149, 12, 13syl2an 608 . . . . . . . 8 ((𝐴 ∈ (ran card ∖ ω) ∧ 𝑦 ∈ On) → ((card‘𝐴) ⊆ (card‘(ℵ‘𝑦)) ↔ 𝐴 ≼ (ℵ‘𝑦)))
158, 14bitr3d 284 . . . . . . 7 ((𝐴 ∈ (ran card ∖ ω) ∧ 𝑦 ∈ On) → (𝐴 ⊆ (ℵ‘𝑦) ↔ 𝐴 ≼ (ℵ‘𝑦)))
16153anbi2d 1470 . . . . . 6 ((𝐴 ∈ (ran card ∖ ω) ∧ 𝑦 ∈ On) → ((∅ ∈ 𝑦 ∧ 𝐴 ⊆ (ℵ‘𝑦) ∧ (cf‘(ℵ‘𝑦)) = (ℵ‘𝑦)) ↔ (∅ ∈ 𝑦 ∧ 𝐴 ≼ (ℵ‘𝑦) ∧ (cf‘(ℵ‘𝑦)) = (ℵ‘𝑦))))
1716rabbidva 3422 . . . . 5 (𝐴 ∈ (ran card ∖ ω) → {𝑦 ∈ On ∣ (∅ ∈ 𝑦 ∧ 𝐴 ⊆ (ℵ‘𝑦) ∧ (cf‘(ℵ‘𝑦)) = (ℵ‘𝑦))} = {𝑦 ∈ On ∣ (∅ ∈ 𝑦 ∧ 𝐴 ≼ (ℵ‘𝑦) ∧ (cf‘(ℵ‘𝑦)) = (ℵ‘𝑦))})
1817inteqd 4915 . . . 4 (𝐴 ∈ (ran card ∖ ω) → ∩ {𝑦 ∈ On ∣ (∅ ∈ 𝑦 ∧ 𝐴 ⊆ (ℵ‘𝑦) ∧ (cf‘(ℵ‘𝑦)) = (ℵ‘𝑦))} = ∩ {𝑦 ∈ On ∣ (∅ ∈ 𝑦 ∧ 𝐴 ≼ (ℵ‘𝑦) ∧ (cf‘(ℵ‘𝑦)) = (ℵ‘𝑦))})
1918eqeq2d 2774 . . 3 (𝐴 ∈ (ran card ∖ ω) → (𝑥 = ∩ {𝑦 ∈ On ∣ (∅ ∈ 𝑦 ∧ 𝐴 ⊆ (ℵ‘𝑦) ∧ (cf‘(ℵ‘𝑦)) = (ℵ‘𝑦))} ↔ 𝑥 = ∩ {𝑦 ∈ On ∣ (∅ ∈ 𝑦 ∧ 𝐴 ≼ (ℵ‘𝑦) ∧ (cf‘(ℵ‘𝑦)) = (ℵ‘𝑦))}))
2019rexbidv 3190 . 2 (𝐴 ∈ (ran card ∖ ω) → (∃𝑥 ∈ On 𝑥 = ∩ {𝑦 ∈ On ∣ (∅ ∈ 𝑦 ∧ 𝐴 ⊆ (ℵ‘𝑦) ∧ (cf‘(ℵ‘𝑦)) = (ℵ‘𝑦))} ↔ ∃𝑥 ∈ On 𝑥 = ∩ {𝑦 ∈ On ∣ (∅ ∈ 𝑦 ∧ 𝐴 ≼ (ℵ‘𝑦) ∧ (cf‘(ℵ‘𝑦)) = (ℵ‘𝑦))}))
211, 20mpbid 235 1 (𝐴 ∈ (ran card ∖ ω) → ∃𝑥 ∈ On 𝑥 = ∩ {𝑦 ∈ On ∣ (∅ ∈ 𝑦 ∧ 𝐴 ≼ (ℵ‘𝑦) ∧ (cf‘(ℵ‘𝑦)) = (ℵ‘𝑦))})
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147  ∃wrex 3090  {crab 3416   ⊆ wss 3900   ∖ cdif 4048  ∅c0 4281  ∩ cint 4910   class class class wbr 5106  dom cdm 5655  ran crn 5656  Oncon0 6377  ‘cfv 6555  ωcom 7898   ≼ cdom 8996  cardccrd 10040  ℵcale 10041  cfccf 10042
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7772  ax-inf2 9666  ax-ac2 10565
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-int 4911  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-tr 5216  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-se 5609  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6319  df-ord 6380  df-on 6381  df-lim 6382  df-suc 6383  df-iota 6509  df-fun 6557  df-fn 6558  df-f 6559  df-f1 6560  df-fo 6561  df-f1o 6562  df-fv 6563  df-isom 6564  df-riota 7397  df-ov 7443  df-oprab 7444  df-mpo 7445  df-om 7899  df-1st 8022  df-2nd 8023  df-frecs 8324  df-wrecs 8355  df-recs 8404  df-rdg 8443  df-1o 8501  df-er 8742  df-map 8874  df-en 8999  df-dom 9000  df-sdom 9001  df-fin 9002  df-oi 9528  df-har 9575  df-card 10044  df-aleph 10045  df-cf 10046  df-acn 10047  df-ac 10219
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator