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

Theorem smoiso 6563
Description: If 𝐹 is an isomorphism from an ordinal 𝐴 onto 𝐵, which is a subset of the ordinals, then 𝐹 is a strictly monotonic function. Exercise 3 in [TakeutiZaring] p. 50. (Contributed by Andrew Salmon, 24-Nov-2011.)
Assertion
Ref Expression
smoiso ((𝐹 Isom E , E (𝐴, 𝐵) ∧ Ord 𝐴𝐵 ⊆ On) → Smo 𝐹)

Proof of Theorem smoiso
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 isof1o 6003 . . . 4 (𝐹 Isom E , E (𝐴, 𝐵) → 𝐹:𝐴1-1-onto𝐵)
2 f1of 5634 . . . 4 (𝐹:𝐴1-1-onto𝐵𝐹:𝐴𝐵)
31, 2syl 14 . . 3 (𝐹 Isom E , E (𝐴, 𝐵) → 𝐹:𝐴𝐵)
4 ffdm 5553 . . . . . 6 (𝐹:𝐴𝐵 → (𝐹:dom 𝐹𝐵 ∧ dom 𝐹𝐴))
54simpld 112 . . . . 5 (𝐹:𝐴𝐵𝐹:dom 𝐹𝐵)
6 fss 5541 . . . . 5 ((𝐹:dom 𝐹𝐵𝐵 ⊆ On) → 𝐹:dom 𝐹⟶On)
75, 6sylan 283 . . . 4 ((𝐹:𝐴𝐵𝐵 ⊆ On) → 𝐹:dom 𝐹⟶On)
873adant2 1047 . . 3 ((𝐹:𝐴𝐵 ∧ Ord 𝐴𝐵 ⊆ On) → 𝐹:dom 𝐹⟶On)
93, 8syl3an1 1311 . 2 ((𝐹 Isom E , E (𝐴, 𝐵) ∧ Ord 𝐴𝐵 ⊆ On) → 𝐹:dom 𝐹⟶On)
10 fdm 5534 . . . . . 6 (𝐹:𝐴𝐵 → dom 𝐹 = 𝐴)
1110eqcomd 2244 . . . . 5 (𝐹:𝐴𝐵𝐴 = dom 𝐹)
12 ordeq 4512 . . . . 5 (𝐴 = dom 𝐹 → (Ord 𝐴 ↔ Ord dom 𝐹))
131, 2, 11, 124syl 18 . . . 4 (𝐹 Isom E , E (𝐴, 𝐵) → (Ord 𝐴 ↔ Ord dom 𝐹))
1413biimpa 296 . . 3 ((𝐹 Isom E , E (𝐴, 𝐵) ∧ Ord 𝐴) → Ord dom 𝐹)
15143adant3 1048 . 2 ((𝐹 Isom E , E (𝐴, 𝐵) ∧ Ord 𝐴𝐵 ⊆ On) → Ord dom 𝐹)
1610eleq2d 2308 . . . . . . 7 (𝐹:𝐴𝐵 → (𝑥 ∈ dom 𝐹𝑥𝐴))
1710eleq2d 2308 . . . . . . 7 (𝐹:𝐴𝐵 → (𝑦 ∈ dom 𝐹𝑦𝐴))
1816, 17anbi12d 477 . . . . . 6 (𝐹:𝐴𝐵 → ((𝑥 ∈ dom 𝐹𝑦 ∈ dom 𝐹) ↔ (𝑥𝐴𝑦𝐴)))
191, 2, 183syl 17 . . . . 5 (𝐹 Isom E , E (𝐴, 𝐵) → ((𝑥 ∈ dom 𝐹𝑦 ∈ dom 𝐹) ↔ (𝑥𝐴𝑦𝐴)))
20 epel 4432 . . . . . . . . 9 (𝑥 E 𝑦𝑥𝑦)
21 isorel 6004 . . . . . . . . 9 ((𝐹 Isom E , E (𝐴, 𝐵) ∧ (𝑥𝐴𝑦𝐴)) → (𝑥 E 𝑦 ↔ (𝐹𝑥) E (𝐹𝑦)))
2220, 21bitr3id 194 . . . . . . . 8 ((𝐹 Isom E , E (𝐴, 𝐵) ∧ (𝑥𝐴𝑦𝐴)) → (𝑥𝑦 ↔ (𝐹𝑥) E (𝐹𝑦)))
23 ffn 5528 . . . . . . . . . . 11 (𝐹:𝐴𝐵𝐹 Fn 𝐴)
243, 23syl 14 . . . . . . . . . 10 (𝐹 Isom E , E (𝐴, 𝐵) → 𝐹 Fn 𝐴)
2524adantr 276 . . . . . . . . 9 ((𝐹 Isom E , E (𝐴, 𝐵) ∧ (𝑥𝐴𝑦𝐴)) → 𝐹 Fn 𝐴)
26 simprr 537 . . . . . . . . 9 ((𝐹 Isom E , E (𝐴, 𝐵) ∧ (𝑥𝐴𝑦𝐴)) → 𝑦𝐴)
27 funfvex 5707 . . . . . . . . . . 11 ((Fun 𝐹𝑦 ∈ dom 𝐹) → (𝐹𝑦) ∈ V)
2827funfni 5478 . . . . . . . . . 10 ((𝐹 Fn 𝐴𝑦𝐴) → (𝐹𝑦) ∈ V)
29 epelg 4430 . . . . . . . . . 10 ((𝐹𝑦) ∈ V → ((𝐹𝑥) E (𝐹𝑦) ↔ (𝐹𝑥) ∈ (𝐹𝑦)))
3028, 29syl 14 . . . . . . . . 9 ((𝐹 Fn 𝐴𝑦𝐴) → ((𝐹𝑥) E (𝐹𝑦) ↔ (𝐹𝑥) ∈ (𝐹𝑦)))
3125, 26, 30syl2anc 415 . . . . . . . 8 ((𝐹 Isom E , E (𝐴, 𝐵) ∧ (𝑥𝐴𝑦𝐴)) → ((𝐹𝑥) E (𝐹𝑦) ↔ (𝐹𝑥) ∈ (𝐹𝑦)))
3222, 31bitrd 188 . . . . . . 7 ((𝐹 Isom E , E (𝐴, 𝐵) ∧ (𝑥𝐴𝑦𝐴)) → (𝑥𝑦 ↔ (𝐹𝑥) ∈ (𝐹𝑦)))
3332biimpd 144 . . . . . 6 ((𝐹 Isom E , E (𝐴, 𝐵) ∧ (𝑥𝐴𝑦𝐴)) → (𝑥𝑦 → (𝐹𝑥) ∈ (𝐹𝑦)))
3433ex 115 . . . . 5 (𝐹 Isom E , E (𝐴, 𝐵) → ((𝑥𝐴𝑦𝐴) → (𝑥𝑦 → (𝐹𝑥) ∈ (𝐹𝑦))))
3519, 34sylbid 150 . . . 4 (𝐹 Isom E , E (𝐴, 𝐵) → ((𝑥 ∈ dom 𝐹𝑦 ∈ dom 𝐹) → (𝑥𝑦 → (𝐹𝑥) ∈ (𝐹𝑦))))
3635ralrimivv 2631 . . 3 (𝐹 Isom E , E (𝐴, 𝐵) → ∀𝑥 ∈ dom 𝐹𝑦 ∈ dom 𝐹(𝑥𝑦 → (𝐹𝑥) ∈ (𝐹𝑦)))
37363ad2ant1 1049 . 2 ((𝐹 Isom E , E (𝐴, 𝐵) ∧ Ord 𝐴𝐵 ⊆ On) → ∀𝑥 ∈ dom 𝐹𝑦 ∈ dom 𝐹(𝑥𝑦 → (𝐹𝑥) ∈ (𝐹𝑦)))
38 df-smo 6547 . 2 (Smo 𝐹 ↔ (𝐹:dom 𝐹⟶On ∧ Ord dom 𝐹 ∧ ∀𝑥 ∈ dom 𝐹𝑦 ∈ dom 𝐹(𝑥𝑦 → (𝐹𝑥) ∈ (𝐹𝑦))))
399, 15, 37, 38syl3anbrc 1212 1 ((𝐹 Isom E , E (𝐴, 𝐵) ∧ Ord 𝐴𝐵 ⊆ On) → Smo 𝐹)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105  w3a 1009   = wceq 1402  wcel 2209  wral 2528  Vcvv 2821  wss 3220   class class class wbr 4125   E cep 4427  Ord word 4502  Oncon0 4503  dom cdm 4769   Fn wfn 5367  wf 5368  1-1-ontowf1o 5371  cfv 5372   Isom wiso 5373  Smo wsmo 6546
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4244  ax-pow 4306  ax-pr 4341
This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-sbc 3052  df-un 3224  df-in 3226  df-ss 3233  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-br 4126  df-opab 4188  df-tr 4225  df-eprel 4429  df-id 4433  df-iord 4506  df-cnv 4777  df-co 4778  df-dm 4779  df-iota 5332  df-fun 5374  df-fn 5375  df-f 5376  df-f1 5377  df-f1o 5379  df-fv 5380  df-isom 5381  df-smo 6547
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator