| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > weisoeq2 | Structured version Visualization version GIF version | ||
| Description: Thus, there is at most one isomorphism between any two set-like well-ordered classes. Class version of wemoiso2 8017. (Contributed by Mario Carneiro, 25-Jun-2015.) |
| Ref | Expression |
|---|---|
| weisoeq2 | ⊢ (((𝑆 We 𝐵 ∧ 𝑆 Se 𝐵) ∧ (𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐺 Isom 𝑅, 𝑆 (𝐴, 𝐵))) → 𝐹 = 𝐺) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | isocnv 7366 | . . . 4 ⊢ (𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵) → ◡𝐹 Isom 𝑆, 𝑅 (𝐵, 𝐴)) | |
| 2 | isocnv 7366 | . . . 4 ⊢ (𝐺 Isom 𝑅, 𝑆 (𝐴, 𝐵) → ◡𝐺 Isom 𝑆, 𝑅 (𝐵, 𝐴)) | |
| 3 | 1, 2 | anim12i 625 | . . 3 ⊢ ((𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐺 Isom 𝑅, 𝑆 (𝐴, 𝐵)) → (◡𝐹 Isom 𝑆, 𝑅 (𝐵, 𝐴) ∧ ◡𝐺 Isom 𝑆, 𝑅 (𝐵, 𝐴))) |
| 4 | weisoeq 7393 | . . 3 ⊢ (((𝑆 We 𝐵 ∧ 𝑆 Se 𝐵) ∧ (◡𝐹 Isom 𝑆, 𝑅 (𝐵, 𝐴) ∧ ◡𝐺 Isom 𝑆, 𝑅 (𝐵, 𝐴))) → ◡𝐹 = ◡𝐺) | |
| 5 | 3, 4 | sylan2 605 | . 2 ⊢ (((𝑆 We 𝐵 ∧ 𝑆 Se 𝐵) ∧ (𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐺 Isom 𝑅, 𝑆 (𝐴, 𝐵))) → ◡𝐹 = ◡𝐺) |
| 6 | simprl 783 | . . . 4 ⊢ (((𝑆 We 𝐵 ∧ 𝑆 Se 𝐵) ∧ (𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐺 Isom 𝑅, 𝑆 (𝐴, 𝐵))) → 𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵)) | |
| 7 | isof1o 7359 | . . . 4 ⊢ (𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵) → 𝐹:𝐴⟶1-1onto𝐵) | |
| 8 | f1orel 6854 | . . . 4 ⊢ (𝐹:𝐴⟶1-1onto𝐵 → Rel 𝐹) | |
| 9 | 6, 7, 8 | 3syl 19 | . . 3 ⊢ (((𝑆 We 𝐵 ∧ 𝑆 Se 𝐵) ∧ (𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐺 Isom 𝑅, 𝑆 (𝐴, 𝐵))) → Rel 𝐹) |
| 10 | simprr 785 | . . . 4 ⊢ (((𝑆 We 𝐵 ∧ 𝑆 Se 𝐵) ∧ (𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐺 Isom 𝑅, 𝑆 (𝐴, 𝐵))) → 𝐺 Isom 𝑅, 𝑆 (𝐴, 𝐵)) | |
| 11 | isof1o 7359 | . . . 4 ⊢ (𝐺 Isom 𝑅, 𝑆 (𝐴, 𝐵) → 𝐺:𝐴⟶1-1onto𝐵) | |
| 12 | f1orel 6854 | . . . 4 ⊢ (𝐺:𝐴⟶1-1onto𝐵 → Rel 𝐺) | |
| 13 | 10, 11, 12 | 3syl 19 | . . 3 ⊢ (((𝑆 We 𝐵 ∧ 𝑆 Se 𝐵) ∧ (𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐺 Isom 𝑅, 𝑆 (𝐴, 𝐵))) → Rel 𝐺) |
| 14 | cnveqb 6205 | . . 3 ⊢ ((Rel 𝐹 ∧ Rel 𝐺) → (𝐹 = 𝐺 ↔ ◡𝐹 = ◡𝐺)) | |
| 15 | 9, 13, 14 | syl2anc 596 | . 2 ⊢ (((𝑆 We 𝐵 ∧ 𝑆 Se 𝐵) ∧ (𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐺 Isom 𝑅, 𝑆 (𝐴, 𝐵))) → (𝐹 = 𝐺 ↔ ◡𝐹 = ◡𝐺)) |
| 16 | 5, 15 | mpbird 260 | 1 ⊢ (((𝑆 We 𝐵 ∧ 𝑆 Se 𝐵) ∧ (𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐺 Isom 𝑅, 𝑆 (𝐴, 𝐵))) → 𝐹 = 𝐺) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 Se wse 5606 We wwe 5607 ◡ccnv 5654 Rel wrel 5660 ⟶1-1ontowf1o 6562 Isom wiso 6564 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2150 ax-9 2158 ax-10 2181 ax-11 2198 ax-12 2217 ax-ext 2736 ax-sep 5252 ax-nul 5263 ax-pr 5395 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2568 df-eu 2598 df-clab 2743 df-cleq 2756 df-clel 2840 df-nfc 2914 df-ne 2961 df-ral 3082 df-rex 3092 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3849 df-ss 3898 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4483 df-pw 4559 df-sn 4586 df-pr 4588 df-op 4838 df-uni 4870 df-br 5106 df-opab 5171 df-mpt 5190 df-id 5550 df-po 5563 df-so 5564 df-fr 5608 df-se 5609 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-iota 6517 df-fun 6565 df-fn 6566 df-f 6567 df-f1 6568 df-fo 6569 df-f1o 6570 df-fv 6571 df-isom 6572 |
| This theorem is used by: wemoiso2 8017 |
| Copyright terms: Public domain | W3C validator |