| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > isores2 | Structured version Visualization version GIF version | ||
| Description: An isomorphism from one well-order to another can be restricted on either well-order. (Contributed by Mario Carneiro, 15-Jan-2013.) |
| Ref | Expression |
|---|---|
| isores2 | ⊢ (𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ↔ 𝐻 Isom 𝑅, (𝑆 ∩ (𝐵 × 𝐵))(𝐴, 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | f1of 6854 | . . . . . . . 8 ⊢ (𝐻:𝐴⟶1-1onto𝐵 → 𝐻:𝐴⟶𝐵) | |
| 2 | ffvelcdm 7113 | . . . . . . . . . 10 ⊢ ((𝐻:𝐴⟶𝐵 ∧ 𝑥 ∈ 𝐴) → (𝐻‘𝑥) ∈ 𝐵) | |
| 3 | 2 | adantrr 730 | . . . . . . . . 9 ⊢ ((𝐻:𝐴⟶𝐵 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → (𝐻‘𝑥) ∈ 𝐵) |
| 4 | ffvelcdm 7113 | . . . . . . . . . 10 ⊢ ((𝐻:𝐴⟶𝐵 ∧ 𝑦 ∈ 𝐴) → (𝐻‘𝑦) ∈ 𝐵) | |
| 5 | 4 | adantrl 729 | . . . . . . . . 9 ⊢ ((𝐻:𝐴⟶𝐵 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → (𝐻‘𝑦) ∈ 𝐵) |
| 6 | brinxp 5738 | . . . . . . . . 9 ⊢ (((𝐻‘𝑥) ∈ 𝐵 ∧ (𝐻‘𝑦) ∈ 𝐵) → ((𝐻‘𝑥)𝑆(𝐻‘𝑦) ↔ (𝐻‘𝑥)(𝑆 ∩ (𝐵 × 𝐵))(𝐻‘𝑦))) | |
| 7 | 3, 5, 6 | syl2anc 596 | . . . . . . . 8 ⊢ ((𝐻:𝐴⟶𝐵 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → ((𝐻‘𝑥)𝑆(𝐻‘𝑦) ↔ (𝐻‘𝑥)(𝑆 ∩ (𝐵 × 𝐵))(𝐻‘𝑦))) |
| 8 | 1, 7 | sylan 592 | . . . . . . 7 ⊢ ((𝐻:𝐴⟶1-1onto𝐵 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → ((𝐻‘𝑥)𝑆(𝐻‘𝑦) ↔ (𝐻‘𝑥)(𝑆 ∩ (𝐵 × 𝐵))(𝐻‘𝑦))) |
| 9 | 8 | anassrs 473 | . . . . . 6 ⊢ (((𝐻:𝐴⟶1-1onto𝐵 ∧ 𝑥 ∈ 𝐴) ∧ 𝑦 ∈ 𝐴) → ((𝐻‘𝑥)𝑆(𝐻‘𝑦) ↔ (𝐻‘𝑥)(𝑆 ∩ (𝐵 × 𝐵))(𝐻‘𝑦))) |
| 10 | 9 | bibi2d 345 | . . . . 5 ⊢ (((𝐻:𝐴⟶1-1onto𝐵 ∧ 𝑥 ∈ 𝐴) ∧ 𝑦 ∈ 𝐴) → ((𝑥𝑅𝑦 ↔ (𝐻‘𝑥)𝑆(𝐻‘𝑦)) ↔ (𝑥𝑅𝑦 ↔ (𝐻‘𝑥)(𝑆 ∩ (𝐵 × 𝐵))(𝐻‘𝑦)))) |
| 11 | 10 | ralbidva 3187 | . . . 4 ⊢ ((𝐻:𝐴⟶1-1onto𝐵 ∧ 𝑥 ∈ 𝐴) → (∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ↔ (𝐻‘𝑥)𝑆(𝐻‘𝑦)) ↔ ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ↔ (𝐻‘𝑥)(𝑆 ∩ (𝐵 × 𝐵))(𝐻‘𝑦)))) |
| 12 | 11 | ralbidva 3187 | . . 3 ⊢ (𝐻:𝐴⟶1-1onto𝐵 → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ↔ (𝐻‘𝑥)𝑆(𝐻‘𝑦)) ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ↔ (𝐻‘𝑥)(𝑆 ∩ (𝐵 × 𝐵))(𝐻‘𝑦)))) |
| 13 | 12 | pm5.32i 585 | . 2 ⊢ ((𝐻:𝐴⟶1-1onto𝐵 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ↔ (𝐻‘𝑥)𝑆(𝐻‘𝑦))) ↔ (𝐻:𝐴⟶1-1onto𝐵 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ↔ (𝐻‘𝑥)(𝑆 ∩ (𝐵 × 𝐵))(𝐻‘𝑦)))) |
| 14 | df-isom 6575 | . 2 ⊢ (𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ↔ (𝐻:𝐴⟶1-1onto𝐵 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ↔ (𝐻‘𝑥)𝑆(𝐻‘𝑦)))) | |
| 15 | df-isom 6575 | . 2 ⊢ (𝐻 Isom 𝑅, (𝑆 ∩ (𝐵 × 𝐵))(𝐴, 𝐵) ↔ (𝐻:𝐴⟶1-1onto𝐵 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ↔ (𝐻‘𝑥)(𝑆 ∩ (𝐵 × 𝐵))(𝐻‘𝑦)))) | |
| 16 | 13, 14, 15 | 3bitr4i 306 | 1 ⊢ (𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ↔ 𝐻 Isom 𝑅, (𝑆 ∩ (𝐵 × 𝐵))(𝐴, 𝐵)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 ∧ wa 401 ∈ wcel 2147 ∀wral 3080 ∩ cin 4092 class class class wbr 5108 × cxp 5656 ⟶wf 6562 ⟶1-1ontowf1o 6565 ‘cfv 6566 Isom wiso 6567 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-12 2216 ax-ext 2735 ax-sep 5255 ax-nul 5266 ax-pr 5398 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-ne 2960 df-ral 3081 df-rex 3091 df-rab 3417 df-v 3456 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-br 5109 df-opab 5174 df-id 5553 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-f1o 6573 df-fv 6574 df-isom 6575 |
| This theorem is used by: isores1 7373 hartogslem1 9573 leiso 14645 icopnfhmeo 25319 iccpnfhmeo 25321 gtiso 33391 xrge0iifhmeo 34679 |
| Copyright terms: Public domain | W3C validator |