| 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 8110 | . . . . 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 9562 | . . . . . . 7 ⊢ (𝜑 → (𝐹 ∈ 𝑆 ↔ (𝐹:𝐵⟶𝐴 ∧ 𝐹 finSupp ∅))) |
| 7 | 2, 6 | mpbid 232 | . . . . . 6 ⊢ (𝜑 → (𝐹:𝐵⟶𝐴 ∧ 𝐹 finSupp ∅)) |
| 8 | 7 | simpld 494 | . . . . 5 ⊢ (𝜑 → 𝐹:𝐵⟶𝐴) |
| 9 | 1, 8 | fssdm 6671 | . . . 4 ⊢ (𝜑 → (𝐹 supp ∅) ⊆ 𝐵) |
| 10 | onss 7721 | . . . . 5 ⊢ (𝐵 ∈ On → 𝐵 ⊆ On) | |
| 11 | 5, 10 | syl 17 | . . . 4 ⊢ (𝜑 → 𝐵 ⊆ On) |
| 12 | 9, 11 | sstrd 3946 | . . 3 ⊢ (𝜑 → (𝐹 supp ∅) ⊆ On) |
| 13 | epweon 7711 | . . 3 ⊢ E We On | |
| 14 | wess 5605 | . . 3 ⊢ ((𝐹 supp ∅) ⊆ On → ( E We On → E We (𝐹 supp ∅))) | |
| 15 | 12, 13, 14 | mpisyl 21 | . 2 ⊢ (𝜑 → E We (𝐹 supp ∅)) |
| 16 | ovexd 7384 | . . . . 5 ⊢ (𝜑 → (𝐹 supp ∅) ∈ V) | |
| 17 | cantnfcl.g | . . . . . 6 ⊢ 𝐺 = OrdIso( E , (𝐹 supp ∅)) | |
| 18 | 17 | oion 9428 | . . . . 5 ⊢ ((𝐹 supp ∅) ∈ V → dom 𝐺 ∈ On) |
| 19 | 16, 18 | syl 17 | . . . 4 ⊢ (𝜑 → dom 𝐺 ∈ On) |
| 20 | 7 | simprd 495 | . . . . . 6 ⊢ (𝜑 → 𝐹 finSupp ∅) |
| 21 | 20 | fsuppimpd 9259 | . . . . 5 ⊢ (𝜑 → (𝐹 supp ∅) ∈ Fin) |
| 22 | 17 | oien 9430 | . . . . . 6 ⊢ (((𝐹 supp ∅) ∈ V ∧ E We (𝐹 supp ∅)) → dom 𝐺 ≈ (𝐹 supp ∅)) |
| 23 | 16, 15, 22 | syl2anc 584 | . . . . 5 ⊢ (𝜑 → dom 𝐺 ≈ (𝐹 supp ∅)) |
| 24 | enfii 9100 | . . . . 5 ⊢ (((𝐹 supp ∅) ∈ Fin ∧ dom 𝐺 ≈ (𝐹 supp ∅)) → dom 𝐺 ∈ Fin) | |
| 25 | 21, 23, 24 | syl2anc 584 | . . . 4 ⊢ (𝜑 → dom 𝐺 ∈ Fin) |
| 26 | 19, 25 | elind 4151 | . . 3 ⊢ (𝜑 → dom 𝐺 ∈ (On ∩ Fin)) |
| 27 | onfin2 9130 | . . 3 ⊢ ω = (On ∩ Fin) | |
| 28 | 26, 27 | eleqtrrdi 2839 | . 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 1540 ∈ wcel 2109 Vcvv 3436 ∩ cin 3902 ⊆ wss 3903 ∅c0 4284 class class class wbr 5092 E cep 5518 We wwe 5571 dom cdm 5619 Oncon0 6307 ⟶wf 6478 (class class class)co 7349 ωcom 7799 supp csupp 8093 ≈ cen 8869 Fincfn 8872 finSupp cfsupp 9251 OrdIsocoi 9401 CNF ccnf 9557 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-rep 5218 ax-sep 5235 ax-nul 5245 ax-pow 5304 ax-pr 5371 ax-un 7671 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-ral 3045 df-rex 3054 df-rmo 3343 df-reu 3344 df-rab 3395 df-v 3438 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4285 df-if 4477 df-pw 4553 df-sn 4578 df-pr 4580 df-op 4584 df-uni 4859 df-iun 4943 df-br 5093 df-opab 5155 df-mpt 5174 df-tr 5200 df-id 5514 df-eprel 5519 df-po 5527 df-so 5528 df-fr 5572 df-se 5573 df-we 5574 df-xp 5625 df-rel 5626 df-cnv 5627 df-co 5628 df-dm 5629 df-rn 5630 df-res 5631 df-ima 5632 df-pred 6249 df-ord 6310 df-on 6311 df-lim 6312 df-suc 6313 df-iota 6438 df-fun 6484 df-fn 6485 df-f 6486 df-f1 6487 df-fo 6488 df-f1o 6489 df-fv 6490 df-isom 6491 df-riota 7306 df-ov 7352 df-oprab 7353 df-mpo 7354 df-om 7800 df-2nd 7925 df-supp 8094 df-frecs 8214 df-wrecs 8245 df-recs 8294 df-rdg 8332 df-seqom 8370 df-1o 8388 df-map 8755 df-en 8873 df-dom 8874 df-sdom 8875 df-fin 8876 df-fsupp 9252 df-oi 9402 df-cnf 9558 |
| This theorem is referenced by: cantnfval2 9565 cantnfle 9567 cantnflt 9568 cantnflt2 9569 cantnff 9570 cantnfp1lem2 9575 cantnfp1lem3 9576 cantnflem1b 9582 cantnflem1d 9584 cantnflem1 9585 cnfcomlem 9595 cnfcom 9596 cnfcom2lem 9597 cnfcom3lem 9599 |
| Copyright terms: Public domain | W3C validator |