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

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

Proof of Theorem weisoeq2
StepHypRef Expression
1 isocnv 7366 . . . 4 (𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵) → 𝐹 Isom 𝑆, 𝑅 (𝐵, 𝐴))
2 isocnv 7366 . . . 4 (𝐺 Isom 𝑅, 𝑆 (𝐴, 𝐵) → 𝐺 Isom 𝑆, 𝑅 (𝐵, 𝐴))
31, 2anim12i 612 . . 3 ((𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐺 Isom 𝑅, 𝑆 (𝐴, 𝐵)) → (𝐹 Isom 𝑆, 𝑅 (𝐵, 𝐴) ∧ 𝐺 Isom 𝑆, 𝑅 (𝐵, 𝐴)))
4 weisoeq 7391 . . 3 (((𝑆 We 𝐵𝑆 Se 𝐵) ∧ (𝐹 Isom 𝑆, 𝑅 (𝐵, 𝐴) ∧ 𝐺 Isom 𝑆, 𝑅 (𝐵, 𝐴))) → 𝐹 = 𝐺)
53, 4sylan2 592 . 2 (((𝑆 We 𝐵𝑆 Se 𝐵) ∧ (𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐺 Isom 𝑅, 𝑆 (𝐴, 𝐵))) → 𝐹 = 𝐺)
6 simprl 770 . . . 4 (((𝑆 We 𝐵𝑆 Se 𝐵) ∧ (𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐺 Isom 𝑅, 𝑆 (𝐴, 𝐵))) → 𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵))
7 isof1o 7359 . . . 4 (𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵) → 𝐹:𝐴1-1-onto𝐵)
8 f1orel 6865 . . . 4 (𝐹:𝐴1-1-onto𝐵 → Rel 𝐹)
96, 7, 83syl 18 . . 3 (((𝑆 We 𝐵𝑆 Se 𝐵) ∧ (𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐺 Isom 𝑅, 𝑆 (𝐴, 𝐵))) → Rel 𝐹)
10 simprr 772 . . . 4 (((𝑆 We 𝐵𝑆 Se 𝐵) ∧ (𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐺 Isom 𝑅, 𝑆 (𝐴, 𝐵))) → 𝐺 Isom 𝑅, 𝑆 (𝐴, 𝐵))
11 isof1o 7359 . . . 4 (𝐺 Isom 𝑅, 𝑆 (𝐴, 𝐵) → 𝐺:𝐴1-1-onto𝐵)
12 f1orel 6865 . . . 4 (𝐺:𝐴1-1-onto𝐵 → Rel 𝐺)
1310, 11, 123syl 18 . . 3 (((𝑆 We 𝐵𝑆 Se 𝐵) ∧ (𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐺 Isom 𝑅, 𝑆 (𝐴, 𝐵))) → Rel 𝐺)
14 cnveqb 6227 . . 3 ((Rel 𝐹 ∧ Rel 𝐺) → (𝐹 = 𝐺𝐹 = 𝐺))
159, 13, 14syl2anc 583 . 2 (((𝑆 We 𝐵𝑆 Se 𝐵) ∧ (𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐺 Isom 𝑅, 𝑆 (𝐴, 𝐵))) → (𝐹 = 𝐺𝐹 = 𝐺))
165, 15mpbird 257 1 (((𝑆 We 𝐵𝑆 Se 𝐵) ∧ (𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐺 Isom 𝑅, 𝑆 (𝐴, 𝐵))) → 𝐹 = 𝐺)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1537   Se wse 5650   We wwe 5651  ccnv 5699  Rel wrel 5705  1-1-ontowf1o 6572   Isom wiso 6574
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-sep 5317  ax-nul 5324  ax-pr 5447
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3or 1088  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-ral 3068  df-rex 3077  df-rmo 3388  df-reu 3389  df-rab 3444  df-v 3490  df-sbc 3805  df-csb 3922  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-nul 4353  df-if 4549  df-pw 4624  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-br 5167  df-opab 5229  df-mpt 5250  df-id 5593  df-po 5607  df-so 5608  df-fr 5652  df-se 5653  df-we 5654  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-rn 5711  df-res 5712  df-ima 5713  df-iota 6525  df-fun 6575  df-fn 6576  df-f 6577  df-f1 6578  df-fo 6579  df-f1o 6580  df-fv 6581  df-isom 6582
This theorem is referenced by:  wemoiso2  8015
  Copyright terms: Public domain W3C validator