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

Theorem coflim 10378
Description: A simpler expression for the cofinality predicate, at a limit ordinal. (Contributed by Mario Carneiro, 28-Feb-2013.)
Assertion
Ref Expression
coflim ((Lim 𝐴 ∧ 𝐵 ⊆ 𝐴) → (∪ 𝐵 = 𝐴 ↔ ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑥 ⊆ 𝑦))
Distinct variable groups:   𝑥,𝐴,𝑦   𝑥,𝐵,𝑦

Proof of Theorem coflim
StepHypRef Expression
1 eleq2 2853 . . . . 5 (∪ 𝐵 = 𝐴 → (𝑥 ∈ ∪ 𝐵 ↔ 𝑥 ∈ 𝐴))
21biimprd 251 . . . 4 (∪ 𝐵 = 𝐴 → (𝑥 ∈ 𝐴 → 𝑥 ∈ ∪ 𝐵))
3 eluni2 4876 . . . . 5 (𝑥 ∈ ∪ 𝐵 ↔ ∃𝑦 ∈ 𝐵 𝑥 ∈ 𝑦)
4 limord 6450 . . . . . . . . 9 (Lim 𝐴 → Ord 𝐴)
5 ssel2 3908 . . . . . . . . 9 ((𝐵 ⊆ 𝐴 ∧ 𝑦 ∈ 𝐵) → 𝑦 ∈ 𝐴)
6 ordelon 6412 . . . . . . . . 9 ((Ord 𝐴 ∧ 𝑦 ∈ 𝐴) → 𝑦 ∈ On)
74, 5, 6syl2an 608 . . . . . . . 8 ((Lim 𝐴 ∧ (𝐵 ⊆ 𝐴 ∧ 𝑦 ∈ 𝐵)) → 𝑦 ∈ On)
87expr 462 . . . . . . 7 ((Lim 𝐴 ∧ 𝐵 ⊆ 𝐴) → (𝑦 ∈ 𝐵 → 𝑦 ∈ On))
9 onelss 6431 . . . . . . 7 (𝑦 ∈ On → (𝑥 ∈ 𝑦 → 𝑥 ⊆ 𝑦))
108, 9syl6 36 . . . . . 6 ((Lim 𝐴 ∧ 𝐵 ⊆ 𝐴) → (𝑦 ∈ 𝐵 → (𝑥 ∈ 𝑦 → 𝑥 ⊆ 𝑦)))
1110reximdvai 3177 . . . . 5 ((Lim 𝐴 ∧ 𝐵 ⊆ 𝐴) → (∃𝑦 ∈ 𝐵 𝑥 ∈ 𝑦 → ∃𝑦 ∈ 𝐵 𝑥 ⊆ 𝑦))
123, 11biimtrid 245 . . . 4 ((Lim 𝐴 ∧ 𝐵 ⊆ 𝐴) → (𝑥 ∈ ∪ 𝐵 → ∃𝑦 ∈ 𝐵 𝑥 ⊆ 𝑦))
132, 12syl9r 79 . . 3 ((Lim 𝐴 ∧ 𝐵 ⊆ 𝐴) → (∪ 𝐵 = 𝐴 → (𝑥 ∈ 𝐴 → ∃𝑦 ∈ 𝐵 𝑥 ⊆ 𝑦)))
1413ralrimdv 3164 . 2 ((Lim 𝐴 ∧ 𝐵 ⊆ 𝐴) → (∪ 𝐵 = 𝐴 → ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑥 ⊆ 𝑦))
15 uniss 4880 . . . . . 6 (𝐵 ⊆ 𝐴 → ∪ 𝐵 ⊆ ∪ 𝐴)
16153ad2ant2 1152 . . . . 5 ((Lim 𝐴 ∧ 𝐵 ⊆ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑥 ⊆ 𝑦) → ∪ 𝐵 ⊆ ∪ 𝐴)
17 uniss2 4907 . . . . . 6 (∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑥 ⊆ 𝑦 → ∪ 𝐴 ⊆ ∪ 𝐵)
18173ad2ant3 1153 . . . . 5 ((Lim 𝐴 ∧ 𝐵 ⊆ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑥 ⊆ 𝑦) → ∪ 𝐴 ⊆ ∪ 𝐵)
1916, 18eqssd 3930 . . . 4 ((Lim 𝐴 ∧ 𝐵 ⊆ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑥 ⊆ 𝑦) → ∪ 𝐵 = ∪ 𝐴)
20 limuni 6451 . . . . 5 (Lim 𝐴 → 𝐴 = ∪ 𝐴)
21203ad2ant1 1151 . . . 4 ((Lim 𝐴 ∧ 𝐵 ⊆ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑥 ⊆ 𝑦) → 𝐴 = ∪ 𝐴)
2219, 21eqtr4d 2801 . . 3 ((Lim 𝐴 ∧ 𝐵 ⊆ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑥 ⊆ 𝑦) → ∪ 𝐵 = 𝐴)
23223expia 1139 . 2 ((Lim 𝐴 ∧ 𝐵 ⊆ 𝐴) → (∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑥 ⊆ 𝑦 → ∪ 𝐵 = 𝐴))
2414, 23impbid 215 1 ((Lim 𝐴 ∧ 𝐵 ⊆ 𝐴) → (∪ 𝐵 = 𝐴 ↔ ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑥 ⊆ 𝑦))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147  ∀wral 3080  ∃wrex 3090   ⊆ wss 3900  ∪ cuni 4872  Ord word 6387  Oncon0 6388  Lim wlim 6389
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-ext 2735  ax-sep 5255  ax-pr 5398
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-tr 5219  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  df-ord 6391  df-on 6392  df-lim 6393
This theorem is used by:  cflim3  10379  pwcfsdom  10707
  Copyright terms: Public domain W3C validator