| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > isoeq5 | Structured version Visualization version GIF version | ||
| Description: Equality theorem for isomorphisms. (Contributed by NM, 17-May-2004.) |
| Ref | Expression |
|---|---|
| isoeq5 | ⊢ (𝐵 = 𝐶 → (𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ↔ 𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐶))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | f1oeq3 6814 | . . 3 ⊢ (𝐵 = 𝐶 → (𝐻:𝐴–1-1-onto→𝐵 ↔ 𝐻:𝐴–1-1-onto→𝐶)) | |
| 2 | 1 | anbi1d 643 | . 2 ⊢ (𝐵 = 𝐶 → ((𝐻:𝐴–1-1-onto→𝐵 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ↔ (𝐻‘𝑥)𝑆(𝐻‘𝑦))) ↔ (𝐻:𝐴–1-1-onto→𝐶 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ↔ (𝐻‘𝑥)𝑆(𝐻‘𝑦))))) |
| 3 | df-isom 6549 | . 2 ⊢ (𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ↔ (𝐻:𝐴–1-1-onto→𝐵 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ↔ (𝐻‘𝑥)𝑆(𝐻‘𝑦)))) | |
| 4 | df-isom 6549 | . 2 ⊢ (𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐶) ↔ (𝐻:𝐴–1-1-onto→𝐶 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ↔ (𝐻‘𝑥)𝑆(𝐻‘𝑦)))) | |
| 5 | 2, 3, 4 | 3bitr4g 317 | 1 ⊢ (𝐵 = 𝐶 → (𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ↔ 𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐶))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∀wral 3081 class class class wbr 5111 –1-1-onto→wf1o 6539 ‘cfv 6540 Isom wiso 6541 |
| 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 1943 ax-6 2000 ax-7 2041 ax-9 2156 ax-ext 2737 |
| This proof depends on definitions: df-bi 210 df-an 402 df-ex 1813 df-cleq 2757 df-ss 3923 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-isom 6549 |
| This theorem is used by: isores3 7342 ordiso 9485 ordtypelem9 9495 ordtypelem10 9496 oiid 9510 iunfictbso 10114 ltweuz 14015 fz1isolem 14516 dvgt0lem2 26213 erdszelem1 35720 erdsze 35731 erdsze2lem1 35732 erdsze2lem2 35733 isoeq145d 44203 alephiso3 44343 fourierdlem50 46928 fourierdlem89 46967 fourierdlem90 46968 fourierdlem91 46969 fourierdlem96 46974 fourierdlem97 46975 fourierdlem98 46976 fourierdlem99 46977 fourierdlem100 46978 fourierdlem108 46986 fourierdlem110 46988 fourierdlem112 46990 fourierdlem113 46991 |
| Copyright terms: Public domain | W3C validator |