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 6610 | . . . . . . . 8 ⊢ (𝐻:𝐴–1-1-onto→𝐵 → 𝐻:𝐴⟶𝐵) | |
2 | ffvelrn 6844 | . . . . . . . . . 10 ⊢ ((𝐻:𝐴⟶𝐵 ∧ 𝑥 ∈ 𝐴) → (𝐻‘𝑥) ∈ 𝐵) | |
3 | 2 | adantrr 715 | . . . . . . . . 9 ⊢ ((𝐻:𝐴⟶𝐵 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → (𝐻‘𝑥) ∈ 𝐵) |
4 | ffvelrn 6844 | . . . . . . . . . 10 ⊢ ((𝐻:𝐴⟶𝐵 ∧ 𝑦 ∈ 𝐴) → (𝐻‘𝑦) ∈ 𝐵) | |
5 | 4 | adantrl 714 | . . . . . . . . 9 ⊢ ((𝐻:𝐴⟶𝐵 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → (𝐻‘𝑦) ∈ 𝐵) |
6 | brinxp 5625 | . . . . . . . . 9 ⊢ (((𝐻‘𝑥) ∈ 𝐵 ∧ (𝐻‘𝑦) ∈ 𝐵) → ((𝐻‘𝑥)𝑆(𝐻‘𝑦) ↔ (𝐻‘𝑥)(𝑆 ∩ (𝐵 × 𝐵))(𝐻‘𝑦))) | |
7 | 3, 5, 6 | syl2anc 586 | . . . . . . . 8 ⊢ ((𝐻:𝐴⟶𝐵 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → ((𝐻‘𝑥)𝑆(𝐻‘𝑦) ↔ (𝐻‘𝑥)(𝑆 ∩ (𝐵 × 𝐵))(𝐻‘𝑦))) |
8 | 1, 7 | sylan 582 | . . . . . . 7 ⊢ ((𝐻:𝐴–1-1-onto→𝐵 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → ((𝐻‘𝑥)𝑆(𝐻‘𝑦) ↔ (𝐻‘𝑥)(𝑆 ∩ (𝐵 × 𝐵))(𝐻‘𝑦))) |
9 | 8 | anassrs 470 | . . . . . 6 ⊢ (((𝐻:𝐴–1-1-onto→𝐵 ∧ 𝑥 ∈ 𝐴) ∧ 𝑦 ∈ 𝐴) → ((𝐻‘𝑥)𝑆(𝐻‘𝑦) ↔ (𝐻‘𝑥)(𝑆 ∩ (𝐵 × 𝐵))(𝐻‘𝑦))) |
10 | 9 | bibi2d 345 | . . . . 5 ⊢ (((𝐻:𝐴–1-1-onto→𝐵 ∧ 𝑥 ∈ 𝐴) ∧ 𝑦 ∈ 𝐴) → ((𝑥𝑅𝑦 ↔ (𝐻‘𝑥)𝑆(𝐻‘𝑦)) ↔ (𝑥𝑅𝑦 ↔ (𝐻‘𝑥)(𝑆 ∩ (𝐵 × 𝐵))(𝐻‘𝑦)))) |
11 | 10 | ralbidva 3196 | . . . 4 ⊢ ((𝐻:𝐴–1-1-onto→𝐵 ∧ 𝑥 ∈ 𝐴) → (∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ↔ (𝐻‘𝑥)𝑆(𝐻‘𝑦)) ↔ ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ↔ (𝐻‘𝑥)(𝑆 ∩ (𝐵 × 𝐵))(𝐻‘𝑦)))) |
12 | 11 | ralbidva 3196 | . . 3 ⊢ (𝐻:𝐴–1-1-onto→𝐵 → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ↔ (𝐻‘𝑥)𝑆(𝐻‘𝑦)) ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ↔ (𝐻‘𝑥)(𝑆 ∩ (𝐵 × 𝐵))(𝐻‘𝑦)))) |
13 | 12 | pm5.32i 577 | . 2 ⊢ ((𝐻:𝐴–1-1-onto→𝐵 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ↔ (𝐻‘𝑥)𝑆(𝐻‘𝑦))) ↔ (𝐻:𝐴–1-1-onto→𝐵 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ↔ (𝐻‘𝑥)(𝑆 ∩ (𝐵 × 𝐵))(𝐻‘𝑦)))) |
14 | df-isom 6359 | . 2 ⊢ (𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ↔ (𝐻:𝐴–1-1-onto→𝐵 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ↔ (𝐻‘𝑥)𝑆(𝐻‘𝑦)))) | |
15 | df-isom 6359 | . 2 ⊢ (𝐻 Isom 𝑅, (𝑆 ∩ (𝐵 × 𝐵))(𝐴, 𝐵) ↔ (𝐻:𝐴–1-1-onto→𝐵 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ↔ (𝐻‘𝑥)(𝑆 ∩ (𝐵 × 𝐵))(𝐻‘𝑦)))) | |
16 | 13, 14, 15 | 3bitr4i 305 | 1 ⊢ (𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ↔ 𝐻 Isom 𝑅, (𝑆 ∩ (𝐵 × 𝐵))(𝐴, 𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 208 ∧ wa 398 ∈ wcel 2110 ∀wral 3138 ∩ cin 3935 class class class wbr 5059 × cxp 5548 ⟶wf 6346 –1-1-onto→wf1o 6349 ‘cfv 6350 Isom wiso 6351 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2156 ax-12 2172 ax-ext 2793 ax-sep 5196 ax-nul 5203 ax-pr 5322 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ral 3143 df-rex 3144 df-rab 3147 df-v 3497 df-sbc 3773 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-nul 4292 df-if 4468 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4833 df-br 5060 df-opab 5122 df-id 5455 df-xp 5556 df-rel 5557 df-cnv 5558 df-co 5559 df-dm 5560 df-rn 5561 df-iota 6309 df-fun 6352 df-fn 6353 df-f 6354 df-f1 6355 df-f1o 6357 df-fv 6358 df-isom 6359 |
This theorem is referenced by: isores1 7081 hartogslem1 9000 leiso 13811 icopnfhmeo 23541 iccpnfhmeo 23543 gtiso 30430 xrge0iifhmeo 31174 |
Copyright terms: Public domain | W3C validator |