Intuitionistic Logic Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  ILE Home  >  Th. List  >  isores1 GIF version

Theorem isores1 5482
 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
isores1 (𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ↔ 𝐻 Isom (𝑅 ∩ (𝐴 × 𝐴)), 𝑆(𝐴, 𝐵))

Proof of Theorem isores1
StepHypRef Expression
1 isocnv 5479 . . . . 5 (𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) → 𝐻 Isom 𝑆, 𝑅 (𝐵, 𝐴))
2 isores2 5481 . . . . 5 (𝐻 Isom 𝑆, 𝑅 (𝐵, 𝐴) ↔ 𝐻 Isom 𝑆, (𝑅 ∩ (𝐴 × 𝐴))(𝐵, 𝐴))
31, 2sylib 131 . . . 4 (𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) → 𝐻 Isom 𝑆, (𝑅 ∩ (𝐴 × 𝐴))(𝐵, 𝐴))
4 isocnv 5479 . . . 4 (𝐻 Isom 𝑆, (𝑅 ∩ (𝐴 × 𝐴))(𝐵, 𝐴) → 𝐻 Isom (𝑅 ∩ (𝐴 × 𝐴)), 𝑆(𝐴, 𝐵))
53, 4syl 14 . . 3 (𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) → 𝐻 Isom (𝑅 ∩ (𝐴 × 𝐴)), 𝑆(𝐴, 𝐵))
6 isof1o 5475 . . . 4 (𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) → 𝐻:𝐴1-1-onto𝐵)
7 f1orel 5157 . . . 4 (𝐻:𝐴1-1-onto𝐵 → Rel 𝐻)
8 dfrel2 4799 . . . . 5 (Rel 𝐻𝐻 = 𝐻)
9 isoeq1 5469 . . . . 5 (𝐻 = 𝐻 → (𝐻 Isom (𝑅 ∩ (𝐴 × 𝐴)), 𝑆(𝐴, 𝐵) ↔ 𝐻 Isom (𝑅 ∩ (𝐴 × 𝐴)), 𝑆(𝐴, 𝐵)))
108, 9sylbi 118 . . . 4 (Rel 𝐻 → (𝐻 Isom (𝑅 ∩ (𝐴 × 𝐴)), 𝑆(𝐴, 𝐵) ↔ 𝐻 Isom (𝑅 ∩ (𝐴 × 𝐴)), 𝑆(𝐴, 𝐵)))
116, 7, 103syl 17 . . 3 (𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) → (𝐻 Isom (𝑅 ∩ (𝐴 × 𝐴)), 𝑆(𝐴, 𝐵) ↔ 𝐻 Isom (𝑅 ∩ (𝐴 × 𝐴)), 𝑆(𝐴, 𝐵)))
125, 11mpbid 139 . 2 (𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) → 𝐻 Isom (𝑅 ∩ (𝐴 × 𝐴)), 𝑆(𝐴, 𝐵))
13 isocnv 5479 . . . . 5 (𝐻 Isom (𝑅 ∩ (𝐴 × 𝐴)), 𝑆(𝐴, 𝐵) → 𝐻 Isom 𝑆, (𝑅 ∩ (𝐴 × 𝐴))(𝐵, 𝐴))
1413, 2sylibr 141 . . . 4 (𝐻 Isom (𝑅 ∩ (𝐴 × 𝐴)), 𝑆(𝐴, 𝐵) → 𝐻 Isom 𝑆, 𝑅 (𝐵, 𝐴))
15 isocnv 5479 . . . 4 (𝐻 Isom 𝑆, 𝑅 (𝐵, 𝐴) → 𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵))
1614, 15syl 14 . . 3 (𝐻 Isom (𝑅 ∩ (𝐴 × 𝐴)), 𝑆(𝐴, 𝐵) → 𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵))
17 isof1o 5475 . . . 4 (𝐻 Isom (𝑅 ∩ (𝐴 × 𝐴)), 𝑆(𝐴, 𝐵) → 𝐻:𝐴1-1-onto𝐵)
18 isoeq1 5469 . . . . 5 (𝐻 = 𝐻 → (𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ↔ 𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵)))
198, 18sylbi 118 . . . 4 (Rel 𝐻 → (𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ↔ 𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵)))
2017, 7, 193syl 17 . . 3 (𝐻 Isom (𝑅 ∩ (𝐴 × 𝐴)), 𝑆(𝐴, 𝐵) → (𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ↔ 𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵)))
2116, 20mpbid 139 . 2 (𝐻 Isom (𝑅 ∩ (𝐴 × 𝐴)), 𝑆(𝐴, 𝐵) → 𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵))
2212, 21impbii 121 1 (𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ↔ 𝐻 Isom (𝑅 ∩ (𝐴 × 𝐴)), 𝑆(𝐴, 𝐵))
 Colors of variables: wff set class Syntax hints:   ↔ wb 102   = wceq 1259   ∩ cin 2944   × cxp 4371  ◡ccnv 4372  Rel wrel 4378  –1-1-onto→wf1o 4929   Isom wiso 4931 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 103  ax-ia2 104  ax-ia3 105  ax-io 640  ax-5 1352  ax-7 1353  ax-gen 1354  ax-ie1 1398  ax-ie2 1399  ax-8 1411  ax-10 1412  ax-11 1413  ax-i12 1414  ax-bndl 1415  ax-4 1416  ax-14 1421  ax-17 1435  ax-i9 1439  ax-ial 1443  ax-i5r 1444  ax-ext 2038  ax-sep 3903  ax-pow 3955  ax-pr 3972 This theorem depends on definitions:  df-bi 114  df-3an 898  df-tru 1262  df-nf 1366  df-sb 1662  df-eu 1919  df-mo 1920  df-clab 2043  df-cleq 2049  df-clel 2052  df-nfc 2183  df-ral 2328  df-rex 2329  df-v 2576  df-sbc 2788  df-un 2950  df-in 2952  df-ss 2959  df-pw 3389  df-sn 3409  df-pr 3410  df-op 3412  df-uni 3609  df-br 3793  df-opab 3847  df-id 4058  df-xp 4379  df-rel 4380  df-cnv 4381  df-co 4382  df-dm 4383  df-rn 4384  df-res 4385  df-ima 4386  df-iota 4895  df-fun 4932  df-fn 4933  df-f 4934  df-f1 4935  df-fo 4936  df-f1o 4937  df-fv 4938  df-isom 4939 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator