Theorem omsmo 8281

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.

Step	Hyp	Ref	Expression
1		simplr 767	. 2 ⊢ (((𝐴 ⊆ On ∧ 𝐹:ω⟶𝐴) ∧ ∀𝑥 ∈ ω (𝐹‘𝑥) ∈ (𝐹‘suc 𝑥)) → 𝐹:ω⟶𝐴)
2		omsmolem 8280	. . . . . . . . 9 ⊢ (𝑧 ∈ ω → (((𝐴 ⊆ On ∧ 𝐹:ω⟶𝐴) ∧ ∀𝑥 ∈ ω (𝐹‘𝑥) ∈ (𝐹‘suc 𝑥)) → (𝑦 ∈ 𝑧 → (𝐹‘𝑦) ∈ (𝐹‘𝑧))))
3	2	adantl 484	. . . . . . . 8 ⊢ ((𝑦 ∈ ω ∧ 𝑧 ∈ ω) → (((𝐴 ⊆ On ∧ 𝐹:ω⟶𝐴) ∧ ∀𝑥 ∈ ω (𝐹‘𝑥) ∈ (𝐹‘suc 𝑥)) → (𝑦 ∈ 𝑧 → (𝐹‘𝑦) ∈ (𝐹‘𝑧))))
4	3	imp 409	. . . . . . 7 ⊢ (((𝑦 ∈ ω ∧ 𝑧 ∈ ω) ∧ ((𝐴 ⊆ On ∧ 𝐹:ω⟶𝐴) ∧ ∀𝑥 ∈ ω (𝐹‘𝑥) ∈ (𝐹‘suc 𝑥))) → (𝑦 ∈ 𝑧 → (𝐹‘𝑦) ∈ (𝐹‘𝑧)))
5		omsmolem 8280	. . . . . . . . 9 ⊢ (𝑦 ∈ ω → (((𝐴 ⊆ On ∧ 𝐹:ω⟶𝐴) ∧ ∀𝑥 ∈ ω (𝐹‘𝑥) ∈ (𝐹‘suc 𝑥)) → (𝑧 ∈ 𝑦 → (𝐹‘𝑧) ∈ (𝐹‘𝑦))))
6	5	adantr 483	. . . . . . . 8 ⊢ ((𝑦 ∈ ω ∧ 𝑧 ∈ ω) → (((𝐴 ⊆ On ∧ 𝐹:ω⟶𝐴) ∧ ∀𝑥 ∈ ω (𝐹‘𝑥) ∈ (𝐹‘suc 𝑥)) → (𝑧 ∈ 𝑦 → (𝐹‘𝑧) ∈ (𝐹‘𝑦))))
7	6	imp 409	. . . . . . 7 ⊢ (((𝑦 ∈ ω ∧ 𝑧 ∈ ω) ∧ ((𝐴 ⊆ On ∧ 𝐹:ω⟶𝐴) ∧ ∀𝑥 ∈ ω (𝐹‘𝑥) ∈ (𝐹‘suc 𝑥))) → (𝑧 ∈ 𝑦 → (𝐹‘𝑧) ∈ (𝐹‘𝑦)))
8	4, 7	orim12d 961	. . . . . 6 ⊢ (((𝑦 ∈ ω ∧ 𝑧 ∈ ω) ∧ ((𝐴 ⊆ On ∧ 𝐹:ω⟶𝐴) ∧ ∀𝑥 ∈ ω (𝐹‘𝑥) ∈ (𝐹‘suc 𝑥))) → ((𝑦 ∈ 𝑧 ∨ 𝑧 ∈ 𝑦) → ((𝐹‘𝑦) ∈ (𝐹‘𝑧) ∨ (𝐹‘𝑧) ∈ (𝐹‘𝑦))))
9	8	ancoms 461	. . . . 5 ⊢ ((((𝐴 ⊆ On ∧ 𝐹:ω⟶𝐴) ∧ ∀𝑥 ∈ ω (𝐹‘𝑥) ∈ (𝐹‘suc 𝑥)) ∧ (𝑦 ∈ ω ∧ 𝑧 ∈ ω)) → ((𝑦 ∈ 𝑧 ∨ 𝑧 ∈ 𝑦) → ((𝐹‘𝑦) ∈ (𝐹‘𝑧) ∨ (𝐹‘𝑧) ∈ (𝐹‘𝑦))))
10	9	con3d 155	. . . 4 ⊢ ((((𝐴 ⊆ On ∧ 𝐹:ω⟶𝐴) ∧ ∀𝑥 ∈ ω (𝐹‘𝑥) ∈ (𝐹‘suc 𝑥)) ∧ (𝑦 ∈ ω ∧ 𝑧 ∈ ω)) → (¬ ((𝐹‘𝑦) ∈ (𝐹‘𝑧) ∨ (𝐹‘𝑧) ∈ (𝐹‘𝑦)) → ¬ (𝑦 ∈ 𝑧 ∨ 𝑧 ∈ 𝑦)))
11		ffvelrn 6849	. . . . . . . . . . 11 ⊢ ((𝐹:ω⟶𝐴 ∧ 𝑦 ∈ ω) → (𝐹‘𝑦) ∈ 𝐴)
12		ssel 3961	. . . . . . . . . . 11 ⊢ (𝐴 ⊆ On → ((𝐹‘𝑦) ∈ 𝐴 → (𝐹‘𝑦) ∈ On))
13	11, 12	syl5 34	. . . . . . . . . 10 ⊢ (𝐴 ⊆ On → ((𝐹:ω⟶𝐴 ∧ 𝑦 ∈ ω) → (𝐹‘𝑦) ∈ On))
14	13	expdimp 455	. . . . . . . . 9 ⊢ ((𝐴 ⊆ On ∧ 𝐹:ω⟶𝐴) → (𝑦 ∈ ω → (𝐹‘𝑦) ∈ On))
15		eloni 6201	. . . . . . . . 9 ⊢ ((𝐹‘𝑦) ∈ On → Ord (𝐹‘𝑦))
16	14, 15	syl6 35	. . . . . . . 8 ⊢ ((𝐴 ⊆ On ∧ 𝐹:ω⟶𝐴) → (𝑦 ∈ ω → Ord (𝐹‘𝑦)))
17		ffvelrn 6849	. . . . . . . . . . 11 ⊢ ((𝐹:ω⟶𝐴 ∧ 𝑧 ∈ ω) → (𝐹‘𝑧) ∈ 𝐴)
18		ssel 3961	. . . . . . . . . . 11 ⊢ (𝐴 ⊆ On → ((𝐹‘𝑧) ∈ 𝐴 → (𝐹‘𝑧) ∈ On))
19	17, 18	syl5 34	. . . . . . . . . 10 ⊢ (𝐴 ⊆ On → ((𝐹:ω⟶𝐴 ∧ 𝑧 ∈ ω) → (𝐹‘𝑧) ∈ On))
20	19	expdimp 455	. . . . . . . . 9 ⊢ ((𝐴 ⊆ On ∧ 𝐹:ω⟶𝐴) → (𝑧 ∈ ω → (𝐹‘𝑧) ∈ On))
21		eloni 6201	. . . . . . . . 9 ⊢ ((𝐹‘𝑧) ∈ On → Ord (𝐹‘𝑧))
22	20, 21	syl6 35	. . . . . . . 8 ⊢ ((𝐴 ⊆ On ∧ 𝐹:ω⟶𝐴) → (𝑧 ∈ ω → Ord (𝐹‘𝑧)))
23	16, 22	anim12d 610	. . . . . . 7 ⊢ ((𝐴 ⊆ On ∧ 𝐹:ω⟶𝐴) → ((𝑦 ∈ ω ∧ 𝑧 ∈ ω) → (Ord (𝐹‘𝑦) ∧ Ord (𝐹‘𝑧))))
24	23	imp 409	. . . . . 6 ⊢ (((𝐴 ⊆ On ∧ 𝐹:ω⟶𝐴) ∧ (𝑦 ∈ ω ∧ 𝑧 ∈ ω)) → (Ord (𝐹‘𝑦) ∧ Ord (𝐹‘𝑧)))
25		ordtri3 6227	. . . . . 6 ⊢ ((Ord (𝐹‘𝑦) ∧ Ord (𝐹‘𝑧)) → ((𝐹‘𝑦) = (𝐹‘𝑧) ↔ ¬ ((𝐹‘𝑦) ∈ (𝐹‘𝑧) ∨ (𝐹‘𝑧) ∈ (𝐹‘𝑦))))
26	24, 25	syl 17	. . . . 5 ⊢ (((𝐴 ⊆ On ∧ 𝐹:ω⟶𝐴) ∧ (𝑦 ∈ ω ∧ 𝑧 ∈ ω)) → ((𝐹‘𝑦) = (𝐹‘𝑧) ↔ ¬ ((𝐹‘𝑦) ∈ (𝐹‘𝑧) ∨ (𝐹‘𝑧) ∈ (𝐹‘𝑦))))
27	26	adantlr 713	. . . 4 ⊢ ((((𝐴 ⊆ On ∧ 𝐹:ω⟶𝐴) ∧ ∀𝑥 ∈ ω (𝐹‘𝑥) ∈ (𝐹‘suc 𝑥)) ∧ (𝑦 ∈ ω ∧ 𝑧 ∈ ω)) → ((𝐹‘𝑦) = (𝐹‘𝑧) ↔ ¬ ((𝐹‘𝑦) ∈ (𝐹‘𝑧) ∨ (𝐹‘𝑧) ∈ (𝐹‘𝑦))))
28		nnord 7588	. . . . . 6 ⊢ (𝑦 ∈ ω → Ord 𝑦)
29		nnord 7588	. . . . . 6 ⊢ (𝑧 ∈ ω → Ord 𝑧)
30		ordtri3 6227	. . . . . 6 ⊢ ((Ord 𝑦 ∧ Ord 𝑧) → (𝑦 = 𝑧 ↔ ¬ (𝑦 ∈ 𝑧 ∨ 𝑧 ∈ 𝑦)))
31	28, 29, 30	syl2an 597	. . . . 5 ⊢ ((𝑦 ∈ ω ∧ 𝑧 ∈ ω) → (𝑦 = 𝑧 ↔ ¬ (𝑦 ∈ 𝑧 ∨ 𝑧 ∈ 𝑦)))
32	31	adantl 484	. . . 4 ⊢ ((((𝐴 ⊆ On ∧ 𝐹:ω⟶𝐴) ∧ ∀𝑥 ∈ ω (𝐹‘𝑥) ∈ (𝐹‘suc 𝑥)) ∧ (𝑦 ∈ ω ∧ 𝑧 ∈ ω)) → (𝑦 = 𝑧 ↔ ¬ (𝑦 ∈ 𝑧 ∨ 𝑧 ∈ 𝑦)))
33	10, 27, 32	3imtr4d 296	. . 3 ⊢ ((((𝐴 ⊆ On ∧ 𝐹:ω⟶𝐴) ∧ ∀𝑥 ∈ ω (𝐹‘𝑥) ∈ (𝐹‘suc 𝑥)) ∧ (𝑦 ∈ ω ∧ 𝑧 ∈ ω)) → ((𝐹‘𝑦) = (𝐹‘𝑧) → 𝑦 = 𝑧))
34	33	ralrimivva 3191	. 2 ⊢ (((𝐴 ⊆ On ∧ 𝐹:ω⟶𝐴) ∧ ∀𝑥 ∈ ω (𝐹‘𝑥) ∈ (𝐹‘suc 𝑥)) → ∀𝑦 ∈ ω ∀𝑧 ∈ ω ((𝐹‘𝑦) = (𝐹‘𝑧) → 𝑦 = 𝑧))
35		dff13 7013	. 2 ⊢ (𝐹:ω–1-1→𝐴 ↔ (𝐹:ω⟶𝐴 ∧ ∀𝑦 ∈ ω ∀𝑧 ∈ ω ((𝐹‘𝑦) = (𝐹‘𝑧) → 𝑦 = 𝑧)))
36	1, 34, 35	sylanbrc 585	1 ⊢ (((𝐴 ⊆ On ∧ 𝐹:ω⟶𝐴) ∧ ∀𝑥 ∈ ω (𝐹‘𝑥) ∈ (𝐹‘suc 𝑥)) → 𝐹:ω–1-1→𝐴)

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 208   ∧ wa 398   ∨ wo 843   = wceq 1537   ∈ wcel 2114  ∀wral 3138   ⊆ wss 3936  Ord word 6190  Oncon0 6191  suc csuc 6193  ⟶wf 6351  –1-1→wf1 6352  ‘cfv 6355  ωcom 7580

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2793  ax-sep 5203  ax-nul 5210  ax-pr 5330  ax-un 7461

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-ral 3143  df-rex 3144  df-rab 3147  df-v 3496  df-sbc 3773  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-pss 3954  df-nul 4292  df-if 4468  df-pw 4541  df-sn 4568  df-pr 4570  df-tp 4572  df-op 4574  df-uni 4839  df-br 5067  df-opab 5129  df-tr 5173  df-id 5460  df-eprel 5465  df-po 5474  df-so 5475  df-fr 5514  df-we 5516  df-xp 5561  df-rel 5562  df-cnv 5563  df-co 5564  df-dm 5565  df-rn 5566  df-ord 6194  df-on 6195  df-lim 6196  df-suc 6197  df-iota 6314  df-fun 6357  df-fn 6358  df-f 6359  df-f1 6360  df-fv 6363  df-om 7581

This theorem is referenced by:  unblem4  8773