| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > cantnfcl | Structured version Visualization version GIF version | ||
| Description: Basic properties of the order isomorphism 𝐺 used later. The support of an 𝐹 ∈ 𝑆 is a finite subset of 𝐴, so it is well-ordered by E and the order isomorphism has domain a finite ordinal. (Contributed by Mario Carneiro, 25-May-2015.) (Revised by AV, 28-Jun-2019.) |
| Ref | Expression |
|---|---|
| cantnfs.s | ⊢ 𝑆 = dom (𝐴 CNF 𝐵) |
| cantnfs.a | ⊢ (𝜑 → 𝐴 ∈ On) |
| cantnfs.b | ⊢ (𝜑 → 𝐵 ∈ On) |
| cantnfcl.g | ⊢ 𝐺 = OrdIso( E , (𝐹 supp ∅)) |
| cantnfcl.f | ⊢ (𝜑 → 𝐹 ∈ 𝑆) |
| Ref | Expression |
|---|---|
| cantnfcl | ⊢ (𝜑 → ( E We (𝐹 supp ∅) ∧ dom 𝐺 ∈ ω)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | suppssdm 8121 | . . . . 5 ⊢ (𝐹 supp ∅) ⊆ dom 𝐹 | |
| 2 | cantnfcl.f | . . . . . . 7 ⊢ (𝜑 → 𝐹 ∈ 𝑆) | |
| 3 | cantnfs.s | . . . . . . . 8 ⊢ 𝑆 = dom (𝐴 CNF 𝐵) | |
| 4 | cantnfs.a | . . . . . . . 8 ⊢ (𝜑 → 𝐴 ∈ On) | |
| 5 | cantnfs.b | . . . . . . . 8 ⊢ (𝜑 → 𝐵 ∈ On) | |
| 6 | 3, 4, 5 | cantnfs 9581 | . . . . . . 7 ⊢ (𝜑 → (𝐹 ∈ 𝑆 ↔ (𝐹:𝐵⟶𝐴 ∧ 𝐹 finSupp ∅))) |
| 7 | 2, 6 | mpbid 232 | . . . . . 6 ⊢ (𝜑 → (𝐹:𝐵⟶𝐴 ∧ 𝐹 finSupp ∅)) |
| 8 | 7 | simpld 494 | . . . . 5 ⊢ (𝜑 → 𝐹:𝐵⟶𝐴) |
| 9 | 1, 8 | fssdm 6682 | . . . 4 ⊢ (𝜑 → (𝐹 supp ∅) ⊆ 𝐵) |
| 10 | onss 7733 | . . . . 5 ⊢ (𝐵 ∈ On → 𝐵 ⊆ On) | |
| 11 | 5, 10 | syl 17 | . . . 4 ⊢ (𝜑 → 𝐵 ⊆ On) |
| 12 | 9, 11 | sstrd 3933 | . . 3 ⊢ (𝜑 → (𝐹 supp ∅) ⊆ On) |
| 13 | epweon 7723 | . . 3 ⊢ E We On | |
| 14 | wess 5611 | . . 3 ⊢ ((𝐹 supp ∅) ⊆ On → ( E We On → E We (𝐹 supp ∅))) | |
| 15 | 12, 13, 14 | mpisyl 21 | . 2 ⊢ (𝜑 → E We (𝐹 supp ∅)) |
| 16 | ovexd 7396 | . . . . 5 ⊢ (𝜑 → (𝐹 supp ∅) ∈ V) | |
| 17 | cantnfcl.g | . . . . . 6 ⊢ 𝐺 = OrdIso( E , (𝐹 supp ∅)) | |
| 18 | 17 | oion 9445 | . . . . 5 ⊢ ((𝐹 supp ∅) ∈ V → dom 𝐺 ∈ On) |
| 19 | 16, 18 | syl 17 | . . . 4 ⊢ (𝜑 → dom 𝐺 ∈ On) |
| 20 | 7 | simprd 495 | . . . . . 6 ⊢ (𝜑 → 𝐹 finSupp ∅) |
| 21 | 20 | fsuppimpd 9276 | . . . . 5 ⊢ (𝜑 → (𝐹 supp ∅) ∈ Fin) |
| 22 | 17 | oien 9447 | . . . . . 6 ⊢ (((𝐹 supp ∅) ∈ V ∧ E We (𝐹 supp ∅)) → dom 𝐺 ≈ (𝐹 supp ∅)) |
| 23 | 16, 15, 22 | syl2anc 585 | . . . . 5 ⊢ (𝜑 → dom 𝐺 ≈ (𝐹 supp ∅)) |
| 24 | enfii 9114 | . . . . 5 ⊢ (((𝐹 supp ∅) ∈ Fin ∧ dom 𝐺 ≈ (𝐹 supp ∅)) → dom 𝐺 ∈ Fin) | |
| 25 | 21, 23, 24 | syl2anc 585 | . . . 4 ⊢ (𝜑 → dom 𝐺 ∈ Fin) |
| 26 | 19, 25 | elind 4141 | . . 3 ⊢ (𝜑 → dom 𝐺 ∈ (On ∩ Fin)) |
| 27 | onfin2 9145 | . . 3 ⊢ ω = (On ∩ Fin) | |
| 28 | 26, 27 | eleqtrrdi 2848 | . 2 ⊢ (𝜑 → dom 𝐺 ∈ ω) |
| 29 | 15, 28 | jca 511 | 1 ⊢ (𝜑 → ( E We (𝐹 supp ∅) ∧ dom 𝐺 ∈ ω)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 Vcvv 3430 ∩ cin 3889 ⊆ wss 3890 ∅c0 4274 class class class wbr 5086 E cep 5524 We wwe 5577 dom cdm 5625 Oncon0 6318 ⟶wf 6489 (class class class)co 7361 ωcom 7811 supp csupp 8104 ≈ cen 8884 Fincfn 8887 finSupp cfsupp 9268 OrdIsocoi 9418 CNF ccnf 9576 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5213 ax-sep 5232 ax-nul 5242 ax-pow 5303 ax-pr 5371 ax-un 7683 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3063 df-rmo 3343 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5520 df-eprel 5525 df-po 5533 df-so 5534 df-fr 5578 df-se 5579 df-we 5580 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-pred 6260 df-ord 6321 df-on 6322 df-lim 6323 df-suc 6324 df-iota 6449 df-fun 6495 df-fn 6496 df-f 6497 df-f1 6498 df-fo 6499 df-f1o 6500 df-fv 6501 df-isom 6502 df-riota 7318 df-ov 7364 df-oprab 7365 df-mpo 7366 df-om 7812 df-2nd 7937 df-supp 8105 df-frecs 8225 df-wrecs 8256 df-recs 8305 df-rdg 8343 df-seqom 8381 df-1o 8399 df-map 8769 df-en 8888 df-dom 8889 df-sdom 8890 df-fin 8891 df-fsupp 9269 df-oi 9419 df-cnf 9577 |
| This theorem is referenced by: cantnfval2 9584 cantnfle 9586 cantnflt 9587 cantnflt2 9588 cantnff 9589 cantnfp1lem2 9594 cantnfp1lem3 9595 cantnflem1b 9601 cantnflem1d 9603 cantnflem1 9604 cnfcomlem 9614 cnfcom 9615 cnfcom2lem 9616 cnfcom3lem 9618 |
| Copyright terms: Public domain | W3C validator |