![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > oemapwe | Structured version Visualization version GIF version |
Description: The lexicographic order on a function space of ordinals gives a well-ordering with order type equal to the ordinal exponential. This provides an alternate definition of the ordinal exponential. (Contributed by Mario Carneiro, 28-May-2015.) |
Ref | Expression |
---|---|
cantnfs.s | ⊢ 𝑆 = dom (𝐴 CNF 𝐵) |
cantnfs.a | ⊢ (𝜑 → 𝐴 ∈ On) |
cantnfs.b | ⊢ (𝜑 → 𝐵 ∈ On) |
oemapval.t | ⊢ 𝑇 = {⟨𝑥, 𝑦⟩ ∣ ∃𝑧 ∈ 𝐵 ((𝑥‘𝑧) ∈ (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐵 (𝑧 ∈ 𝑤 → (𝑥‘𝑤) = (𝑦‘𝑤)))} |
Ref | Expression |
---|---|
oemapwe | ⊢ (𝜑 → (𝑇 We 𝑆 ∧ dom OrdIso(𝑇, 𝑆) = (𝐴 ↑o 𝐵))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | cantnfs.a | . . . . 5 ⊢ (𝜑 → 𝐴 ∈ On) | |
2 | cantnfs.b | . . . . 5 ⊢ (𝜑 → 𝐵 ∈ On) | |
3 | oecl 8536 | . . . . 5 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ↑o 𝐵) ∈ On) | |
4 | 1, 2, 3 | syl2anc 584 | . . . 4 ⊢ (𝜑 → (𝐴 ↑o 𝐵) ∈ On) |
5 | eloni 6374 | . . . 4 ⊢ ((𝐴 ↑o 𝐵) ∈ On → Ord (𝐴 ↑o 𝐵)) | |
6 | ordwe 6377 | . . . 4 ⊢ (Ord (𝐴 ↑o 𝐵) → E We (𝐴 ↑o 𝐵)) | |
7 | 4, 5, 6 | 3syl 18 | . . 3 ⊢ (𝜑 → E We (𝐴 ↑o 𝐵)) |
8 | cantnfs.s | . . . . 5 ⊢ 𝑆 = dom (𝐴 CNF 𝐵) | |
9 | oemapval.t | . . . . 5 ⊢ 𝑇 = {⟨𝑥, 𝑦⟩ ∣ ∃𝑧 ∈ 𝐵 ((𝑥‘𝑧) ∈ (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐵 (𝑧 ∈ 𝑤 → (𝑥‘𝑤) = (𝑦‘𝑤)))} | |
10 | 8, 1, 2, 9 | cantnf 9687 | . . . 4 ⊢ (𝜑 → (𝐴 CNF 𝐵) Isom 𝑇, E (𝑆, (𝐴 ↑o 𝐵))) |
11 | isowe 7345 | . . . 4 ⊢ ((𝐴 CNF 𝐵) Isom 𝑇, E (𝑆, (𝐴 ↑o 𝐵)) → (𝑇 We 𝑆 ↔ E We (𝐴 ↑o 𝐵))) | |
12 | 10, 11 | syl 17 | . . 3 ⊢ (𝜑 → (𝑇 We 𝑆 ↔ E We (𝐴 ↑o 𝐵))) |
13 | 7, 12 | mpbird 256 | . 2 ⊢ (𝜑 → 𝑇 We 𝑆) |
14 | 4, 5 | syl 17 | . . . . 5 ⊢ (𝜑 → Ord (𝐴 ↑o 𝐵)) |
15 | isocnv 7326 | . . . . . 6 ⊢ ((𝐴 CNF 𝐵) Isom 𝑇, E (𝑆, (𝐴 ↑o 𝐵)) → ◡(𝐴 CNF 𝐵) Isom E , 𝑇 ((𝐴 ↑o 𝐵), 𝑆)) | |
16 | 10, 15 | syl 17 | . . . . 5 ⊢ (𝜑 → ◡(𝐴 CNF 𝐵) Isom E , 𝑇 ((𝐴 ↑o 𝐵), 𝑆)) |
17 | ovex 7441 | . . . . . . . . 9 ⊢ (𝐴 CNF 𝐵) ∈ V | |
18 | 17 | dmex 7901 | . . . . . . . 8 ⊢ dom (𝐴 CNF 𝐵) ∈ V |
19 | 8, 18 | eqeltri 2829 | . . . . . . 7 ⊢ 𝑆 ∈ V |
20 | exse 5639 | . . . . . . 7 ⊢ (𝑆 ∈ V → 𝑇 Se 𝑆) | |
21 | 19, 20 | ax-mp 5 | . . . . . 6 ⊢ 𝑇 Se 𝑆 |
22 | eqid 2732 | . . . . . . 7 ⊢ OrdIso(𝑇, 𝑆) = OrdIso(𝑇, 𝑆) | |
23 | 22 | oieu 9533 | . . . . . 6 ⊢ ((𝑇 We 𝑆 ∧ 𝑇 Se 𝑆) → ((Ord (𝐴 ↑o 𝐵) ∧ ◡(𝐴 CNF 𝐵) Isom E , 𝑇 ((𝐴 ↑o 𝐵), 𝑆)) ↔ ((𝐴 ↑o 𝐵) = dom OrdIso(𝑇, 𝑆) ∧ ◡(𝐴 CNF 𝐵) = OrdIso(𝑇, 𝑆)))) |
24 | 13, 21, 23 | sylancl 586 | . . . . 5 ⊢ (𝜑 → ((Ord (𝐴 ↑o 𝐵) ∧ ◡(𝐴 CNF 𝐵) Isom E , 𝑇 ((𝐴 ↑o 𝐵), 𝑆)) ↔ ((𝐴 ↑o 𝐵) = dom OrdIso(𝑇, 𝑆) ∧ ◡(𝐴 CNF 𝐵) = OrdIso(𝑇, 𝑆)))) |
25 | 14, 16, 24 | mpbi2and 710 | . . . 4 ⊢ (𝜑 → ((𝐴 ↑o 𝐵) = dom OrdIso(𝑇, 𝑆) ∧ ◡(𝐴 CNF 𝐵) = OrdIso(𝑇, 𝑆))) |
26 | 25 | simpld 495 | . . 3 ⊢ (𝜑 → (𝐴 ↑o 𝐵) = dom OrdIso(𝑇, 𝑆)) |
27 | 26 | eqcomd 2738 | . 2 ⊢ (𝜑 → dom OrdIso(𝑇, 𝑆) = (𝐴 ↑o 𝐵)) |
28 | 13, 27 | jca 512 | 1 ⊢ (𝜑 → (𝑇 We 𝑆 ∧ dom OrdIso(𝑇, 𝑆) = (𝐴 ↑o 𝐵))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 = wceq 1541 ∈ wcel 2106 ∀wral 3061 ∃wrex 3070 Vcvv 3474 {copab 5210 E cep 5579 Se wse 5629 We wwe 5630 ◡ccnv 5675 dom cdm 5676 Ord word 6363 Oncon0 6364 ‘cfv 6543 Isom wiso 6544 (class class class)co 7408 ↑o coe 8464 OrdIsocoi 9503 CNF ccnf 9655 |
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 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2703 ax-rep 5285 ax-sep 5299 ax-nul 5306 ax-pow 5363 ax-pr 5427 ax-un 7724 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2534 df-eu 2563 df-clab 2710 df-cleq 2724 df-clel 2810 df-nfc 2885 df-ne 2941 df-ral 3062 df-rex 3071 df-rmo 3376 df-reu 3377 df-rab 3433 df-v 3476 df-sbc 3778 df-csb 3894 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-pss 3967 df-nul 4323 df-if 4529 df-pw 4604 df-sn 4629 df-pr 4631 df-op 4635 df-uni 4909 df-int 4951 df-iun 4999 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5574 df-eprel 5580 df-po 5588 df-so 5589 df-fr 5631 df-se 5632 df-we 5633 df-xp 5682 df-rel 5683 df-cnv 5684 df-co 5685 df-dm 5686 df-rn 5687 df-res 5688 df-ima 5689 df-pred 6300 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6495 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-isom 6552 df-riota 7364 df-ov 7411 df-oprab 7412 df-mpo 7413 df-om 7855 df-1st 7974 df-2nd 7975 df-supp 8146 df-frecs 8265 df-wrecs 8296 df-recs 8370 df-rdg 8409 df-seqom 8447 df-1o 8465 df-2o 8466 df-oadd 8469 df-omul 8470 df-oexp 8471 df-er 8702 df-map 8821 df-en 8939 df-dom 8940 df-sdom 8941 df-fin 8942 df-fsupp 9361 df-oi 9504 df-cnf 9656 |
This theorem is referenced by: cantnffval2 9689 wemapwe 9691 |
Copyright terms: Public domain | W3C validator |