| 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 6819 | . . 3 ⊢ (𝐵 = 𝐶 → (𝐻:𝐴–1-1-onto→𝐵 ↔ 𝐻:𝐴–1-1-onto→𝐶)) | |
| 2 | 1 | anbi1d 643 | . 2 ⊢ (𝐵 = 𝐶 → ((𝐻:𝐴–1-1-onto→𝐵 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ↔ (𝐻‘𝑥)𝑆(𝐻‘𝑦))) ↔ (𝐻:𝐴–1-1-onto→𝐶 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ↔ (𝐻‘𝑥)𝑆(𝐻‘𝑦))))) |
| 3 | df-isom 6552 | . 2 ⊢ (𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ↔ (𝐻:𝐴–1-1-onto→𝐵 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ↔ (𝐻‘𝑥)𝑆(𝐻‘𝑦)))) | |
| 4 | df-isom 6552 | . 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 1569 ∀wral 3076 class class class wbr 5102 –1-1-onto→wf1o 6542 ‘cfv 6543 Isom wiso 6544 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-9 2154 ax-ext 2732 |
| This proof depends on definitions: df-bi 210 df-an 402 df-ex 1812 df-cleq 2752 df-ss 3897 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-isom 6552 |
| This theorem is used by: isores3 7347 ordiso 9517 ordtypelem9 9527 ordtypelem10 9528 oiid 9542 iunfictbso 10200 ltweuz 14111 fz1isolem 14613 dvgt0lem2 26332 erdszelem1 36046 erdsze 36057 erdsze2lem1 36058 erdsze2lem2 36059 isoeq145d 44529 alephiso3 44669 fourierdlem50 47274 fourierdlem89 47313 fourierdlem90 47314 fourierdlem91 47315 fourierdlem96 47320 fourierdlem97 47321 fourierdlem98 47322 fourierdlem99 47323 fourierdlem100 47324 fourierdlem108 47332 fourierdlem110 47334 fourierdlem112 47336 fourierdlem113 47337 |
| Copyright terms: Public domain | W3C validator |