MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  ordiso Structured version   Visualization version   GIF version

Theorem ordiso 9478
Description: Order-isomorphic ordinal numbers are equal. (Contributed by Jeff Hankins, 16-Oct-2009.) (Proof shortened by Mario Carneiro, 24-Jun-2015.)
Assertion
Ref Expression
ordiso ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 = 𝐵 ↔ ∃𝑓 𝑓 Isom E , E (𝐴, 𝐵)))
Distinct variable groups:   𝐴,𝑓   𝐵,𝑓

Proof of Theorem ordiso
StepHypRef Expression
1 resiexg 7909 . . . . 5 (𝐴 ∈ On → ( I ↾ 𝐴) ∈ V)
2 isoid 7328 . . . . 5 ( I ↾ 𝐴) Isom E , E (𝐴, 𝐴)
3 isoeq1 7316 . . . . . 6 (𝑓 = ( I ↾ 𝐴) → (𝑓 Isom E , E (𝐴, 𝐴) ↔ ( I ↾ 𝐴) Isom E , E (𝐴, 𝐴)))
43spcegv 3563 . . . . 5 (( I ↾ 𝐴) ∈ V → (( I ↾ 𝐴) Isom E , E (𝐴, 𝐴) → ∃𝑓 𝑓 Isom E , E (𝐴, 𝐴)))
51, 2, 4mpisyl 22 . . . 4 (𝐴 ∈ On → ∃𝑓 𝑓 Isom E , E (𝐴, 𝐴))
65adantr 485 . . 3 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ∃𝑓 𝑓 Isom E , E (𝐴, 𝐴))
7 isoeq5 7320 . . . 4 (𝐴 = 𝐵 → (𝑓 Isom E , E (𝐴, 𝐴) ↔ 𝑓 Isom E , E (𝐴, 𝐵)))
87exbidv 1948 . . 3 (𝐴 = 𝐵 → (∃𝑓 𝑓 Isom E , E (𝐴, 𝐴) ↔ ∃𝑓 𝑓 Isom E , E (𝐴, 𝐵)))
96, 8syl5ibcom 248 . 2 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 = 𝐵 → ∃𝑓 𝑓 Isom E , E (𝐴, 𝐵)))
10 eloni 6371 . . . 4 (𝐴 ∈ On → Ord 𝐴)
11 eloni 6371 . . . 4 (𝐵 ∈ On → Ord 𝐵)
12 ordiso2 9477 . . . . . 6 ((𝑓 Isom E , E (𝐴, 𝐵) ∧ Ord 𝐴 ∧ Ord 𝐵) → 𝐴 = 𝐵)
13123coml 1143 . . . . 5 ((Ord 𝐴 ∧ Ord 𝐵𝑓 Isom E , E (𝐴, 𝐵)) → 𝐴 = 𝐵)
14133expia 1137 . . . 4 ((Ord 𝐴 ∧ Ord 𝐵) → (𝑓 Isom E , E (𝐴, 𝐵) → 𝐴 = 𝐵))
1510, 11, 14syl2an 607 . . 3 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝑓 Isom E , E (𝐴, 𝐵) → 𝐴 = 𝐵))
1615exlimdv 1960 . 2 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (∃𝑓 𝑓 Isom E , E (𝐴, 𝐵) → 𝐴 = 𝐵))
179, 16impbid 215 1 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 = 𝐵 ↔ ∃𝑓 𝑓 Isom E , E (𝐴, 𝐵)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 400   = wceq 1567  wex 1806  wcel 2149  Vcvv 3461   I cid 5556   E cep 5561  cres 5664  Ord word 6360  Oncon0 6361   Isom wiso 6538
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-sep 5259  ax-nul 5271  ax-pow 5337  ax-pr 5405  ax-un 7733
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-ral 3086  df-rex 3096  df-rab 3423  df-v 3463  df-dif 3914  df-un 3916  df-in 3918  df-ss 3928  df-pss 3931  df-nul 4293  df-if 4491  df-pw 4567  df-sn 4593  df-pr 4595  df-op 4599  df-uni 4875  df-br 5112  df-opab 5176  df-mpt 5195  df-tr 5221  df-id 5557  df-eprel 5562  df-po 5570  df-so 5571  df-fr 5615  df-we 5617  df-xp 5668  df-rel 5669  df-cnv 5670  df-co 5671  df-dm 5672  df-rn 5673  df-res 5674  df-ima 5675  df-ord 6364  df-on 6365  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-isom 6546
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator