![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > oiid | Structured version Visualization version GIF version |
Description: The order type of an ordinal under the ∈ order is itself, and the order isomorphism is the identity function. (Contributed by Mario Carneiro, 26-Jun-2015.) |
Ref | Expression |
---|---|
oiid | ⊢ (Ord 𝐴 → OrdIso( E , 𝐴) = ( I ↾ 𝐴)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ordwe 6399 | . 2 ⊢ (Ord 𝐴 → E We 𝐴) | |
2 | epse 5671 | . . 3 ⊢ E Se 𝐴 | |
3 | 2 | a1i 11 | . 2 ⊢ (Ord 𝐴 → E Se 𝐴) |
4 | eqid 2735 | . . . . . 6 ⊢ OrdIso( E , 𝐴) = OrdIso( E , 𝐴) | |
5 | 4 | oiiso2 9569 | . . . . 5 ⊢ (( E We 𝐴 ∧ E Se 𝐴) → OrdIso( E , 𝐴) Isom E , E (dom OrdIso( E , 𝐴), ran OrdIso( E , 𝐴))) |
6 | 1, 2, 5 | sylancl 586 | . . . 4 ⊢ (Ord 𝐴 → OrdIso( E , 𝐴) Isom E , E (dom OrdIso( E , 𝐴), ran OrdIso( E , 𝐴))) |
7 | ordsson 7802 | . . . . . 6 ⊢ (Ord 𝐴 → 𝐴 ⊆ On) | |
8 | 4 | oismo 9578 | . . . . . 6 ⊢ (𝐴 ⊆ On → (Smo OrdIso( E , 𝐴) ∧ ran OrdIso( E , 𝐴) = 𝐴)) |
9 | 7, 8 | syl 17 | . . . . 5 ⊢ (Ord 𝐴 → (Smo OrdIso( E , 𝐴) ∧ ran OrdIso( E , 𝐴) = 𝐴)) |
10 | isoeq5 7341 | . . . . 5 ⊢ (ran OrdIso( E , 𝐴) = 𝐴 → (OrdIso( E , 𝐴) Isom E , E (dom OrdIso( E , 𝐴), ran OrdIso( E , 𝐴)) ↔ OrdIso( E , 𝐴) Isom E , E (dom OrdIso( E , 𝐴), 𝐴))) | |
11 | 9, 10 | simpl2im 503 | . . . 4 ⊢ (Ord 𝐴 → (OrdIso( E , 𝐴) Isom E , E (dom OrdIso( E , 𝐴), ran OrdIso( E , 𝐴)) ↔ OrdIso( E , 𝐴) Isom E , E (dom OrdIso( E , 𝐴), 𝐴))) |
12 | 6, 11 | mpbid 232 | . . 3 ⊢ (Ord 𝐴 → OrdIso( E , 𝐴) Isom E , E (dom OrdIso( E , 𝐴), 𝐴)) |
13 | 4 | oicl 9567 | . . . . . 6 ⊢ Ord dom OrdIso( E , 𝐴) |
14 | 13 | a1i 11 | . . . . 5 ⊢ (Ord 𝐴 → Ord dom OrdIso( E , 𝐴)) |
15 | id 22 | . . . . 5 ⊢ (Ord 𝐴 → Ord 𝐴) | |
16 | ordiso2 9553 | . . . . 5 ⊢ ((OrdIso( E , 𝐴) Isom E , E (dom OrdIso( E , 𝐴), 𝐴) ∧ Ord dom OrdIso( E , 𝐴) ∧ Ord 𝐴) → dom OrdIso( E , 𝐴) = 𝐴) | |
17 | 12, 14, 15, 16 | syl3anc 1370 | . . . 4 ⊢ (Ord 𝐴 → dom OrdIso( E , 𝐴) = 𝐴) |
18 | isoeq4 7340 | . . . 4 ⊢ (dom OrdIso( E , 𝐴) = 𝐴 → (OrdIso( E , 𝐴) Isom E , E (dom OrdIso( E , 𝐴), 𝐴) ↔ OrdIso( E , 𝐴) Isom E , E (𝐴, 𝐴))) | |
19 | 17, 18 | syl 17 | . . 3 ⊢ (Ord 𝐴 → (OrdIso( E , 𝐴) Isom E , E (dom OrdIso( E , 𝐴), 𝐴) ↔ OrdIso( E , 𝐴) Isom E , E (𝐴, 𝐴))) |
20 | 12, 19 | mpbid 232 | . 2 ⊢ (Ord 𝐴 → OrdIso( E , 𝐴) Isom E , E (𝐴, 𝐴)) |
21 | weniso 7374 | . 2 ⊢ (( E We 𝐴 ∧ E Se 𝐴 ∧ OrdIso( E , 𝐴) Isom E , E (𝐴, 𝐴)) → OrdIso( E , 𝐴) = ( I ↾ 𝐴)) | |
22 | 1, 3, 20, 21 | syl3anc 1370 | 1 ⊢ (Ord 𝐴 → OrdIso( E , 𝐴) = ( I ↾ 𝐴)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1537 ⊆ wss 3963 I cid 5582 E cep 5588 Se wse 5639 We wwe 5640 dom cdm 5689 ran crn 5690 ↾ cres 5691 Ord word 6385 Oncon0 6386 Isom wiso 6564 Smo wsmo 8384 OrdIsocoi 9547 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1908 ax-6 1965 ax-7 2005 ax-8 2108 ax-9 2116 ax-10 2139 ax-11 2155 ax-12 2175 ax-ext 2706 ax-sep 5302 ax-nul 5312 ax-pow 5371 ax-pr 5438 ax-un 7754 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1540 df-fal 1550 df-ex 1777 df-nf 1781 df-sb 2063 df-mo 2538 df-eu 2567 df-clab 2713 df-cleq 2727 df-clel 2814 df-nfc 2890 df-ne 2939 df-ral 3060 df-rex 3069 df-rmo 3378 df-reu 3379 df-rab 3434 df-v 3480 df-sbc 3792 df-csb 3909 df-dif 3966 df-un 3968 df-in 3970 df-ss 3980 df-pss 3983 df-nul 4340 df-if 4532 df-pw 4607 df-sn 4632 df-pr 4634 df-op 4638 df-uni 4913 df-iun 4998 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5583 df-eprel 5589 df-po 5597 df-so 5598 df-fr 5641 df-se 5642 df-we 5643 df-xp 5695 df-rel 5696 df-cnv 5697 df-co 5698 df-dm 5699 df-rn 5700 df-res 5701 df-ima 5702 df-pred 6323 df-ord 6389 df-on 6390 df-lim 6391 df-suc 6392 df-iota 6516 df-fun 6565 df-fn 6566 df-f 6567 df-f1 6568 df-fo 6569 df-f1o 6570 df-fv 6571 df-isom 6572 df-riota 7388 df-ov 7434 df-2nd 8014 df-frecs 8305 df-wrecs 8336 df-smo 8385 df-recs 8410 df-oi 9548 |
This theorem is referenced by: hsmexlem5 10468 |
Copyright terms: Public domain | W3C validator |