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 9766.) (Contributed by Mario Carneiro, 24-Jun-2013.) |
Ref | Expression |
---|---|
cfslb.1 | ⊢ 𝐴 ∈ V |
Ref | Expression |
---|---|
cfslbn | ⊢ ((Lim 𝐴 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐵 ≺ (cf‘𝐴)) → ∪ 𝐵 ∈ 𝐴) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | uniss 4804 | . . . . . . . 8 ⊢ (𝐵 ⊆ 𝐴 → ∪ 𝐵 ⊆ ∪ 𝐴) | |
2 | limuni 6232 | . . . . . . . . 9 ⊢ (Lim 𝐴 → 𝐴 = ∪ 𝐴) | |
3 | 2 | sseq2d 3909 | . . . . . . . 8 ⊢ (Lim 𝐴 → (∪ 𝐵 ⊆ 𝐴 ↔ ∪ 𝐵 ⊆ ∪ 𝐴)) |
4 | 1, 3 | syl5ibr 249 | . . . . . . 7 ⊢ (Lim 𝐴 → (𝐵 ⊆ 𝐴 → ∪ 𝐵 ⊆ 𝐴)) |
5 | 4 | imp 410 | . . . . . 6 ⊢ ((Lim 𝐴 ∧ 𝐵 ⊆ 𝐴) → ∪ 𝐵 ⊆ 𝐴) |
6 | limord 6231 | . . . . . . . . . . . 12 ⊢ (Lim 𝐴 → Ord 𝐴) | |
7 | ordsson 7523 | . . . . . . . . . . . 12 ⊢ (Ord 𝐴 → 𝐴 ⊆ On) | |
8 | 6, 7 | syl 17 | . . . . . . . . . . 11 ⊢ (Lim 𝐴 → 𝐴 ⊆ On) |
9 | sstr2 3884 | . . . . . . . . . . 11 ⊢ (𝐵 ⊆ 𝐴 → (𝐴 ⊆ On → 𝐵 ⊆ On)) | |
10 | 8, 9 | syl5com 31 | . . . . . . . . . 10 ⊢ (Lim 𝐴 → (𝐵 ⊆ 𝐴 → 𝐵 ⊆ On)) |
11 | ssorduni 7519 | . . . . . . . . . 10 ⊢ (𝐵 ⊆ On → Ord ∪ 𝐵) | |
12 | 10, 11 | syl6 35 | . . . . . . . . 9 ⊢ (Lim 𝐴 → (𝐵 ⊆ 𝐴 → Ord ∪ 𝐵)) |
13 | 12, 6 | jctird 530 | . . . . . . . 8 ⊢ (Lim 𝐴 → (𝐵 ⊆ 𝐴 → (Ord ∪ 𝐵 ∧ Ord 𝐴))) |
14 | ordsseleq 6201 | . . . . . . . 8 ⊢ ((Ord ∪ 𝐵 ∧ Ord 𝐴) → (∪ 𝐵 ⊆ 𝐴 ↔ (∪ 𝐵 ∈ 𝐴 ∨ ∪ 𝐵 = 𝐴))) | |
15 | 13, 14 | syl6 35 | . . . . . . 7 ⊢ (Lim 𝐴 → (𝐵 ⊆ 𝐴 → (∪ 𝐵 ⊆ 𝐴 ↔ (∪ 𝐵 ∈ 𝐴 ∨ ∪ 𝐵 = 𝐴)))) |
16 | 15 | imp 410 | . . . . . 6 ⊢ ((Lim 𝐴 ∧ 𝐵 ⊆ 𝐴) → (∪ 𝐵 ⊆ 𝐴 ↔ (∪ 𝐵 ∈ 𝐴 ∨ ∪ 𝐵 = 𝐴))) |
17 | 5, 16 | mpbid 235 | . . . . 5 ⊢ ((Lim 𝐴 ∧ 𝐵 ⊆ 𝐴) → (∪ 𝐵 ∈ 𝐴 ∨ ∪ 𝐵 = 𝐴)) |
18 | 17 | ord 863 | . . . 4 ⊢ ((Lim 𝐴 ∧ 𝐵 ⊆ 𝐴) → (¬ ∪ 𝐵 ∈ 𝐴 → ∪ 𝐵 = 𝐴)) |
19 | cfslb.1 | . . . . . . 7 ⊢ 𝐴 ∈ V | |
20 | 19 | cfslb 9766 | . . . . . 6 ⊢ ((Lim 𝐴 ∧ 𝐵 ⊆ 𝐴 ∧ ∪ 𝐵 = 𝐴) → (cf‘𝐴) ≼ 𝐵) |
21 | domnsym 8693 | . . . . . 6 ⊢ ((cf‘𝐴) ≼ 𝐵 → ¬ 𝐵 ≺ (cf‘𝐴)) | |
22 | 20, 21 | syl 17 | . . . . 5 ⊢ ((Lim 𝐴 ∧ 𝐵 ⊆ 𝐴 ∧ ∪ 𝐵 = 𝐴) → ¬ 𝐵 ≺ (cf‘𝐴)) |
23 | 22 | 3expia 1122 | . . . 4 ⊢ ((Lim 𝐴 ∧ 𝐵 ⊆ 𝐴) → (∪ 𝐵 = 𝐴 → ¬ 𝐵 ≺ (cf‘𝐴))) |
24 | 18, 23 | syld 47 | . . 3 ⊢ ((Lim 𝐴 ∧ 𝐵 ⊆ 𝐴) → (¬ ∪ 𝐵 ∈ 𝐴 → ¬ 𝐵 ≺ (cf‘𝐴))) |
25 | 24 | con4d 115 | . 2 ⊢ ((Lim 𝐴 ∧ 𝐵 ⊆ 𝐴) → (𝐵 ≺ (cf‘𝐴) → ∪ 𝐵 ∈ 𝐴)) |
26 | 25 | 3impia 1118 | 1 ⊢ ((Lim 𝐴 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐵 ≺ (cf‘𝐴)) → ∪ 𝐵 ∈ 𝐴) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 399 ∨ wo 846 ∧ w3a 1088 = wceq 1542 ∈ wcel 2114 Vcvv 3398 ⊆ wss 3843 ∪ cuni 4796 class class class wbr 5030 Ord word 6171 Oncon0 6172 Lim wlim 6173 ‘cfv 6339 ≼ cdom 8553 ≺ csdm 8554 cfccf 9439 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1975 ax-7 2020 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2162 ax-12 2179 ax-ext 2710 ax-rep 5154 ax-sep 5167 ax-nul 5174 ax-pow 5232 ax-pr 5296 ax-un 7479 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1787 df-nf 1791 df-sb 2075 df-mo 2540 df-eu 2570 df-clab 2717 df-cleq 2730 df-clel 2811 df-nfc 2881 df-ne 2935 df-ral 3058 df-rex 3059 df-reu 3060 df-rmo 3061 df-rab 3062 df-v 3400 df-sbc 3681 df-csb 3791 df-dif 3846 df-un 3848 df-in 3850 df-ss 3860 df-pss 3862 df-nul 4212 df-if 4415 df-pw 4490 df-sn 4517 df-pr 4519 df-tp 4521 df-op 4523 df-uni 4797 df-int 4837 df-iun 4883 df-iin 4884 df-br 5031 df-opab 5093 df-mpt 5111 df-tr 5137 df-id 5429 df-eprel 5434 df-po 5442 df-so 5443 df-fr 5483 df-se 5484 df-we 5485 df-xp 5531 df-rel 5532 df-cnv 5533 df-co 5534 df-dm 5535 df-rn 5536 df-res 5537 df-ima 5538 df-pred 6129 df-ord 6175 df-on 6176 df-lim 6177 df-suc 6178 df-iota 6297 df-fun 6341 df-fn 6342 df-f 6343 df-f1 6344 df-fo 6345 df-f1o 6346 df-fv 6347 df-isom 6348 df-riota 7127 df-wrecs 7976 df-recs 8037 df-er 8320 df-en 8556 df-dom 8557 df-sdom 8558 df-card 9441 df-cf 9443 |
This theorem is referenced by: cfslb2n 9768 |
Copyright terms: Public domain | W3C validator |