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

Theorem wemoiso2 7999
Description: Thus, there is at most one isomorphism between any two well-ordered sets. (Contributed by Stefan O'Rear, 12-Feb-2015.) (Revised by Mario Carneiro, 25-Jun-2015.)
Assertion
Ref Expression
wemoiso2 (𝑆 We 𝐵 → ∃*𝑓 𝑓 Isom 𝑅, 𝑆 (𝐴, 𝐵))
Distinct variable groups:   𝑅,𝑓   𝐴,𝑓   𝑆,𝑓   𝐵,𝑓

Proof of Theorem wemoiso2
Dummy variable 𝑔 is distinct from all other variables.
StepHypRef Expression
1 simpl 482 . . . . . 6 ((𝑆 We 𝐵 ∧ (𝑓 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝑔 Isom 𝑅, 𝑆 (𝐴, 𝐵))) → 𝑆 We 𝐵)
2 isof1o 7343 . . . . . . . . . 10 (𝑓 Isom 𝑅, 𝑆 (𝐴, 𝐵) → 𝑓:𝐴1-1-onto𝐵)
3 f1ofo 6855 . . . . . . . . . 10 (𝑓:𝐴1-1-onto𝐵𝑓:𝐴onto𝐵)
4 forn 6823 . . . . . . . . . 10 (𝑓:𝐴onto𝐵 → ran 𝑓 = 𝐵)
52, 3, 43syl 18 . . . . . . . . 9 (𝑓 Isom 𝑅, 𝑆 (𝐴, 𝐵) → ran 𝑓 = 𝐵)
6 vex 3484 . . . . . . . . . 10 𝑓 ∈ V
76rnex 7932 . . . . . . . . 9 ran 𝑓 ∈ V
85, 7eqeltrrdi 2850 . . . . . . . 8 (𝑓 Isom 𝑅, 𝑆 (𝐴, 𝐵) → 𝐵 ∈ V)
98ad2antrl 728 . . . . . . 7 ((𝑆 We 𝐵 ∧ (𝑓 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝑔 Isom 𝑅, 𝑆 (𝐴, 𝐵))) → 𝐵 ∈ V)
10 exse 5645 . . . . . . 7 (𝐵 ∈ V → 𝑆 Se 𝐵)
119, 10syl 17 . . . . . 6 ((𝑆 We 𝐵 ∧ (𝑓 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝑔 Isom 𝑅, 𝑆 (𝐴, 𝐵))) → 𝑆 Se 𝐵)
121, 11jca 511 . . . . 5 ((𝑆 We 𝐵 ∧ (𝑓 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝑔 Isom 𝑅, 𝑆 (𝐴, 𝐵))) → (𝑆 We 𝐵𝑆 Se 𝐵))
13 weisoeq2 7376 . . . . 5 (((𝑆 We 𝐵𝑆 Se 𝐵) ∧ (𝑓 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝑔 Isom 𝑅, 𝑆 (𝐴, 𝐵))) → 𝑓 = 𝑔)
1412, 13sylancom 588 . . . 4 ((𝑆 We 𝐵 ∧ (𝑓 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝑔 Isom 𝑅, 𝑆 (𝐴, 𝐵))) → 𝑓 = 𝑔)
1514ex 412 . . 3 (𝑆 We 𝐵 → ((𝑓 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝑔 Isom 𝑅, 𝑆 (𝐴, 𝐵)) → 𝑓 = 𝑔))
1615alrimivv 1928 . 2 (𝑆 We 𝐵 → ∀𝑓𝑔((𝑓 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝑔 Isom 𝑅, 𝑆 (𝐴, 𝐵)) → 𝑓 = 𝑔))
17 isoeq1 7337 . . 3 (𝑓 = 𝑔 → (𝑓 Isom 𝑅, 𝑆 (𝐴, 𝐵) ↔ 𝑔 Isom 𝑅, 𝑆 (𝐴, 𝐵)))
1817mo4 2566 . 2 (∃*𝑓 𝑓 Isom 𝑅, 𝑆 (𝐴, 𝐵) ↔ ∀𝑓𝑔((𝑓 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝑔 Isom 𝑅, 𝑆 (𝐴, 𝐵)) → 𝑓 = 𝑔))
1916, 18sylibr 234 1 (𝑆 We 𝐵 → ∃*𝑓 𝑓 Isom 𝑅, 𝑆 (𝐴, 𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  wal 1538   = wceq 1540  wcel 2108  ∃*wmo 2538  Vcvv 3480   Se wse 5635   We wwe 5636  ran crn 5686  ontowfo 6559  1-1-ontowf1o 6560   Isom wiso 6562
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2708  ax-sep 5296  ax-nul 5306  ax-pr 5432  ax-un 7755
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2540  df-eu 2569  df-clab 2715  df-cleq 2729  df-clel 2816  df-nfc 2892  df-ne 2941  df-ral 3062  df-rex 3071  df-rmo 3380  df-reu 3381  df-rab 3437  df-v 3482  df-sbc 3789  df-csb 3900  df-dif 3954  df-un 3956  df-in 3958  df-ss 3968  df-nul 4334  df-if 4526  df-pw 4602  df-sn 4627  df-pr 4629  df-op 4633  df-uni 4908  df-br 5144  df-opab 5206  df-mpt 5226  df-id 5578  df-po 5592  df-so 5593  df-fr 5637  df-se 5638  df-we 5639  df-xp 5691  df-rel 5692  df-cnv 5693  df-co 5694  df-dm 5695  df-rn 5696  df-res 5697  df-ima 5698  df-iota 6514  df-fun 6563  df-fn 6564  df-f 6565  df-f1 6566  df-fo 6567  df-f1o 6568  df-fv 6569  df-isom 6570
This theorem is referenced by:  finnisoeu  10153
  Copyright terms: Public domain W3C validator