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

Theorem isores2 7343
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 6827 . . . . . . . 8 (𝐻:𝐴–1-1-onto→𝐵 → 𝐻:𝐴⟶𝐵)
2 ffvelcdm 7084 . . . . . . . . . 10 ((𝐻:𝐴⟶𝐵 ∧ 𝑥 ∈ 𝐴) → (𝐻‘𝑥) ∈ 𝐵)
32adantrr 730 . . . . . . . . 9 ((𝐻:𝐴⟶𝐵 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → (𝐻‘𝑥) ∈ 𝐵)
4 ffvelcdm 7084 . . . . . . . . . 10 ((𝐻:𝐴⟶𝐵 ∧ 𝑦 ∈ 𝐴) → (𝐻‘𝑦) ∈ 𝐵)
54adantrl 729 . . . . . . . . 9 ((𝐻:𝐴⟶𝐵 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → (𝐻‘𝑦) ∈ 𝐵)
6 brinxp 5730 . . . . . . . . 9 (((𝐻‘𝑥) ∈ 𝐵 ∧ (𝐻‘𝑦) ∈ 𝐵) → ((𝐻‘𝑥)𝑆(𝐻‘𝑦) ↔ (𝐻‘𝑥)(𝑆 ∩ (𝐵 × 𝐵))(𝐻‘𝑦)))
73, 5, 6syl2anc 596 . . . . . . . 8 ((𝐻:𝐴⟶𝐵 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → ((𝐻‘𝑥)𝑆(𝐻‘𝑦) ↔ (𝐻‘𝑥)(𝑆 ∩ (𝐵 × 𝐵))(𝐻‘𝑦)))
81, 7sylan 592 . . . . . . 7 ((𝐻:𝐴–1-1-onto→𝐵 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → ((𝐻‘𝑥)𝑆(𝐻‘𝑦) ↔ (𝐻‘𝑥)(𝑆 ∩ (𝐵 × 𝐵))(𝐻‘𝑦)))
98anassrs 473 . . . . . 6 (((𝐻:𝐴–1-1-onto→𝐵 ∧ 𝑥 ∈ 𝐴) ∧ 𝑦 ∈ 𝐴) → ((𝐻‘𝑥)𝑆(𝐻‘𝑦) ↔ (𝐻‘𝑥)(𝑆 ∩ (𝐵 × 𝐵))(𝐻‘𝑦)))
109bibi2d 345 . . . . 5 (((𝐻:𝐴–1-1-onto→𝐵 ∧ 𝑥 ∈ 𝐴) ∧ 𝑦 ∈ 𝐴) → ((𝑥𝑅𝑦 ↔ (𝐻‘𝑥)𝑆(𝐻‘𝑦)) ↔ (𝑥𝑅𝑦 ↔ (𝐻‘𝑥)(𝑆 ∩ (𝐵 × 𝐵))(𝐻‘𝑦))))
1110ralbidva 3183 . . . 4 ((𝐻:𝐴–1-1-onto→𝐵 ∧ 𝑥 ∈ 𝐴) → (∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ↔ (𝐻‘𝑥)𝑆(𝐻‘𝑦)) ↔ ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ↔ (𝐻‘𝑥)(𝑆 ∩ (𝐵 × 𝐵))(𝐻‘𝑦))))
1211ralbidva 3183 . . 3 (𝐻:𝐴–1-1-onto→𝐵 → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ↔ (𝐻‘𝑥)𝑆(𝐻‘𝑦)) ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ↔ (𝐻‘𝑥)(𝑆 ∩ (𝐵 × 𝐵))(𝐻‘𝑦))))
1312pm5.32i 585 . 2 ((𝐻:𝐴–1-1-onto→𝐵 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ↔ (𝐻‘𝑥)𝑆(𝐻‘𝑦))) ↔ (𝐻:𝐴–1-1-onto→𝐵 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ↔ (𝐻‘𝑥)(𝑆 ∩ (𝐵 × 𝐵))(𝐻‘𝑦))))
14 df-isom 6550 . 2 (𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ↔ (𝐻:𝐴–1-1-onto→𝐵 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ↔ (𝐻‘𝑥)𝑆(𝐻‘𝑦))))
15 df-isom 6550 . 2 (𝐻 Isom 𝑅, (𝑆 ∩ (𝐵 × 𝐵))(𝐴, 𝐵) ↔ (𝐻:𝐴–1-1-onto→𝐵 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ↔ (𝐻‘𝑥)(𝑆 ∩ (𝐵 × 𝐵))(𝐻‘𝑦))))
1613, 14, 153bitr4i 306 1 (𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ↔ 𝐻 Isom 𝑅, (𝑆 ∩ (𝐵 × 𝐵))(𝐴, 𝐵))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   ∈ wcel 2144  ∀wral 3076   ∩ cin 4088   class class class wbr 5102   × cxp 5648  ⟶wf 6537  –1-1-onto→wf1o 6540  ‘cfv 6541   Isom wiso 6542
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-8 2146  ax-9 2154  ax-10 2177  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5390
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3897  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-opab 5167  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-iota 6496  df-fun 6543  df-fn 6544  df-f 6545  df-f1 6546  df-f1o 6548  df-fv 6549  df-isom 6550
This theorem is used by:  isores1  7344  hartogslem1  9541  leiso  14609  icopnfhmeo  25271  iccpnfhmeo  25273  gtiso  33343  xrge0iifhmeo  34616
  Copyright terms: Public domain W3C validator