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

Theorem weisoeq2 7354
Description: Thus, there is at most one isomorphism between any two set-like well-ordered classes. Class version of wemoiso2 7967. (Contributed by Mario Carneiro, 25-Jun-2015.)
Assertion
Ref Expression
weisoeq2 (((𝑆 We 𝐵𝑆 Se 𝐵) ∧ (𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐺 Isom 𝑅, 𝑆 (𝐴, 𝐵))) → 𝐹 = 𝐺)

Proof of Theorem weisoeq2
StepHypRef Expression
1 isocnv 7328 . . . 4 (𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵) → 𝐹 Isom 𝑆, 𝑅 (𝐵, 𝐴))
2 isocnv 7328 . . . 4 (𝐺 Isom 𝑅, 𝑆 (𝐴, 𝐵) → 𝐺 Isom 𝑆, 𝑅 (𝐵, 𝐴))
31, 2anim12i 624 . . 3 ((𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐺 Isom 𝑅, 𝑆 (𝐴, 𝐵)) → (𝐹 Isom 𝑆, 𝑅 (𝐵, 𝐴) ∧ 𝐺 Isom 𝑆, 𝑅 (𝐵, 𝐴)))
4 weisoeq 7353 . . 3 (((𝑆 We 𝐵𝑆 Se 𝐵) ∧ (𝐹 Isom 𝑆, 𝑅 (𝐵, 𝐴) ∧ 𝐺 Isom 𝑆, 𝑅 (𝐵, 𝐴))) → 𝐹 = 𝐺)
53, 4sylan2 604 . 2 (((𝑆 We 𝐵𝑆 Se 𝐵) ∧ (𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐺 Isom 𝑅, 𝑆 (𝐴, 𝐵))) → 𝐹 = 𝐺)
6 simprl 782 . . . 4 (((𝑆 We 𝐵𝑆 Se 𝐵) ∧ (𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐺 Isom 𝑅, 𝑆 (𝐴, 𝐵))) → 𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵))
7 isof1o 7321 . . . 4 (𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵) → 𝐹:𝐴1-1-onto𝐵)
8 f1orel 6823 . . . 4 (𝐹:𝐴1-1-onto𝐵 → Rel 𝐹)
96, 7, 83syl 19 . . 3 (((𝑆 We 𝐵𝑆 Se 𝐵) ∧ (𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐺 Isom 𝑅, 𝑆 (𝐴, 𝐵))) → Rel 𝐹)
10 simprr 784 . . . 4 (((𝑆 We 𝐵𝑆 Se 𝐵) ∧ (𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐺 Isom 𝑅, 𝑆 (𝐴, 𝐵))) → 𝐺 Isom 𝑅, 𝑆 (𝐴, 𝐵))
11 isof1o 7321 . . . 4 (𝐺 Isom 𝑅, 𝑆 (𝐴, 𝐵) → 𝐺:𝐴1-1-onto𝐵)
12 f1orel 6823 . . . 4 (𝐺:𝐴1-1-onto𝐵 → Rel 𝐺)
1310, 11, 123syl 19 . . 3 (((𝑆 We 𝐵𝑆 Se 𝐵) ∧ (𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐺 Isom 𝑅, 𝑆 (𝐴, 𝐵))) → Rel 𝐺)
14 cnveqb 6195 . . 3 ((Rel 𝐹 ∧ Rel 𝐺) → (𝐹 = 𝐺𝐹 = 𝐺))
159, 13, 14syl2anc 595 . 2 (((𝑆 We 𝐵𝑆 Se 𝐵) ∧ (𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐺 Isom 𝑅, 𝑆 (𝐴, 𝐵))) → (𝐹 = 𝐺𝐹 = 𝐺))
165, 15mpbird 260 1 (((𝑆 We 𝐵𝑆 Se 𝐵) ∧ (𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐺 Isom 𝑅, 𝑆 (𝐴, 𝐵))) → 𝐹 = 𝐺)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 400   = wceq 1570   Se wse 5612   We wwe 5613  ccnv 5660  Rel wrel 5666  1-1-ontowf1o 6535   Isom wiso 6537
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-sep 5257  ax-nul 5269  ax-pr 5404
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-br 5110  df-opab 5174  df-mpt 5193  df-id 5556  df-po 5569  df-so 5570  df-fr 5614  df-se 5615  df-we 5616  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-isom 6545
This theorem is referenced by:  wemoiso2  7967
  Copyright terms: Public domain W3C validator