Theorem coflim 10240

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

Step	Hyp	Ref	Expression
1		eleq2 2852	. . . . 5 ⊢ (∪ 𝐵 = 𝐴 → (𝑥 ∈ ∪ 𝐵 ↔ 𝑥 ∈ 𝐴))
2	1	biimprd 251	. . . 4 ⊢ (∪ 𝐵 = 𝐴 → (𝑥 ∈ 𝐴 → 𝑥 ∈ ∪ 𝐵))
3		eluni2 4876	. . . . 5 ⊢ (𝑥 ∈ ∪ 𝐵 ↔ ∃𝑦 ∈ 𝐵 𝑥 ∈ 𝑦)
4		limord 6422	. . . . . . . . 9 ⊢ (Lim 𝐴 → Ord 𝐴)
5		ssel2 3932	. . . . . . . . 9 ⊢ ((𝐵 ⊆ 𝐴 ∧ 𝑦 ∈ 𝐵) → 𝑦 ∈ 𝐴)
6		ordelon 6384	. . . . . . . . 9 ⊢ ((Ord 𝐴 ∧ 𝑦 ∈ 𝐴) → 𝑦 ∈ On)
7	4, 5, 6	syl2an 607	. . . . . . . 8 ⊢ ((Lim 𝐴 ∧ (𝐵 ⊆ 𝐴 ∧ 𝑦 ∈ 𝐵)) → 𝑦 ∈ On)
8	7	expr 461	. . . . . . 7 ⊢ ((Lim 𝐴 ∧ 𝐵 ⊆ 𝐴) → (𝑦 ∈ 𝐵 → 𝑦 ∈ On))
9		onelss 6403	. . . . . . 7 ⊢ (𝑦 ∈ On → (𝑥 ∈ 𝑦 → 𝑥 ⊆ 𝑦))
10	8, 9	syl6 36	. . . . . 6 ⊢ ((Lim 𝐴 ∧ 𝐵 ⊆ 𝐴) → (𝑦 ∈ 𝐵 → (𝑥 ∈ 𝑦 → 𝑥 ⊆ 𝑦)))
11	10	reximdvai 3176	. . . . 5 ⊢ ((Lim 𝐴 ∧ 𝐵 ⊆ 𝐴) → (∃𝑦 ∈ 𝐵 𝑥 ∈ 𝑦 → ∃𝑦 ∈ 𝐵 𝑥 ⊆ 𝑦))
12	3, 11	biimtrid 245	. . . 4 ⊢ ((Lim 𝐴 ∧ 𝐵 ⊆ 𝐴) → (𝑥 ∈ ∪ 𝐵 → ∃𝑦 ∈ 𝐵 𝑥 ⊆ 𝑦))
13	2, 12	syl9r 79	. . 3 ⊢ ((Lim 𝐴 ∧ 𝐵 ⊆ 𝐴) → (∪ 𝐵 = 𝐴 → (𝑥 ∈ 𝐴 → ∃𝑦 ∈ 𝐵 𝑥 ⊆ 𝑦)))
14	13	ralrimdv 3163	. 2 ⊢ ((Lim 𝐴 ∧ 𝐵 ⊆ 𝐴) → (∪ 𝐵 = 𝐴 → ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑥 ⊆ 𝑦))
15		uniss 4880	. . . . . 6 ⊢ (𝐵 ⊆ 𝐴 → ∪ 𝐵 ⊆ ∪ 𝐴)
16	15	3ad2ant2 1152	. . . . 5 ⊢ ((Lim 𝐴 ∧ 𝐵 ⊆ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑥 ⊆ 𝑦) → ∪ 𝐵 ⊆ ∪ 𝐴)
17		uniss2 4907	. . . . . 6 ⊢ (∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑥 ⊆ 𝑦 → ∪ 𝐴 ⊆ ∪ 𝐵)
18	17	3ad2ant3 1153	. . . . 5 ⊢ ((Lim 𝐴 ∧ 𝐵 ⊆ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑥 ⊆ 𝑦) → ∪ 𝐴 ⊆ ∪ 𝐵)
19	16, 18	eqssd 3954	. . . 4 ⊢ ((Lim 𝐴 ∧ 𝐵 ⊆ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑥 ⊆ 𝑦) → ∪ 𝐵 = ∪ 𝐴)
20		limuni 6423	. . . . 5 ⊢ (Lim 𝐴 → 𝐴 = ∪ 𝐴)
21	20	3ad2ant1 1151	. . . 4 ⊢ ((Lim 𝐴 ∧ 𝐵 ⊆ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑥 ⊆ 𝑦) → 𝐴 = ∪ 𝐴)
22	19, 21	eqtr4d 2801	. . 3 ⊢ ((Lim 𝐴 ∧ 𝐵 ⊆ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑥 ⊆ 𝑦) → ∪ 𝐵 = 𝐴)
23	22	3expia 1139	. 2 ⊢ ((Lim 𝐴 ∧ 𝐵 ⊆ 𝐴) → (∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑥 ⊆ 𝑦 → ∪ 𝐵 = 𝐴))
24	14, 23	impbid 215	1 ⊢ ((Lim 𝐴 ∧ 𝐵 ⊆ 𝐴) → (∪ 𝐵 = 𝐴 ↔ ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑥 ⊆ 𝑦))

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 400   ∧ w3a 1103   = wceq 1570   ∈ wcel 2143  ∀wral 3079  ∃wrex 3089   ⊆ wss 3905  ∪ cuni 4872  Ord word 6359  Oncon0 6360  Lim wlim 6361

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-ext 2735  ax-sep 5257  ax-pr 5404

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-sb 2097  df-clab 2742  df-cleq 2755  df-clel 2838  df-ne 2959  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-br 5110  df-opab 5174  df-tr 5219  df-eprel 5561  df-po 5569  df-so 5570  df-fr 5614  df-we 5616  df-ord 6363  df-on 6364  df-lim 6365

This theorem is referenced by:  cflim3  10241  pwcfsdom  10563