| 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 8172 | . . . . 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 9634 | . . . . . . 7 ⊢ (𝜑 → (𝐹 ∈ 𝑆 ↔ (𝐹:𝐵⟶𝐴 ∧ 𝐹 finSupp ∅))) |
| 7 | 2, 6 | mpbid 235 | . . . . . 6 ⊢ (𝜑 → (𝐹:𝐵⟶𝐴 ∧ 𝐹 finSupp ∅)) |
| 8 | 7 | simpld 499 | . . . . 5 ⊢ (𝜑 → 𝐹:𝐵⟶𝐴) |
| 9 | 1, 8 | fssdm 6726 | . . . 4 ⊢ (𝜑 → (𝐹 supp ∅) ⊆ 𝐵) |
| 10 | onss 7783 | . . . . 5 ⊢ (𝐵 ∈ On → 𝐵 ⊆ On) | |
| 11 | 5, 10 | syl 18 | . . . 4 ⊢ (𝜑 → 𝐵 ⊆ On) |
| 12 | 9, 11 | sstrd 3955 | . . 3 ⊢ (𝜑 → (𝐹 supp ∅) ⊆ On) |
| 13 | epweon 7773 | . . 3 ⊢ E We On | |
| 14 | wess 5648 | . . 3 ⊢ ((𝐹 supp ∅) ⊆ On → ( E We On → E We (𝐹 supp ∅))) | |
| 15 | 12, 13, 14 | mpisyl 22 | . 2 ⊢ (𝜑 → E We (𝐹 supp ∅)) |
| 16 | ovexd 7446 | . . . . 5 ⊢ (𝜑 → (𝐹 supp ∅) ∈ V) | |
| 17 | cantnfcl.g | . . . . . 6 ⊢ 𝐺 = OrdIso( E , (𝐹 supp ∅)) | |
| 18 | 17 | oion 9497 | . . . . 5 ⊢ ((𝐹 supp ∅) ∈ V → dom 𝐺 ∈ On) |
| 19 | 16, 18 | syl 18 | . . . 4 ⊢ (𝜑 → dom 𝐺 ∈ On) |
| 20 | 7 | simprd 500 | . . . . . 6 ⊢ (𝜑 → 𝐹 finSupp ∅) |
| 21 | 20 | fsuppimpd 9328 | . . . . 5 ⊢ (𝜑 → (𝐹 supp ∅) ∈ Fin) |
| 22 | 17 | oien 9499 | . . . . . 6 ⊢ (((𝐹 supp ∅) ∈ V ∧ E We (𝐹 supp ∅)) → dom 𝐺 ≈ (𝐹 supp ∅)) |
| 23 | 16, 15, 22 | syl2anc 595 | . . . . 5 ⊢ (𝜑 → dom 𝐺 ≈ (𝐹 supp ∅)) |
| 24 | enfii 9169 | . . . . 5 ⊢ (((𝐹 supp ∅) ∈ Fin ∧ dom 𝐺 ≈ (𝐹 supp ∅)) → dom 𝐺 ∈ Fin) | |
| 25 | 21, 23, 24 | syl2anc 595 | . . . 4 ⊢ (𝜑 → dom 𝐺 ∈ Fin) |
| 26 | 19, 25 | elind 4161 | . . 3 ⊢ (𝜑 → dom 𝐺 ∈ (On ∩ Fin)) |
| 27 | onfin2 9200 | . . 3 ⊢ ω = (On ∩ Fin) | |
| 28 | 26, 27 | eleqtrrdi 2880 | . 2 ⊢ (𝜑 → dom 𝐺 ∈ ω) |
| 29 | 15, 28 | jca 520 | 1 ⊢ (𝜑 → ( E We (𝐹 supp ∅) ∧ dom 𝐺 ∈ ω)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 = wceq 1567 ∈ wcel 2149 Vcvv 3463 ∩ cin 3912 ⊆ wss 3913 ∅c0 4294 class class class wbr 5113 E cep 5561 We wwe 5614 dom cdm 5662 Oncon0 6361 ⟶wf 6533 (class class class)co 7411 ωcom 7861 supp csupp 8155 ≈ cen 8939 Fincfn 8942 finSupp cfsupp 9320 OrdIsocoi 9470 CNF ccnf 9629 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-rep 5242 ax-sep 5261 ax-nul 5271 ax-pow 5337 ax-pr 5405 ax-un 7733 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-ral 3086 df-rex 3096 df-rmo 3376 df-reu 3377 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-pss 3933 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4877 df-iun 4962 df-br 5114 df-opab 5178 df-mpt 5197 df-tr 5223 df-id 5557 df-eprel 5562 df-po 5570 df-so 5571 df-fr 5615 df-se 5616 df-we 5617 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-res 5674 df-ima 5675 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-isom 6546 df-riota 7368 df-ov 7414 df-oprab 7415 df-mpo 7416 df-om 7862 df-2nd 7986 df-supp 8156 df-frecs 8277 df-wrecs 8308 df-recs 8357 df-rdg 8396 df-seqom 8434 df-1o 8452 df-map 8825 df-en 8943 df-dom 8944 df-sdom 8945 df-fin 8946 df-fsupp 9321 df-oi 9471 df-cnf 9630 |
| This theorem is referenced by: cantnfval2 9637 cantnfle 9639 cantnflt 9640 cantnflt2 9641 cantnff 9642 cantnfp1lem2 9647 cantnfp1lem3 9648 cantnflem1b 9654 cantnflem1d 9656 cantnflem1 9657 cnfcomlem 9667 cnfcom 9668 cnfcom2lem 9669 cnfcom3lem 9671 |
| Copyright terms: Public domain | W3C validator |