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

Theorem omsmo 8695
Description: A strictly monotonic ordinal function on the set of natural numbers is one-to-one. (Contributed by NM, 30-Nov-2003.) (Revised by David Abernethy, 1-Jan-2014.)
Assertion
Ref Expression
omsmo (((𝐴 ⊆ On ∧ 𝐹:ω⟶𝐴) ∧ ∀𝑥 ∈ ω (𝐹𝑥) ∈ (𝐹‘suc 𝑥)) → 𝐹:ω–1-1𝐴)
Distinct variable group:   𝑥,𝐹
Allowed substitution hint:   𝐴(𝑥)

Proof of Theorem omsmo
Dummy variables 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 simplr 769 . 2 (((𝐴 ⊆ On ∧ 𝐹:ω⟶𝐴) ∧ ∀𝑥 ∈ ω (𝐹𝑥) ∈ (𝐹‘suc 𝑥)) → 𝐹:ω⟶𝐴)
2 omsmolem 8694 . . . . . . . . 9 (𝑧 ∈ ω → (((𝐴 ⊆ On ∧ 𝐹:ω⟶𝐴) ∧ ∀𝑥 ∈ ω (𝐹𝑥) ∈ (𝐹‘suc 𝑥)) → (𝑦𝑧 → (𝐹𝑦) ∈ (𝐹𝑧))))
32adantl 481 . . . . . . . 8 ((𝑦 ∈ ω ∧ 𝑧 ∈ ω) → (((𝐴 ⊆ On ∧ 𝐹:ω⟶𝐴) ∧ ∀𝑥 ∈ ω (𝐹𝑥) ∈ (𝐹‘suc 𝑥)) → (𝑦𝑧 → (𝐹𝑦) ∈ (𝐹𝑧))))
43imp 406 . . . . . . 7 (((𝑦 ∈ ω ∧ 𝑧 ∈ ω) ∧ ((𝐴 ⊆ On ∧ 𝐹:ω⟶𝐴) ∧ ∀𝑥 ∈ ω (𝐹𝑥) ∈ (𝐹‘suc 𝑥))) → (𝑦𝑧 → (𝐹𝑦) ∈ (𝐹𝑧)))
5 omsmolem 8694 . . . . . . . . 9 (𝑦 ∈ ω → (((𝐴 ⊆ On ∧ 𝐹:ω⟶𝐴) ∧ ∀𝑥 ∈ ω (𝐹𝑥) ∈ (𝐹‘suc 𝑥)) → (𝑧𝑦 → (𝐹𝑧) ∈ (𝐹𝑦))))
65adantr 480 . . . . . . . 8 ((𝑦 ∈ ω ∧ 𝑧 ∈ ω) → (((𝐴 ⊆ On ∧ 𝐹:ω⟶𝐴) ∧ ∀𝑥 ∈ ω (𝐹𝑥) ∈ (𝐹‘suc 𝑥)) → (𝑧𝑦 → (𝐹𝑧) ∈ (𝐹𝑦))))
76imp 406 . . . . . . 7 (((𝑦 ∈ ω ∧ 𝑧 ∈ ω) ∧ ((𝐴 ⊆ On ∧ 𝐹:ω⟶𝐴) ∧ ∀𝑥 ∈ ω (𝐹𝑥) ∈ (𝐹‘suc 𝑥))) → (𝑧𝑦 → (𝐹𝑧) ∈ (𝐹𝑦)))
84, 7orim12d 966 . . . . . 6 (((𝑦 ∈ ω ∧ 𝑧 ∈ ω) ∧ ((𝐴 ⊆ On ∧ 𝐹:ω⟶𝐴) ∧ ∀𝑥 ∈ ω (𝐹𝑥) ∈ (𝐹‘suc 𝑥))) → ((𝑦𝑧𝑧𝑦) → ((𝐹𝑦) ∈ (𝐹𝑧) ∨ (𝐹𝑧) ∈ (𝐹𝑦))))
98ancoms 458 . . . . 5 ((((𝐴 ⊆ On ∧ 𝐹:ω⟶𝐴) ∧ ∀𝑥 ∈ ω (𝐹𝑥) ∈ (𝐹‘suc 𝑥)) ∧ (𝑦 ∈ ω ∧ 𝑧 ∈ ω)) → ((𝑦𝑧𝑧𝑦) → ((𝐹𝑦) ∈ (𝐹𝑧) ∨ (𝐹𝑧) ∈ (𝐹𝑦))))
109con3d 152 . . . 4 ((((𝐴 ⊆ On ∧ 𝐹:ω⟶𝐴) ∧ ∀𝑥 ∈ ω (𝐹𝑥) ∈ (𝐹‘suc 𝑥)) ∧ (𝑦 ∈ ω ∧ 𝑧 ∈ ω)) → (¬ ((𝐹𝑦) ∈ (𝐹𝑧) ∨ (𝐹𝑧) ∈ (𝐹𝑦)) → ¬ (𝑦𝑧𝑧𝑦)))
11 ffvelcdm 7101 . . . . . . . . . . 11 ((𝐹:ω⟶𝐴𝑦 ∈ ω) → (𝐹𝑦) ∈ 𝐴)
12 ssel 3989 . . . . . . . . . . 11 (𝐴 ⊆ On → ((𝐹𝑦) ∈ 𝐴 → (𝐹𝑦) ∈ On))
1311, 12syl5 34 . . . . . . . . . 10 (𝐴 ⊆ On → ((𝐹:ω⟶𝐴𝑦 ∈ ω) → (𝐹𝑦) ∈ On))
1413expdimp 452 . . . . . . . . 9 ((𝐴 ⊆ On ∧ 𝐹:ω⟶𝐴) → (𝑦 ∈ ω → (𝐹𝑦) ∈ On))
15 eloni 6396 . . . . . . . . 9 ((𝐹𝑦) ∈ On → Ord (𝐹𝑦))
1614, 15syl6 35 . . . . . . . 8 ((𝐴 ⊆ On ∧ 𝐹:ω⟶𝐴) → (𝑦 ∈ ω → Ord (𝐹𝑦)))
17 ffvelcdm 7101 . . . . . . . . . . 11 ((𝐹:ω⟶𝐴𝑧 ∈ ω) → (𝐹𝑧) ∈ 𝐴)
18 ssel 3989 . . . . . . . . . . 11 (𝐴 ⊆ On → ((𝐹𝑧) ∈ 𝐴 → (𝐹𝑧) ∈ On))
1917, 18syl5 34 . . . . . . . . . 10 (𝐴 ⊆ On → ((𝐹:ω⟶𝐴𝑧 ∈ ω) → (𝐹𝑧) ∈ On))
2019expdimp 452 . . . . . . . . 9 ((𝐴 ⊆ On ∧ 𝐹:ω⟶𝐴) → (𝑧 ∈ ω → (𝐹𝑧) ∈ On))
21 eloni 6396 . . . . . . . . 9 ((𝐹𝑧) ∈ On → Ord (𝐹𝑧))
2220, 21syl6 35 . . . . . . . 8 ((𝐴 ⊆ On ∧ 𝐹:ω⟶𝐴) → (𝑧 ∈ ω → Ord (𝐹𝑧)))
2316, 22anim12d 609 . . . . . . 7 ((𝐴 ⊆ On ∧ 𝐹:ω⟶𝐴) → ((𝑦 ∈ ω ∧ 𝑧 ∈ ω) → (Ord (𝐹𝑦) ∧ Ord (𝐹𝑧))))
2423imp 406 . . . . . 6 (((𝐴 ⊆ On ∧ 𝐹:ω⟶𝐴) ∧ (𝑦 ∈ ω ∧ 𝑧 ∈ ω)) → (Ord (𝐹𝑦) ∧ Ord (𝐹𝑧)))
25 ordtri3 6422 . . . . . 6 ((Ord (𝐹𝑦) ∧ Ord (𝐹𝑧)) → ((𝐹𝑦) = (𝐹𝑧) ↔ ¬ ((𝐹𝑦) ∈ (𝐹𝑧) ∨ (𝐹𝑧) ∈ (𝐹𝑦))))
2624, 25syl 17 . . . . 5 (((𝐴 ⊆ On ∧ 𝐹:ω⟶𝐴) ∧ (𝑦 ∈ ω ∧ 𝑧 ∈ ω)) → ((𝐹𝑦) = (𝐹𝑧) ↔ ¬ ((𝐹𝑦) ∈ (𝐹𝑧) ∨ (𝐹𝑧) ∈ (𝐹𝑦))))
2726adantlr 715 . . . 4 ((((𝐴 ⊆ On ∧ 𝐹:ω⟶𝐴) ∧ ∀𝑥 ∈ ω (𝐹𝑥) ∈ (𝐹‘suc 𝑥)) ∧ (𝑦 ∈ ω ∧ 𝑧 ∈ ω)) → ((𝐹𝑦) = (𝐹𝑧) ↔ ¬ ((𝐹𝑦) ∈ (𝐹𝑧) ∨ (𝐹𝑧) ∈ (𝐹𝑦))))
28 nnord 7895 . . . . . 6 (𝑦 ∈ ω → Ord 𝑦)
29 nnord 7895 . . . . . 6 (𝑧 ∈ ω → Ord 𝑧)
30 ordtri3 6422 . . . . . 6 ((Ord 𝑦 ∧ Ord 𝑧) → (𝑦 = 𝑧 ↔ ¬ (𝑦𝑧𝑧𝑦)))
3128, 29, 30syl2an 596 . . . . 5 ((𝑦 ∈ ω ∧ 𝑧 ∈ ω) → (𝑦 = 𝑧 ↔ ¬ (𝑦𝑧𝑧𝑦)))
3231adantl 481 . . . 4 ((((𝐴 ⊆ On ∧ 𝐹:ω⟶𝐴) ∧ ∀𝑥 ∈ ω (𝐹𝑥) ∈ (𝐹‘suc 𝑥)) ∧ (𝑦 ∈ ω ∧ 𝑧 ∈ ω)) → (𝑦 = 𝑧 ↔ ¬ (𝑦𝑧𝑧𝑦)))
3310, 27, 323imtr4d 294 . . 3 ((((𝐴 ⊆ On ∧ 𝐹:ω⟶𝐴) ∧ ∀𝑥 ∈ ω (𝐹𝑥) ∈ (𝐹‘suc 𝑥)) ∧ (𝑦 ∈ ω ∧ 𝑧 ∈ ω)) → ((𝐹𝑦) = (𝐹𝑧) → 𝑦 = 𝑧))
3433ralrimivva 3200 . 2 (((𝐴 ⊆ On ∧ 𝐹:ω⟶𝐴) ∧ ∀𝑥 ∈ ω (𝐹𝑥) ∈ (𝐹‘suc 𝑥)) → ∀𝑦 ∈ ω ∀𝑧 ∈ ω ((𝐹𝑦) = (𝐹𝑧) → 𝑦 = 𝑧))
35 dff13 7275 . 2 (𝐹:ω–1-1𝐴 ↔ (𝐹:ω⟶𝐴 ∧ ∀𝑦 ∈ ω ∀𝑧 ∈ ω ((𝐹𝑦) = (𝐹𝑧) → 𝑦 = 𝑧)))
361, 34, 35sylanbrc 583 1 (((𝐴 ⊆ On ∧ 𝐹:ω⟶𝐴) ∧ ∀𝑥 ∈ ω (𝐹𝑥) ∈ (𝐹‘suc 𝑥)) → 𝐹:ω–1-1𝐴)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 206  wa 395  wo 847   = wceq 1537  wcel 2106  wral 3059  wss 3963  Ord word 6385  Oncon0 6386  suc csuc 6388  wf 6559  1-1wf1 6560  cfv 6563  ωcom 7887
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-ext 2706  ax-sep 5302  ax-nul 5312  ax-pr 5438  ax-un 7754
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-nf 1781  df-sb 2063  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2727  df-clel 2814  df-ne 2939  df-ral 3060  df-rex 3069  df-rab 3434  df-v 3480  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-pss 3983  df-nul 4340  df-if 4532  df-pw 4607  df-sn 4632  df-pr 4634  df-op 4638  df-uni 4913  df-br 5149  df-opab 5211  df-tr 5266  df-id 5583  df-eprel 5589  df-po 5597  df-so 5598  df-fr 5641  df-we 5643  df-xp 5695  df-rel 5696  df-cnv 5697  df-co 5698  df-dm 5699  df-rn 5700  df-ord 6389  df-on 6390  df-lim 6391  df-suc 6392  df-iota 6516  df-fun 6565  df-fn 6566  df-f 6567  df-f1 6568  df-fv 6571  df-om 7888
This theorem is referenced by:  unblem4  9329
  Copyright terms: Public domain W3C validator