Theorem wemoiso2 7154

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	|- ( S We B -> E* f f Isom R , S ( A , B ) )

Distinct variable groups:   R, f   A, f   S, f   B, f

Proof of Theorem wemoiso2

Dummy variable g is distinct from all other variables.

Step	Hyp	Ref	Expression
1		simpl 473	. . . . . 6 |- ( ( S We B /\ ( f Isom R , S ( A , B ) /\ g Isom R , S ( A , B ) ) ) -> S We B )
2		isof1o 6573	. . . . . . . . . 10 |- ( f Isom R , S ( A , B ) -> f : A -1-1-onto-> B )
3		f1ofo 6144	. . . . . . . . . 10 |- ( f : A -1-1-onto-> B -> f : A -onto-> B )
4		forn 6118	. . . . . . . . . 10 |- ( f : A -onto-> B -> ran f = B )
5	2, 3, 4	3syl 18	. . . . . . . . 9 |- ( f Isom R , S ( A , B ) -> ran f = B )
6		vex 3203	. . . . . . . . . 10 |- f e. _V
7	6	rnex 7100	. . . . . . . . 9 |- ran f e. _V
8	5, 7	syl6eqelr 2710	. . . . . . . 8 |- ( f Isom R , S ( A , B ) -> B e. _V )
9	8	ad2antrl 764	. . . . . . 7 |- ( ( S We B /\ ( f Isom R , S ( A , B ) /\ g Isom R , S ( A , B ) ) ) -> B e. _V )
10		exse 5078	. . . . . . 7 |- ( B e. _V -> S Se B )
11	9, 10	syl 17	. . . . . 6 |- ( ( S We B /\ ( f Isom R , S ( A , B ) /\ g Isom R , S ( A , B ) ) ) -> S Se B )
12	1, 11	jca 554	. . . . 5 |- ( ( S We B /\ ( f Isom R , S ( A , B ) /\ g Isom R , S ( A , B ) ) ) -> ( S We B /\ S Se B ) )
13		weisoeq2 6606	. . . . 5 |- ( ( ( S We B /\ S Se B ) /\ ( f Isom R , S ( A , B ) /\ g Isom R , S ( A , B ) ) ) -> f = g )
14	12, 13	sylancom 701	. . . 4 |- ( ( S We B /\ ( f Isom R , S ( A , B ) /\ g Isom R , S ( A , B ) ) ) -> f = g )
15	14	ex 450	. . 3 |- ( S We B -> ( ( f Isom R , S ( A , B ) /\ g Isom R , S ( A , B ) ) -> f = g ) )
16	15	alrimivv 1856	. 2 |- ( S We B -> A. f A. g ( ( f Isom R , S ( A , B ) /\ g Isom R , S ( A , B ) ) -> f = g ) )
17		isoeq1 6567	. . 3 |- ( f = g -> ( f Isom R , S ( A , B ) <-> g Isom R , S ( A , B ) ) )
18	17	mo4 2517	. 2 |- ( E* f f Isom R , S ( A , B ) <-> A. f A. g ( ( f Isom R , S ( A , B ) /\ g Isom R , S ( A , B ) ) -> f = g ) )
19	16, 18	sylibr 224	1 |- ( S We B -> E* f f Isom R , S ( A , B ) )

Syntax hints:   -> wi 4   /\ wa 384   A.wal 1481   = wceq 1483   e. wcel 1990   E*wmo 2471   _Vcvv 3200   Se wse 5071   We wwe 5072   ran crn 5115   -onto->wfo 5886   -1-1-onto->wf1o 5887   Isom wiso 5889

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906  ax-un 6949

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1038  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-ral 2917  df-rex 2918  df-reu 2919  df-rmo 2920  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-br 4654  df-opab 4713  df-mpt 4730  df-id 5024  df-po 5035  df-so 5036  df-fr 5073  df-se 5074  df-we 5075  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-fv 5896  df-isom 5897

This theorem is referenced by:  finnisoeu  8936