| 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 6812 | . . 3 ⊢ (𝐵 = 𝐶 → (𝐻:𝐴–1-1-onto→𝐵 ↔ 𝐻:𝐴–1-1-onto→𝐶)) | |
| 2 | 1 | anbi1d 643 | . 2 ⊢ (𝐵 = 𝐶 → ((𝐻:𝐴–1-1-onto→𝐵 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ↔ (𝐻‘𝑥)𝑆(𝐻‘𝑦))) ↔ (𝐻:𝐴–1-1-onto→𝐶 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ↔ (𝐻‘𝑥)𝑆(𝐻‘𝑦))))) |
| 3 | df-isom 6546 | . 2 ⊢ (𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ↔ (𝐻:𝐴–1-1-onto→𝐵 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ↔ (𝐻‘𝑥)𝑆(𝐻‘𝑦)))) | |
| 4 | df-isom 6546 | . 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 3077 class class class wbr 5103 –1-1-onto→wf1o 6536 ‘cfv 6537 Isom wiso 6538 |
| 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 2733 |
| This proof depends on definitions: df-bi 210 df-an 402 df-ex 1813 df-cleq 2753 df-ss 3916 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-isom 6546 |
| This theorem is used by: isores3 7341 ordiso 9503 ordtypelem9 9513 ordtypelem10 9514 oiid 9528 iunfictbso 10186 ltweuz 14097 fz1isolem 14599 dvgt0lem2 26316 erdszelem1 35935 erdsze 35946 erdsze2lem1 35947 erdsze2lem2 35948 isoeq145d 44404 alephiso3 44544 fourierdlem50 47135 fourierdlem89 47174 fourierdlem90 47175 fourierdlem91 47176 fourierdlem96 47181 fourierdlem97 47182 fourierdlem98 47183 fourierdlem99 47184 fourierdlem100 47185 fourierdlem108 47193 fourierdlem110 47195 fourierdlem112 47197 fourierdlem113 47198 |
| Copyright terms: Public domain | W3C validator |