| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > weisoeq | 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 wemoiso 7927. (Contributed by Mario Carneiro, 25-Jun-2015.) |
| Ref | Expression |
|---|---|
| weisoeq | ⊢ (((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) ∧ (𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐺 Isom 𝑅, 𝑆 (𝐴, 𝐵))) → 𝐹 = 𝐺) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | id 22 | . . . 4 ⊢ (𝐺 Isom 𝑅, 𝑆 (𝐴, 𝐵) → 𝐺 Isom 𝑅, 𝑆 (𝐴, 𝐵)) | |
| 2 | isocnv 7286 | . . . 4 ⊢ (𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵) → ◡𝐹 Isom 𝑆, 𝑅 (𝐵, 𝐴)) | |
| 3 | isotr 7292 | . . . 4 ⊢ ((𝐺 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ ◡𝐹 Isom 𝑆, 𝑅 (𝐵, 𝐴)) → (◡𝐹 ∘ 𝐺) Isom 𝑅, 𝑅 (𝐴, 𝐴)) | |
| 4 | 1, 2, 3 | syl2anr 598 | . . 3 ⊢ ((𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐺 Isom 𝑅, 𝑆 (𝐴, 𝐵)) → (◡𝐹 ∘ 𝐺) Isom 𝑅, 𝑅 (𝐴, 𝐴)) |
| 5 | weniso 7310 | . . . 4 ⊢ ((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴 ∧ (◡𝐹 ∘ 𝐺) Isom 𝑅, 𝑅 (𝐴, 𝐴)) → (◡𝐹 ∘ 𝐺) = ( I ↾ 𝐴)) | |
| 6 | 5 | 3expa 1119 | . . 3 ⊢ (((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) ∧ (◡𝐹 ∘ 𝐺) Isom 𝑅, 𝑅 (𝐴, 𝐴)) → (◡𝐹 ∘ 𝐺) = ( I ↾ 𝐴)) |
| 7 | 4, 6 | sylan2 594 | . 2 ⊢ (((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) ∧ (𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐺 Isom 𝑅, 𝑆 (𝐴, 𝐵))) → (◡𝐹 ∘ 𝐺) = ( I ↾ 𝐴)) |
| 8 | simprl 771 | . . . 4 ⊢ (((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) ∧ (𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐺 Isom 𝑅, 𝑆 (𝐴, 𝐵))) → 𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵)) | |
| 9 | isof1o 7279 | . . . 4 ⊢ (𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵) → 𝐹:𝐴–1-1-onto→𝐵) | |
| 10 | f1of1 6781 | . . . 4 ⊢ (𝐹:𝐴–1-1-onto→𝐵 → 𝐹:𝐴–1-1→𝐵) | |
| 11 | 8, 9, 10 | 3syl 18 | . . 3 ⊢ (((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) ∧ (𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐺 Isom 𝑅, 𝑆 (𝐴, 𝐵))) → 𝐹:𝐴–1-1→𝐵) |
| 12 | simprr 773 | . . . 4 ⊢ (((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) ∧ (𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐺 Isom 𝑅, 𝑆 (𝐴, 𝐵))) → 𝐺 Isom 𝑅, 𝑆 (𝐴, 𝐵)) | |
| 13 | isof1o 7279 | . . . 4 ⊢ (𝐺 Isom 𝑅, 𝑆 (𝐴, 𝐵) → 𝐺:𝐴–1-1-onto→𝐵) | |
| 14 | f1of1 6781 | . . . 4 ⊢ (𝐺:𝐴–1-1-onto→𝐵 → 𝐺:𝐴–1-1→𝐵) | |
| 15 | 12, 13, 14 | 3syl 18 | . . 3 ⊢ (((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) ∧ (𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐺 Isom 𝑅, 𝑆 (𝐴, 𝐵))) → 𝐺:𝐴–1-1→𝐵) |
| 16 | f1eqcocnv 7257 | . . 3 ⊢ ((𝐹:𝐴–1-1→𝐵 ∧ 𝐺:𝐴–1-1→𝐵) → (𝐹 = 𝐺 ↔ (◡𝐹 ∘ 𝐺) = ( I ↾ 𝐴))) | |
| 17 | 11, 15, 16 | syl2anc 585 | . 2 ⊢ (((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) ∧ (𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐺 Isom 𝑅, 𝑆 (𝐴, 𝐵))) → (𝐹 = 𝐺 ↔ (◡𝐹 ∘ 𝐺) = ( I ↾ 𝐴))) |
| 18 | 7, 17 | mpbird 257 | 1 ⊢ (((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) ∧ (𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐺 Isom 𝑅, 𝑆 (𝐴, 𝐵))) → 𝐹 = 𝐺) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1542 I cid 5526 Se wse 5583 We wwe 5584 ◡ccnv 5631 ↾ cres 5634 ∘ ccom 5636 –1-1→wf1 6497 –1-1-onto→wf1o 6499 Isom wiso 6501 |
| 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 5243 ax-nul 5253 ax-pr 5379 |
| 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 3352 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-br 5101 df-opab 5163 df-mpt 5182 df-id 5527 df-po 5540 df-so 5541 df-fr 5585 df-se 5586 df-we 5587 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-iota 6456 df-fun 6502 df-fn 6503 df-f 6504 df-f1 6505 df-fo 6506 df-f1o 6507 df-fv 6508 df-isom 6509 |
| This theorem is referenced by: weisoeq2 7312 wemoiso 7927 oieu 9456 |
| Copyright terms: Public domain | W3C validator |