| 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 7921. (Contributed by Mario Carneiro, 25-Jun-2015.) |
| Ref | Expression |
|---|---|
| weisoeq2 | ⊢ (((𝑆 We 𝐵 ∧ 𝑆 Se 𝐵) ∧ (𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐺 Isom 𝑅, 𝑆 (𝐴, 𝐵))) → 𝐹 = 𝐺) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | isocnv 7279 | . . . 4 ⊢ (𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵) → ◡𝐹 Isom 𝑆, 𝑅 (𝐵, 𝐴)) | |
| 2 | isocnv 7279 | . . . 4 ⊢ (𝐺 Isom 𝑅, 𝑆 (𝐴, 𝐵) → ◡𝐺 Isom 𝑆, 𝑅 (𝐵, 𝐴)) | |
| 3 | 1, 2 | anim12i 614 | . . 3 ⊢ ((𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐺 Isom 𝑅, 𝑆 (𝐴, 𝐵)) → (◡𝐹 Isom 𝑆, 𝑅 (𝐵, 𝐴) ∧ ◡𝐺 Isom 𝑆, 𝑅 (𝐵, 𝐴))) |
| 4 | weisoeq 7304 | . . 3 ⊢ (((𝑆 We 𝐵 ∧ 𝑆 Se 𝐵) ∧ (◡𝐹 Isom 𝑆, 𝑅 (𝐵, 𝐴) ∧ ◡𝐺 Isom 𝑆, 𝑅 (𝐵, 𝐴))) → ◡𝐹 = ◡𝐺) | |
| 5 | 3, 4 | sylan2 594 | . 2 ⊢ (((𝑆 We 𝐵 ∧ 𝑆 Se 𝐵) ∧ (𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐺 Isom 𝑅, 𝑆 (𝐴, 𝐵))) → ◡𝐹 = ◡𝐺) |
| 6 | simprl 771 | . . . 4 ⊢ (((𝑆 We 𝐵 ∧ 𝑆 Se 𝐵) ∧ (𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐺 Isom 𝑅, 𝑆 (𝐴, 𝐵))) → 𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵)) | |
| 7 | isof1o 7272 | . . . 4 ⊢ (𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵) → 𝐹:𝐴–1-1-onto→𝐵) | |
| 8 | f1orel 6778 | . . . 4 ⊢ (𝐹:𝐴–1-1-onto→𝐵 → Rel 𝐹) | |
| 9 | 6, 7, 8 | 3syl 18 | . . 3 ⊢ (((𝑆 We 𝐵 ∧ 𝑆 Se 𝐵) ∧ (𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐺 Isom 𝑅, 𝑆 (𝐴, 𝐵))) → Rel 𝐹) |
| 10 | simprr 773 | . . . 4 ⊢ (((𝑆 We 𝐵 ∧ 𝑆 Se 𝐵) ∧ (𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐺 Isom 𝑅, 𝑆 (𝐴, 𝐵))) → 𝐺 Isom 𝑅, 𝑆 (𝐴, 𝐵)) | |
| 11 | isof1o 7272 | . . . 4 ⊢ (𝐺 Isom 𝑅, 𝑆 (𝐴, 𝐵) → 𝐺:𝐴–1-1-onto→𝐵) | |
| 12 | f1orel 6778 | . . . 4 ⊢ (𝐺:𝐴–1-1-onto→𝐵 → Rel 𝐺) | |
| 13 | 10, 11, 12 | 3syl 18 | . . 3 ⊢ (((𝑆 We 𝐵 ∧ 𝑆 Se 𝐵) ∧ (𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐺 Isom 𝑅, 𝑆 (𝐴, 𝐵))) → Rel 𝐺) |
| 14 | cnveqb 6155 | . . 3 ⊢ ((Rel 𝐹 ∧ Rel 𝐺) → (𝐹 = 𝐺 ↔ ◡𝐹 = ◡𝐺)) | |
| 15 | 9, 13, 14 | syl2anc 585 | . 2 ⊢ (((𝑆 We 𝐵 ∧ 𝑆 Se 𝐵) ∧ (𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐺 Isom 𝑅, 𝑆 (𝐴, 𝐵))) → (𝐹 = 𝐺 ↔ ◡𝐹 = ◡𝐺)) |
| 16 | 5, 15 | mpbird 257 | 1 ⊢ (((𝑆 We 𝐵 ∧ 𝑆 Se 𝐵) ∧ (𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐺 Isom 𝑅, 𝑆 (𝐴, 𝐵))) → 𝐹 = 𝐺) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1542 Se wse 5576 We wwe 5577 ◡ccnv 5624 Rel wrel 5630 –1-1-onto→wf1o 6492 Isom wiso 6494 |
| 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 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5232 ax-nul 5242 ax-pr 5371 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3063 df-rmo 3343 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-br 5087 df-opab 5149 df-mpt 5168 df-id 5520 df-po 5533 df-so 5534 df-fr 5578 df-se 5579 df-we 5580 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-iota 6449 df-fun 6495 df-fn 6496 df-f 6497 df-f1 6498 df-fo 6499 df-f1o 6500 df-fv 6501 df-isom 6502 |
| This theorem is referenced by: wemoiso2 7921 |
| Copyright terms: Public domain | W3C validator |