Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > ordiso | Structured version Visualization version GIF version |
Description: Order-isomorphic ordinal numbers are equal. (Contributed by Jeff Hankins, 16-Oct-2009.) (Proof shortened by Mario Carneiro, 24-Jun-2015.) |
Ref | Expression |
---|---|
ordiso | ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 = 𝐵 ↔ ∃𝑓 𝑓 Isom E , E (𝐴, 𝐵))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | resiexg 7621 | . . . . 5 ⊢ (𝐴 ∈ On → ( I ↾ 𝐴) ∈ V) | |
2 | isoid 7084 | . . . . 5 ⊢ ( I ↾ 𝐴) Isom E , E (𝐴, 𝐴) | |
3 | isoeq1 7072 | . . . . . 6 ⊢ (𝑓 = ( I ↾ 𝐴) → (𝑓 Isom E , E (𝐴, 𝐴) ↔ ( I ↾ 𝐴) Isom E , E (𝐴, 𝐴))) | |
4 | 3 | spcegv 3599 | . . . . 5 ⊢ (( I ↾ 𝐴) ∈ V → (( I ↾ 𝐴) Isom E , E (𝐴, 𝐴) → ∃𝑓 𝑓 Isom E , E (𝐴, 𝐴))) |
5 | 1, 2, 4 | mpisyl 21 | . . . 4 ⊢ (𝐴 ∈ On → ∃𝑓 𝑓 Isom E , E (𝐴, 𝐴)) |
6 | 5 | adantr 483 | . . 3 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ∃𝑓 𝑓 Isom E , E (𝐴, 𝐴)) |
7 | isoeq5 7076 | . . . 4 ⊢ (𝐴 = 𝐵 → (𝑓 Isom E , E (𝐴, 𝐴) ↔ 𝑓 Isom E , E (𝐴, 𝐵))) | |
8 | 7 | exbidv 1922 | . . 3 ⊢ (𝐴 = 𝐵 → (∃𝑓 𝑓 Isom E , E (𝐴, 𝐴) ↔ ∃𝑓 𝑓 Isom E , E (𝐴, 𝐵))) |
9 | 6, 8 | syl5ibcom 247 | . 2 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 = 𝐵 → ∃𝑓 𝑓 Isom E , E (𝐴, 𝐵))) |
10 | eloni 6203 | . . . 4 ⊢ (𝐴 ∈ On → Ord 𝐴) | |
11 | eloni 6203 | . . . 4 ⊢ (𝐵 ∈ On → Ord 𝐵) | |
12 | ordiso2 8981 | . . . . . 6 ⊢ ((𝑓 Isom E , E (𝐴, 𝐵) ∧ Ord 𝐴 ∧ Ord 𝐵) → 𝐴 = 𝐵) | |
13 | 12 | 3coml 1123 | . . . . 5 ⊢ ((Ord 𝐴 ∧ Ord 𝐵 ∧ 𝑓 Isom E , E (𝐴, 𝐵)) → 𝐴 = 𝐵) |
14 | 13 | 3expia 1117 | . . . 4 ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → (𝑓 Isom E , E (𝐴, 𝐵) → 𝐴 = 𝐵)) |
15 | 10, 11, 14 | syl2an 597 | . . 3 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝑓 Isom E , E (𝐴, 𝐵) → 𝐴 = 𝐵)) |
16 | 15 | exlimdv 1934 | . 2 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (∃𝑓 𝑓 Isom E , E (𝐴, 𝐵) → 𝐴 = 𝐵)) |
17 | 9, 16 | impbid 214 | 1 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 = 𝐵 ↔ ∃𝑓 𝑓 Isom E , E (𝐴, 𝐵))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 = wceq 1537 ∃wex 1780 ∈ wcel 2114 Vcvv 3496 I cid 5461 E cep 5466 ↾ cres 5559 Ord word 6192 Oncon0 6193 Isom wiso 6358 |
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 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2795 ax-sep 5205 ax-nul 5212 ax-pow 5268 ax-pr 5332 ax-un 7463 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-ne 3019 df-ral 3145 df-rex 3146 df-rab 3149 df-v 3498 df-sbc 3775 df-dif 3941 df-un 3943 df-in 3945 df-ss 3954 df-pss 3956 df-nul 4294 df-if 4470 df-pw 4543 df-sn 4570 df-pr 4572 df-tp 4574 df-op 4576 df-uni 4841 df-br 5069 df-opab 5131 df-mpt 5149 df-tr 5175 df-id 5462 df-eprel 5467 df-po 5476 df-so 5477 df-fr 5516 df-we 5518 df-xp 5563 df-rel 5564 df-cnv 5565 df-co 5566 df-dm 5567 df-rn 5568 df-res 5569 df-ima 5570 df-ord 6196 df-on 6197 df-iota 6316 df-fun 6359 df-fn 6360 df-f 6361 df-f1 6362 df-fo 6363 df-f1o 6364 df-fv 6365 df-isom 6366 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |