| 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 6807 | . . 3 ⊢ (𝐵 = 𝐶 → (𝐻:𝐴–1-1-onto→𝐵 ↔ 𝐻:𝐴–1-1-onto→𝐶)) | |
| 2 | 1 | anbi1d 643 | . 2 ⊢ (𝐵 = 𝐶 → ((𝐻:𝐴–1-1-onto→𝐵 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ↔ (𝐻‘𝑥)𝑆(𝐻‘𝑦))) ↔ (𝐻:𝐴–1-1-onto→𝐶 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ↔ (𝐻‘𝑥)𝑆(𝐻‘𝑦))))) |
| 3 | df-isom 6542 | . 2 ⊢ (𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ↔ (𝐻:𝐴–1-1-onto→𝐵 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ↔ (𝐻‘𝑥)𝑆(𝐻‘𝑦)))) | |
| 4 | df-isom 6542 | . 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 3076 class class class wbr 5103 –1-1-onto→wf1o 6532 ‘cfv 6533 Isom wiso 6534 |
| 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 2155 ax-ext 2732 |
| This proof depends on definitions: df-bi 210 df-an 402 df-ex 1813 df-cleq 2752 df-ss 3916 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-isom 6542 |
| This theorem is used by: isores3 7336 ordiso 9488 ordtypelem9 9498 ordtypelem10 9499 oiid 9513 iunfictbso 10117 ltweuz 14025 fz1isolem 14526 dvgt0lem2 26230 erdszelem1 35770 erdsze 35781 erdsze2lem1 35782 erdsze2lem2 35783 isoeq145d 44259 alephiso3 44399 fourierdlem50 46984 fourierdlem89 47023 fourierdlem90 47024 fourierdlem91 47025 fourierdlem96 47030 fourierdlem97 47031 fourierdlem98 47032 fourierdlem99 47033 fourierdlem100 47034 fourierdlem108 47042 fourierdlem110 47044 fourierdlem112 47046 fourierdlem113 47047 |
| Copyright terms: Public domain | W3C validator |