Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > cfslbn | Structured version Visualization version GIF version |
Description: Any subset of 𝐴 smaller than its cofinality has union less than 𝐴. (This is the contrapositive to cfslb 9682.) (Contributed by Mario Carneiro, 24-Jun-2013.) |
Ref | Expression |
---|---|
cfslb.1 | ⊢ 𝐴 ∈ V |
Ref | Expression |
---|---|
cfslbn | ⊢ ((Lim 𝐴 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐵 ≺ (cf‘𝐴)) → ∪ 𝐵 ∈ 𝐴) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | uniss 4852 | . . . . . . . 8 ⊢ (𝐵 ⊆ 𝐴 → ∪ 𝐵 ⊆ ∪ 𝐴) | |
2 | limuni 6245 | . . . . . . . . 9 ⊢ (Lim 𝐴 → 𝐴 = ∪ 𝐴) | |
3 | 2 | sseq2d 3998 | . . . . . . . 8 ⊢ (Lim 𝐴 → (∪ 𝐵 ⊆ 𝐴 ↔ ∪ 𝐵 ⊆ ∪ 𝐴)) |
4 | 1, 3 | syl5ibr 248 | . . . . . . 7 ⊢ (Lim 𝐴 → (𝐵 ⊆ 𝐴 → ∪ 𝐵 ⊆ 𝐴)) |
5 | 4 | imp 409 | . . . . . 6 ⊢ ((Lim 𝐴 ∧ 𝐵 ⊆ 𝐴) → ∪ 𝐵 ⊆ 𝐴) |
6 | limord 6244 | . . . . . . . . . . . 12 ⊢ (Lim 𝐴 → Ord 𝐴) | |
7 | ordsson 7498 | . . . . . . . . . . . 12 ⊢ (Ord 𝐴 → 𝐴 ⊆ On) | |
8 | 6, 7 | syl 17 | . . . . . . . . . . 11 ⊢ (Lim 𝐴 → 𝐴 ⊆ On) |
9 | sstr2 3973 | . . . . . . . . . . 11 ⊢ (𝐵 ⊆ 𝐴 → (𝐴 ⊆ On → 𝐵 ⊆ On)) | |
10 | 8, 9 | syl5com 31 | . . . . . . . . . 10 ⊢ (Lim 𝐴 → (𝐵 ⊆ 𝐴 → 𝐵 ⊆ On)) |
11 | ssorduni 7494 | . . . . . . . . . 10 ⊢ (𝐵 ⊆ On → Ord ∪ 𝐵) | |
12 | 10, 11 | syl6 35 | . . . . . . . . 9 ⊢ (Lim 𝐴 → (𝐵 ⊆ 𝐴 → Ord ∪ 𝐵)) |
13 | 12, 6 | jctird 529 | . . . . . . . 8 ⊢ (Lim 𝐴 → (𝐵 ⊆ 𝐴 → (Ord ∪ 𝐵 ∧ Ord 𝐴))) |
14 | ordsseleq 6214 | . . . . . . . 8 ⊢ ((Ord ∪ 𝐵 ∧ Ord 𝐴) → (∪ 𝐵 ⊆ 𝐴 ↔ (∪ 𝐵 ∈ 𝐴 ∨ ∪ 𝐵 = 𝐴))) | |
15 | 13, 14 | syl6 35 | . . . . . . 7 ⊢ (Lim 𝐴 → (𝐵 ⊆ 𝐴 → (∪ 𝐵 ⊆ 𝐴 ↔ (∪ 𝐵 ∈ 𝐴 ∨ ∪ 𝐵 = 𝐴)))) |
16 | 15 | imp 409 | . . . . . 6 ⊢ ((Lim 𝐴 ∧ 𝐵 ⊆ 𝐴) → (∪ 𝐵 ⊆ 𝐴 ↔ (∪ 𝐵 ∈ 𝐴 ∨ ∪ 𝐵 = 𝐴))) |
17 | 5, 16 | mpbid 234 | . . . . 5 ⊢ ((Lim 𝐴 ∧ 𝐵 ⊆ 𝐴) → (∪ 𝐵 ∈ 𝐴 ∨ ∪ 𝐵 = 𝐴)) |
18 | 17 | ord 860 | . . . 4 ⊢ ((Lim 𝐴 ∧ 𝐵 ⊆ 𝐴) → (¬ ∪ 𝐵 ∈ 𝐴 → ∪ 𝐵 = 𝐴)) |
19 | cfslb.1 | . . . . . . 7 ⊢ 𝐴 ∈ V | |
20 | 19 | cfslb 9682 | . . . . . 6 ⊢ ((Lim 𝐴 ∧ 𝐵 ⊆ 𝐴 ∧ ∪ 𝐵 = 𝐴) → (cf‘𝐴) ≼ 𝐵) |
21 | domnsym 8637 | . . . . . 6 ⊢ ((cf‘𝐴) ≼ 𝐵 → ¬ 𝐵 ≺ (cf‘𝐴)) | |
22 | 20, 21 | syl 17 | . . . . 5 ⊢ ((Lim 𝐴 ∧ 𝐵 ⊆ 𝐴 ∧ ∪ 𝐵 = 𝐴) → ¬ 𝐵 ≺ (cf‘𝐴)) |
23 | 22 | 3expia 1117 | . . . 4 ⊢ ((Lim 𝐴 ∧ 𝐵 ⊆ 𝐴) → (∪ 𝐵 = 𝐴 → ¬ 𝐵 ≺ (cf‘𝐴))) |
24 | 18, 23 | syld 47 | . . 3 ⊢ ((Lim 𝐴 ∧ 𝐵 ⊆ 𝐴) → (¬ ∪ 𝐵 ∈ 𝐴 → ¬ 𝐵 ≺ (cf‘𝐴))) |
25 | 24 | con4d 115 | . 2 ⊢ ((Lim 𝐴 ∧ 𝐵 ⊆ 𝐴) → (𝐵 ≺ (cf‘𝐴) → ∪ 𝐵 ∈ 𝐴)) |
26 | 25 | 3impia 1113 | 1 ⊢ ((Lim 𝐴 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐵 ≺ (cf‘𝐴)) → ∪ 𝐵 ∈ 𝐴) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 208 ∧ wa 398 ∨ wo 843 ∧ w3a 1083 = wceq 1533 ∈ wcel 2110 Vcvv 3494 ⊆ wss 3935 ∪ cuni 4831 class class class wbr 5058 Ord word 6184 Oncon0 6185 Lim wlim 6186 ‘cfv 6349 ≼ cdom 8501 ≺ csdm 8502 cfccf 9360 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-rep 5182 ax-sep 5195 ax-nul 5202 ax-pow 5258 ax-pr 5321 ax-un 7455 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-ral 3143 df-rex 3144 df-reu 3145 df-rmo 3146 df-rab 3147 df-v 3496 df-sbc 3772 df-csb 3883 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-pss 3953 df-nul 4291 df-if 4467 df-pw 4540 df-sn 4561 df-pr 4563 df-tp 4565 df-op 4567 df-uni 4832 df-int 4869 df-iun 4913 df-iin 4914 df-br 5059 df-opab 5121 df-mpt 5139 df-tr 5165 df-id 5454 df-eprel 5459 df-po 5468 df-so 5469 df-fr 5508 df-se 5509 df-we 5510 df-xp 5555 df-rel 5556 df-cnv 5557 df-co 5558 df-dm 5559 df-rn 5560 df-res 5561 df-ima 5562 df-pred 6142 df-ord 6188 df-on 6189 df-lim 6190 df-suc 6191 df-iota 6308 df-fun 6351 df-fn 6352 df-f 6353 df-f1 6354 df-fo 6355 df-f1o 6356 df-fv 6357 df-isom 6358 df-riota 7108 df-wrecs 7941 df-recs 8002 df-er 8283 df-en 8504 df-dom 8505 df-sdom 8506 df-card 9362 df-cf 9364 |
This theorem is referenced by: cfslb2n 9684 |
Copyright terms: Public domain | W3C validator |