Theorem wemoiso 7656

Description: Thus, there is at most one isomorphism between any two well-ordered sets. TODO: Shorten finnisoeu 9524. (Contributed by Stefan O'Rear, 12-Feb-2015.) (Revised by Mario Carneiro, 25-Jun-2015.)

Assertion

Ref	Expression
wemoiso	⊢ (𝑅 We 𝐴 → ∃*𝑓 𝑓 Isom 𝑅, 𝑆 (𝐴, 𝐵))

Distinct variable groups:   𝑅,𝑓   𝐴,𝑓   𝑆,𝑓   𝐵,𝑓

Proof of Theorem wemoiso

Dummy variable 𝑔 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		simpl 486	. . . . . 6 ⊢ ((𝑅 We 𝐴 ∧ (𝑓 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝑔 Isom 𝑅, 𝑆 (𝐴, 𝐵))) → 𝑅 We 𝐴)
2		vex 3444	. . . . . . . . 9 ⊢ 𝑓 ∈ V
3		isof1o 7055	. . . . . . . . . 10 ⊢ (𝑓 Isom 𝑅, 𝑆 (𝐴, 𝐵) → 𝑓:𝐴–1-1-onto→𝐵)
4		f1of 6590	. . . . . . . . . 10 ⊢ (𝑓:𝐴–1-1-onto→𝐵 → 𝑓:𝐴⟶𝐵)
5	3, 4	syl 17	. . . . . . . . 9 ⊢ (𝑓 Isom 𝑅, 𝑆 (𝐴, 𝐵) → 𝑓:𝐴⟶𝐵)
6		dmfex 7623	. . . . . . . . 9 ⊢ ((𝑓 ∈ V ∧ 𝑓:𝐴⟶𝐵) → 𝐴 ∈ V)
7	2, 5, 6	sylancr 590	. . . . . . . 8 ⊢ (𝑓 Isom 𝑅, 𝑆 (𝐴, 𝐵) → 𝐴 ∈ V)
8	7	ad2antrl 727	. . . . . . 7 ⊢ ((𝑅 We 𝐴 ∧ (𝑓 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝑔 Isom 𝑅, 𝑆 (𝐴, 𝐵))) → 𝐴 ∈ V)
9		exse 5483	. . . . . . 7 ⊢ (𝐴 ∈ V → 𝑅 Se 𝐴)
10	8, 9	syl 17	. . . . . 6 ⊢ ((𝑅 We 𝐴 ∧ (𝑓 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝑔 Isom 𝑅, 𝑆 (𝐴, 𝐵))) → 𝑅 Se 𝐴)
11	1, 10	jca 515	. . . . 5 ⊢ ((𝑅 We 𝐴 ∧ (𝑓 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝑔 Isom 𝑅, 𝑆 (𝐴, 𝐵))) → (𝑅 We 𝐴 ∧ 𝑅 Se 𝐴))
12		weisoeq 7087	. . . . 5 ⊢ (((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) ∧ (𝑓 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝑔 Isom 𝑅, 𝑆 (𝐴, 𝐵))) → 𝑓 = 𝑔)
13	11, 12	sylancom 591	. . . 4 ⊢ ((𝑅 We 𝐴 ∧ (𝑓 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝑔 Isom 𝑅, 𝑆 (𝐴, 𝐵))) → 𝑓 = 𝑔)
14	13	ex 416	. . 3 ⊢ (𝑅 We 𝐴 → ((𝑓 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝑔 Isom 𝑅, 𝑆 (𝐴, 𝐵)) → 𝑓 = 𝑔))
15	14	alrimivv 1929	. 2 ⊢ (𝑅 We 𝐴 → ∀𝑓∀𝑔((𝑓 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝑔 Isom 𝑅, 𝑆 (𝐴, 𝐵)) → 𝑓 = 𝑔))
16		isoeq1 7049	. . 3 ⊢ (𝑓 = 𝑔 → (𝑓 Isom 𝑅, 𝑆 (𝐴, 𝐵) ↔ 𝑔 Isom 𝑅, 𝑆 (𝐴, 𝐵)))
17	16	mo4 2625	. 2 ⊢ (∃*𝑓 𝑓 Isom 𝑅, 𝑆 (𝐴, 𝐵) ↔ ∀𝑓∀𝑔((𝑓 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝑔 Isom 𝑅, 𝑆 (𝐴, 𝐵)) → 𝑓 = 𝑔))
18	15, 17	sylibr 237	1 ⊢ (𝑅 We 𝐴 → ∃*𝑓 𝑓 Isom 𝑅, 𝑆 (𝐴, 𝐵))

Syntax hints:   → wi 4   ∧ wa 399  ∀wal 1536   ∈ wcel 2111  ∃*wmo 2596  Vcvv 3441   Se wse 5476   We wwe 5477  ⟶wf 6320  –1-1-onto→wf1o 6323   Isom wiso 6325

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-sep 5167  ax-nul 5174  ax-pow 5231  ax-pr 5295  ax-un 7441

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3or 1085  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-ral 3111  df-rex 3112  df-reu 3113  df-rmo 3114  df-rab 3115  df-v 3443  df-sbc 3721  df-csb 3829  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-nul 4244  df-if 4426  df-sn 4526  df-pr 4528  df-op 4532  df-uni 4801  df-br 5031  df-opab 5093  df-mpt 5111  df-id 5425  df-po 5438  df-so 5439  df-fr 5478  df-se 5479  df-we 5480  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-rn 5530  df-res 5531  df-ima 5532  df-iota 6283  df-fun 6326  df-fn 6327  df-f 6328  df-f1 6329  df-fo 6330  df-f1o 6331  df-fv 6332  df-isom 6333

This theorem is referenced by:  fzisoeu  41932