| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > wemoiso | Structured version Visualization version GIF version | ||
| Description: Thus, there is at most one isomorphism between any two well-ordered sets. TODO: Shorten finnisoeu 10066. (Contributed by Stefan O'Rear, 12-Feb-2015.) (Revised by Mario Carneiro, 25-Jun-2015.) |
| Ref | Expression |
|---|---|
| wemoiso | ⊢ (𝑅 We 𝐴 → ∃*𝑓 𝑓 Isom 𝑅, 𝑆 (𝐴, 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpl 482 | . . . . . 6 ⊢ ((𝑅 We 𝐴 ∧ (𝑓 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝑔 Isom 𝑅, 𝑆 (𝐴, 𝐵))) → 𝑅 We 𝐴) | |
| 2 | vex 3451 | . . . . . . . . 9 ⊢ 𝑓 ∈ V | |
| 3 | isof1o 7298 | . . . . . . . . . 10 ⊢ (𝑓 Isom 𝑅, 𝑆 (𝐴, 𝐵) → 𝑓:𝐴–1-1-onto→𝐵) | |
| 4 | f1of 6800 | . . . . . . . . . 10 ⊢ (𝑓:𝐴–1-1-onto→𝐵 → 𝑓:𝐴⟶𝐵) | |
| 5 | 3, 4 | syl 17 | . . . . . . . . 9 ⊢ (𝑓 Isom 𝑅, 𝑆 (𝐴, 𝐵) → 𝑓:𝐴⟶𝐵) |
| 6 | dmfex 7881 | . . . . . . . . 9 ⊢ ((𝑓 ∈ V ∧ 𝑓:𝐴⟶𝐵) → 𝐴 ∈ V) | |
| 7 | 2, 5, 6 | sylancr 587 | . . . . . . . 8 ⊢ (𝑓 Isom 𝑅, 𝑆 (𝐴, 𝐵) → 𝐴 ∈ V) |
| 8 | 7 | ad2antrl 728 | . . . . . . 7 ⊢ ((𝑅 We 𝐴 ∧ (𝑓 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝑔 Isom 𝑅, 𝑆 (𝐴, 𝐵))) → 𝐴 ∈ V) |
| 9 | exse 5598 | . . . . . . 7 ⊢ (𝐴 ∈ V → 𝑅 Se 𝐴) | |
| 10 | 8, 9 | syl 17 | . . . . . 6 ⊢ ((𝑅 We 𝐴 ∧ (𝑓 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝑔 Isom 𝑅, 𝑆 (𝐴, 𝐵))) → 𝑅 Se 𝐴) |
| 11 | 1, 10 | jca 511 | . . . . 5 ⊢ ((𝑅 We 𝐴 ∧ (𝑓 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝑔 Isom 𝑅, 𝑆 (𝐴, 𝐵))) → (𝑅 We 𝐴 ∧ 𝑅 Se 𝐴)) |
| 12 | weisoeq 7330 | . . . . 5 ⊢ (((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) ∧ (𝑓 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝑔 Isom 𝑅, 𝑆 (𝐴, 𝐵))) → 𝑓 = 𝑔) | |
| 13 | 11, 12 | sylancom 588 | . . . 4 ⊢ ((𝑅 We 𝐴 ∧ (𝑓 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝑔 Isom 𝑅, 𝑆 (𝐴, 𝐵))) → 𝑓 = 𝑔) |
| 14 | 13 | ex 412 | . . 3 ⊢ (𝑅 We 𝐴 → ((𝑓 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝑔 Isom 𝑅, 𝑆 (𝐴, 𝐵)) → 𝑓 = 𝑔)) |
| 15 | 14 | alrimivv 1928 | . 2 ⊢ (𝑅 We 𝐴 → ∀𝑓∀𝑔((𝑓 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝑔 Isom 𝑅, 𝑆 (𝐴, 𝐵)) → 𝑓 = 𝑔)) |
| 16 | isoeq1 7292 | . . 3 ⊢ (𝑓 = 𝑔 → (𝑓 Isom 𝑅, 𝑆 (𝐴, 𝐵) ↔ 𝑔 Isom 𝑅, 𝑆 (𝐴, 𝐵))) | |
| 17 | 16 | mo4 2559 | . 2 ⊢ (∃*𝑓 𝑓 Isom 𝑅, 𝑆 (𝐴, 𝐵) ↔ ∀𝑓∀𝑔((𝑓 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝑔 Isom 𝑅, 𝑆 (𝐴, 𝐵)) → 𝑓 = 𝑔)) |
| 18 | 15, 17 | sylibr 234 | 1 ⊢ (𝑅 We 𝐴 → ∃*𝑓 𝑓 Isom 𝑅, 𝑆 (𝐴, 𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∀wal 1538 ∈ wcel 2109 ∃*wmo 2531 Vcvv 3447 Se wse 5589 We wwe 5590 ⟶wf 6507 –1-1-onto→wf1o 6510 Isom wiso 6512 |
| 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 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-sep 5251 ax-nul 5261 ax-pr 5387 ax-un 7711 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-ral 3045 df-rex 3054 df-rmo 3354 df-reu 3355 df-rab 3406 df-v 3449 df-sbc 3754 df-csb 3863 df-dif 3917 df-un 3919 df-in 3921 df-ss 3931 df-nul 4297 df-if 4489 df-pw 4565 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4872 df-br 5108 df-opab 5170 df-mpt 5189 df-id 5533 df-po 5546 df-so 5547 df-fr 5591 df-se 5592 df-we 5593 df-xp 5644 df-rel 5645 df-cnv 5646 df-co 5647 df-dm 5648 df-rn 5649 df-res 5650 df-ima 5651 df-iota 6464 df-fun 6513 df-fn 6514 df-f 6515 df-f1 6516 df-fo 6517 df-f1o 6518 df-fv 6519 df-isom 6520 |
| This theorem is referenced by: fzisoeu 45298 |
| Copyright terms: Public domain | W3C validator |