Theorem coflim 10352

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 2853	. . . . 5 ⊢ (∪ 𝐵 = 𝐴 → (𝑥 ∈ ∪ 𝐵 ↔ 𝑥 ∈ 𝐴))
2	1	biimprd 251	. . . 4 ⊢ (∪ 𝐵 = 𝐴 → (𝑥 ∈ 𝐴 → 𝑥 ∈ ∪ 𝐵))
3		eluni2 4874	. . . . 5 ⊢ (𝑥 ∈ ∪ 𝐵 ↔ ∃𝑦 ∈ 𝐵 𝑥 ∈ 𝑦)
4		limord 6431	. . . . . . . . 9 ⊢ (Lim 𝐴 → Ord 𝐴)
5		ssel2 3908	. . . . . . . . 9 ⊢ ((𝐵 ⊆ 𝐴 ∧ 𝑦 ∈ 𝐵) → 𝑦 ∈ 𝐴)
6		ordelon 6393	. . . . . . . . 9 ⊢ ((Ord 𝐴 ∧ 𝑦 ∈ 𝐴) → 𝑦 ∈ On)
7	4, 5, 6	syl2an 608	. . . . . . . 8 ⊢ ((Lim 𝐴 ∧ (𝐵 ⊆ 𝐴 ∧ 𝑦 ∈ 𝐵)) → 𝑦 ∈ On)
8	7	expr 462	. . . . . . 7 ⊢ ((Lim 𝐴 ∧ 𝐵 ⊆ 𝐴) → (𝑦 ∈ 𝐵 → 𝑦 ∈ On))
9		onelss 6412	. . . . . . 7 ⊢ (𝑦 ∈ On → (𝑥 ∈ 𝑦 → 𝑥 ⊆ 𝑦))
10	8, 9	syl6 36	. . . . . 6 ⊢ ((Lim 𝐴 ∧ 𝐵 ⊆ 𝐴) → (𝑦 ∈ 𝐵 → (𝑥 ∈ 𝑦 → 𝑥 ⊆ 𝑦)))
11	10	reximdvai 3177	. . . . 5 ⊢ ((Lim 𝐴 ∧ 𝐵 ⊆ 𝐴) → (∃𝑦 ∈ 𝐵 𝑥 ∈ 𝑦 → ∃𝑦 ∈ 𝐵 𝑥 ⊆ 𝑦))
12	3, 11	biimtrid 245	. . . 4 ⊢ ((Lim 𝐴 ∧ 𝐵 ⊆ 𝐴) → (𝑥 ∈ ∪ 𝐵 → ∃𝑦 ∈ 𝐵 𝑥 ⊆ 𝑦))
13	2, 12	syl9r 79	. . 3 ⊢ ((Lim 𝐴 ∧ 𝐵 ⊆ 𝐴) → (∪ 𝐵 = 𝐴 → (𝑥 ∈ 𝐴 → ∃𝑦 ∈ 𝐵 𝑥 ⊆ 𝑦)))
14	13	ralrimdv 3164	. 2 ⊢ ((Lim 𝐴 ∧ 𝐵 ⊆ 𝐴) → (∪ 𝐵 = 𝐴 → ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑥 ⊆ 𝑦))
15		uniss 4878	. . . . . 6 ⊢ (𝐵 ⊆ 𝐴 → ∪ 𝐵 ⊆ ∪ 𝐴)
16	15	3ad2ant2 1152	. . . . 5 ⊢ ((Lim 𝐴 ∧ 𝐵 ⊆ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑥 ⊆ 𝑦) → ∪ 𝐵 ⊆ ∪ 𝐴)
17		uniss2 4905	. . . . . 6 ⊢ (∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑥 ⊆ 𝑦 → ∪ 𝐴 ⊆ ∪ 𝐵)
18	17	3ad2ant3 1153	. . . . 5 ⊢ ((Lim 𝐴 ∧ 𝐵 ⊆ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑥 ⊆ 𝑦) → ∪ 𝐴 ⊆ ∪ 𝐵)
19	16, 18	eqssd 3930	. . . 4 ⊢ ((Lim 𝐴 ∧ 𝐵 ⊆ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑥 ⊆ 𝑦) → ∪ 𝐵 = ∪ 𝐴)
20		limuni 6432	. . . . 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 𝐴 ∧ 𝐵 ⊆ 𝐴) → (∪ 𝐵 = 𝐴 ↔ ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑥 ⊆ 𝑦))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1569   ∈ wcel 2146  ∀wral 3080  ∃wrex 3090   ⊆ wss 3900  ∪ cuni 4870  Ord word 6368  Oncon0 6369  Lim wlim 6370

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-ext 2735  ax-sep 5252  ax-pr 5395

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2101  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 4839  df-uni 4871  df-br 5107  df-opab 5171  df-tr 5216  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-ord 6372  df-on 6373  df-lim 6374

This theorem is used by:  cflim3  10353  pwcfsdom  10681