| 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 8119 | . . . . 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 9575 | . . . . . . 7 ⊢ (𝜑 → (𝐹 ∈ 𝑆 ↔ (𝐹:𝐵⟶𝐴 ∧ 𝐹 finSupp ∅))) |
| 7 | 2, 6 | mpbid 232 | . . . . . 6 ⊢ (𝜑 → (𝐹:𝐵⟶𝐴 ∧ 𝐹 finSupp ∅)) |
| 8 | 7 | simpld 494 | . . . . 5 ⊢ (𝜑 → 𝐹:𝐵⟶𝐴) |
| 9 | 1, 8 | fssdm 6681 | . . . 4 ⊢ (𝜑 → (𝐹 supp ∅) ⊆ 𝐵) |
| 10 | onss 7730 | . . . . 5 ⊢ (𝐵 ∈ On → 𝐵 ⊆ On) | |
| 11 | 5, 10 | syl 17 | . . . 4 ⊢ (𝜑 → 𝐵 ⊆ On) |
| 12 | 9, 11 | sstrd 3944 | . . 3 ⊢ (𝜑 → (𝐹 supp ∅) ⊆ On) |
| 13 | epweon 7720 | . . 3 ⊢ E We On | |
| 14 | wess 5610 | . . 3 ⊢ ((𝐹 supp ∅) ⊆ On → ( E We On → E We (𝐹 supp ∅))) | |
| 15 | 12, 13, 14 | mpisyl 21 | . 2 ⊢ (𝜑 → E We (𝐹 supp ∅)) |
| 16 | ovexd 7393 | . . . . 5 ⊢ (𝜑 → (𝐹 supp ∅) ∈ V) | |
| 17 | cantnfcl.g | . . . . . 6 ⊢ 𝐺 = OrdIso( E , (𝐹 supp ∅)) | |
| 18 | 17 | oion 9441 | . . . . 5 ⊢ ((𝐹 supp ∅) ∈ V → dom 𝐺 ∈ On) |
| 19 | 16, 18 | syl 17 | . . . 4 ⊢ (𝜑 → dom 𝐺 ∈ On) |
| 20 | 7 | simprd 495 | . . . . . 6 ⊢ (𝜑 → 𝐹 finSupp ∅) |
| 21 | 20 | fsuppimpd 9272 | . . . . 5 ⊢ (𝜑 → (𝐹 supp ∅) ∈ Fin) |
| 22 | 17 | oien 9443 | . . . . . 6 ⊢ (((𝐹 supp ∅) ∈ V ∧ E We (𝐹 supp ∅)) → dom 𝐺 ≈ (𝐹 supp ∅)) |
| 23 | 16, 15, 22 | syl2anc 584 | . . . . 5 ⊢ (𝜑 → dom 𝐺 ≈ (𝐹 supp ∅)) |
| 24 | enfii 9110 | . . . . 5 ⊢ (((𝐹 supp ∅) ∈ Fin ∧ dom 𝐺 ≈ (𝐹 supp ∅)) → dom 𝐺 ∈ Fin) | |
| 25 | 21, 23, 24 | syl2anc 584 | . . . 4 ⊢ (𝜑 → dom 𝐺 ∈ Fin) |
| 26 | 19, 25 | elind 4152 | . . 3 ⊢ (𝜑 → dom 𝐺 ∈ (On ∩ Fin)) |
| 27 | onfin2 9141 | . . 3 ⊢ ω = (On ∩ Fin) | |
| 28 | 26, 27 | eleqtrrdi 2847 | . 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 1541 ∈ wcel 2113 Vcvv 3440 ∩ cin 3900 ⊆ wss 3901 ∅c0 4285 class class class wbr 5098 E cep 5523 We wwe 5576 dom cdm 5624 Oncon0 6317 ⟶wf 6488 (class class class)co 7358 ωcom 7808 supp csupp 8102 ≈ cen 8880 Fincfn 8883 finSupp cfsupp 9264 OrdIsocoi 9414 CNF ccnf 9570 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-rep 5224 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-ral 3052 df-rex 3061 df-rmo 3350 df-reu 3351 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-pss 3921 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-iun 4948 df-br 5099 df-opab 5161 df-mpt 5180 df-tr 5206 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-se 5578 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-isom 6501 df-riota 7315 df-ov 7361 df-oprab 7362 df-mpo 7363 df-om 7809 df-2nd 7934 df-supp 8103 df-frecs 8223 df-wrecs 8254 df-recs 8303 df-rdg 8341 df-seqom 8379 df-1o 8397 df-map 8765 df-en 8884 df-dom 8885 df-sdom 8886 df-fin 8887 df-fsupp 9265 df-oi 9415 df-cnf 9571 |
| This theorem is referenced by: cantnfval2 9578 cantnfle 9580 cantnflt 9581 cantnflt2 9582 cantnff 9583 cantnfp1lem2 9588 cantnfp1lem3 9589 cantnflem1b 9595 cantnflem1d 9597 cantnflem1 9598 cnfcomlem 9608 cnfcom 9609 cnfcom2lem 9610 cnfcom3lem 9612 |
| Copyright terms: Public domain | W3C validator |