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

Theorem isores2 7329
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 6818 . . . . . . . 8 (𝐻:𝐴1-1-onto𝐵𝐻:𝐴𝐵)
2 ffvelcdm 7074 . . . . . . . . . 10 ((𝐻:𝐴𝐵𝑥𝐴) → (𝐻𝑥) ∈ 𝐵)
32adantrr 729 . . . . . . . . 9 ((𝐻:𝐴𝐵 ∧ (𝑥𝐴𝑦𝐴)) → (𝐻𝑥) ∈ 𝐵)
4 ffvelcdm 7074 . . . . . . . . . 10 ((𝐻:𝐴𝐵𝑦𝐴) → (𝐻𝑦) ∈ 𝐵)
54adantrl 728 . . . . . . . . 9 ((𝐻:𝐴𝐵 ∧ (𝑥𝐴𝑦𝐴)) → (𝐻𝑦) ∈ 𝐵)
6 brinxp 5738 . . . . . . . . 9 (((𝐻𝑥) ∈ 𝐵 ∧ (𝐻𝑦) ∈ 𝐵) → ((𝐻𝑥)𝑆(𝐻𝑦) ↔ (𝐻𝑥)(𝑆 ∩ (𝐵 × 𝐵))(𝐻𝑦)))
73, 5, 6syl2anc 595 . . . . . . . 8 ((𝐻:𝐴𝐵 ∧ (𝑥𝐴𝑦𝐴)) → ((𝐻𝑥)𝑆(𝐻𝑦) ↔ (𝐻𝑥)(𝑆 ∩ (𝐵 × 𝐵))(𝐻𝑦)))
81, 7sylan 591 . . . . . . 7 ((𝐻:𝐴1-1-onto𝐵 ∧ (𝑥𝐴𝑦𝐴)) → ((𝐻𝑥)𝑆(𝐻𝑦) ↔ (𝐻𝑥)(𝑆 ∩ (𝐵 × 𝐵))(𝐻𝑦)))
98anassrs 472 . . . . . 6 (((𝐻:𝐴1-1-onto𝐵𝑥𝐴) ∧ 𝑦𝐴) → ((𝐻𝑥)𝑆(𝐻𝑦) ↔ (𝐻𝑥)(𝑆 ∩ (𝐵 × 𝐵))(𝐻𝑦)))
109bibi2d 345 . . . . 5 (((𝐻:𝐴1-1-onto𝐵𝑥𝐴) ∧ 𝑦𝐴) → ((𝑥𝑅𝑦 ↔ (𝐻𝑥)𝑆(𝐻𝑦)) ↔ (𝑥𝑅𝑦 ↔ (𝐻𝑥)(𝑆 ∩ (𝐵 × 𝐵))(𝐻𝑦))))
1110ralbidva 3192 . . . 4 ((𝐻:𝐴1-1-onto𝐵𝑥𝐴) → (∀𝑦𝐴 (𝑥𝑅𝑦 ↔ (𝐻𝑥)𝑆(𝐻𝑦)) ↔ ∀𝑦𝐴 (𝑥𝑅𝑦 ↔ (𝐻𝑥)(𝑆 ∩ (𝐵 × 𝐵))(𝐻𝑦))))
1211ralbidva 3192 . . 3 (𝐻:𝐴1-1-onto𝐵 → (∀𝑥𝐴𝑦𝐴 (𝑥𝑅𝑦 ↔ (𝐻𝑥)𝑆(𝐻𝑦)) ↔ ∀𝑥𝐴𝑦𝐴 (𝑥𝑅𝑦 ↔ (𝐻𝑥)(𝑆 ∩ (𝐵 × 𝐵))(𝐻𝑦))))
1312pm5.32i 584 . 2 ((𝐻:𝐴1-1-onto𝐵 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥𝑅𝑦 ↔ (𝐻𝑥)𝑆(𝐻𝑦))) ↔ (𝐻:𝐴1-1-onto𝐵 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥𝑅𝑦 ↔ (𝐻𝑥)(𝑆 ∩ (𝐵 × 𝐵))(𝐻𝑦))))
14 df-isom 6542 . 2 (𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ↔ (𝐻:𝐴1-1-onto𝐵 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥𝑅𝑦 ↔ (𝐻𝑥)𝑆(𝐻𝑦))))
15 df-isom 6542 . 2 (𝐻 Isom 𝑅, (𝑆 ∩ (𝐵 × 𝐵))(𝐴, 𝐵) ↔ (𝐻:𝐴1-1-onto𝐵 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥𝑅𝑦 ↔ (𝐻𝑥)(𝑆 ∩ (𝐵 × 𝐵))(𝐻𝑦))))
1613, 14, 153bitr4i 306 1 (𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ↔ 𝐻 Isom 𝑅, (𝑆 ∩ (𝐵 × 𝐵))(𝐴, 𝐵))
Colors of variables: wff setvar class
Syntax hints:  wb 209  wa 400  wcel 2149  wral 3085  cin 3912   class class class wbr 5110   × cxp 5657  wf 6529  1-1-ontowf1o 6532  cfv 6533   Isom wiso 6534
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-12 2219  ax-ext 2741  ax-sep 5258  ax-nul 5268  ax-pr 5402
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-ne 2965  df-ral 3086  df-rex 3096  df-rab 3424  df-v 3465  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4874  df-br 5111  df-opab 5175  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-f1o 6540  df-fv 6541  df-isom 6542
This theorem is referenced by:  isores1  7330  hartogslem1  9500  leiso  14492  icopnfhmeo  25067  iccpnfhmeo  25069  gtiso  32983  xrge0iifhmeo  34267
  Copyright terms: Public domain W3C validator