MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  isores2 Structured version   Visualization version   GIF version

Theorem isores2 6583
Description: An isomorphism from one well-order to another can be restricted on either well-order. (Contributed by Mario Carneiro, 15-Jan-2013.)
Assertion
Ref Expression
isores2 (𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ↔ 𝐻 Isom 𝑅, (𝑆 ∩ (𝐵 × 𝐵))(𝐴, 𝐵))

Proof of Theorem isores2
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 f1of 6137 . . . . . . . 8 (𝐻:𝐴1-1-onto𝐵𝐻:𝐴𝐵)
2 ffvelrn 6357 . . . . . . . . . 10 ((𝐻:𝐴𝐵𝑥𝐴) → (𝐻𝑥) ∈ 𝐵)
32adantrr 753 . . . . . . . . 9 ((𝐻:𝐴𝐵 ∧ (𝑥𝐴𝑦𝐴)) → (𝐻𝑥) ∈ 𝐵)
4 ffvelrn 6357 . . . . . . . . . 10 ((𝐻:𝐴𝐵𝑦𝐴) → (𝐻𝑦) ∈ 𝐵)
54adantrl 752 . . . . . . . . 9 ((𝐻:𝐴𝐵 ∧ (𝑥𝐴𝑦𝐴)) → (𝐻𝑦) ∈ 𝐵)
6 brinxp 5181 . . . . . . . . 9 (((𝐻𝑥) ∈ 𝐵 ∧ (𝐻𝑦) ∈ 𝐵) → ((𝐻𝑥)𝑆(𝐻𝑦) ↔ (𝐻𝑥)(𝑆 ∩ (𝐵 × 𝐵))(𝐻𝑦)))
73, 5, 6syl2anc 693 . . . . . . . 8 ((𝐻:𝐴𝐵 ∧ (𝑥𝐴𝑦𝐴)) → ((𝐻𝑥)𝑆(𝐻𝑦) ↔ (𝐻𝑥)(𝑆 ∩ (𝐵 × 𝐵))(𝐻𝑦)))
81, 7sylan 488 . . . . . . 7 ((𝐻:𝐴1-1-onto𝐵 ∧ (𝑥𝐴𝑦𝐴)) → ((𝐻𝑥)𝑆(𝐻𝑦) ↔ (𝐻𝑥)(𝑆 ∩ (𝐵 × 𝐵))(𝐻𝑦)))
98anassrs 680 . . . . . 6 (((𝐻:𝐴1-1-onto𝐵𝑥𝐴) ∧ 𝑦𝐴) → ((𝐻𝑥)𝑆(𝐻𝑦) ↔ (𝐻𝑥)(𝑆 ∩ (𝐵 × 𝐵))(𝐻𝑦)))
109bibi2d 332 . . . . 5 (((𝐻:𝐴1-1-onto𝐵𝑥𝐴) ∧ 𝑦𝐴) → ((𝑥𝑅𝑦 ↔ (𝐻𝑥)𝑆(𝐻𝑦)) ↔ (𝑥𝑅𝑦 ↔ (𝐻𝑥)(𝑆 ∩ (𝐵 × 𝐵))(𝐻𝑦))))
1110ralbidva 2985 . . . 4 ((𝐻:𝐴1-1-onto𝐵𝑥𝐴) → (∀𝑦𝐴 (𝑥𝑅𝑦 ↔ (𝐻𝑥)𝑆(𝐻𝑦)) ↔ ∀𝑦𝐴 (𝑥𝑅𝑦 ↔ (𝐻𝑥)(𝑆 ∩ (𝐵 × 𝐵))(𝐻𝑦))))
1211ralbidva 2985 . . 3 (𝐻:𝐴1-1-onto𝐵 → (∀𝑥𝐴𝑦𝐴 (𝑥𝑅𝑦 ↔ (𝐻𝑥)𝑆(𝐻𝑦)) ↔ ∀𝑥𝐴𝑦𝐴 (𝑥𝑅𝑦 ↔ (𝐻𝑥)(𝑆 ∩ (𝐵 × 𝐵))(𝐻𝑦))))
1312pm5.32i 669 . 2 ((𝐻:𝐴1-1-onto𝐵 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥𝑅𝑦 ↔ (𝐻𝑥)𝑆(𝐻𝑦))) ↔ (𝐻:𝐴1-1-onto𝐵 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥𝑅𝑦 ↔ (𝐻𝑥)(𝑆 ∩ (𝐵 × 𝐵))(𝐻𝑦))))
14 df-isom 5897 . 2 (𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ↔ (𝐻:𝐴1-1-onto𝐵 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥𝑅𝑦 ↔ (𝐻𝑥)𝑆(𝐻𝑦))))
15 df-isom 5897 . 2 (𝐻 Isom 𝑅, (𝑆 ∩ (𝐵 × 𝐵))(𝐴, 𝐵) ↔ (𝐻:𝐴1-1-onto𝐵 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥𝑅𝑦 ↔ (𝐻𝑥)(𝑆 ∩ (𝐵 × 𝐵))(𝐻𝑦))))
1613, 14, 153bitr4i 292 1 (𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ↔ 𝐻 Isom 𝑅, (𝑆 ∩ (𝐵 × 𝐵))(𝐴, 𝐵))
Colors of variables: wff setvar class
Syntax hints:  wb 196  wa 384  wcel 1990  wral 2912  cin 3573   class class class wbr 4653   × cxp 5112  wf 5884  1-1-ontowf1o 5887  cfv 5888   Isom wiso 5889
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pr 4906
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ral 2917  df-rex 2918  df-rab 2921  df-v 3202  df-sbc 3436  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-br 4654  df-opab 4713  df-id 5024  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-f1o 5895  df-fv 5896  df-isom 5897
This theorem is referenced by:  isores1  6584  hartogslem1  8447  leiso  13243  icopnfhmeo  22742  iccpnfhmeo  22744  gtiso  29478  xrge0iifhmeo  29982
  Copyright terms: Public domain W3C validator