Theorem fin1a2lem2 10381

Description: Lemma for fin1a2 10395. The successor operation on the ordinal numbers is injective or one-to-one. Lemma 1.17 of [Schloeder] p. 2. (Contributed by Stefan O'Rear, 7-Nov-2014.)

Hypothesis

Ref	Expression
fin1a2lem.a	⊢ 𝑆 = (𝑥 ∈ On ↦ suc 𝑥)

Assertion

Ref	Expression
fin1a2lem2	⊢ 𝑆:On–1-1→On

Proof of Theorem fin1a2lem2

Dummy variables 𝑎 𝑏 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		fin1a2lem.a	. . 3 ⊢ 𝑆 = (𝑥 ∈ On ↦ suc 𝑥)
2		onsuc 7805	. . 3 ⊢ (𝑥 ∈ On → suc 𝑥 ∈ On)
3	1, 2	fmpti 7105	. 2 ⊢ 𝑆:On⟶On
4	1	fin1a2lem1 10380	. . . . . 6 ⊢ (𝑎 ∈ On → (𝑆‘𝑎) = suc 𝑎)
5	1	fin1a2lem1 10380	. . . . . 6 ⊢ (𝑏 ∈ On → (𝑆‘𝑏) = suc 𝑏)
6	4, 5	eqeqan12d 2783	. . . . 5 ⊢ ((𝑎 ∈ On ∧ 𝑏 ∈ On) → ((𝑆‘𝑎) = (𝑆‘𝑏) ↔ suc 𝑎 = suc 𝑏))
7		suc11 6467	. . . . 5 ⊢ ((𝑎 ∈ On ∧ 𝑏 ∈ On) → (suc 𝑎 = suc 𝑏 ↔ 𝑎 = 𝑏))
8	6, 7	bitrd 282	. . . 4 ⊢ ((𝑎 ∈ On ∧ 𝑏 ∈ On) → ((𝑆‘𝑎) = (𝑆‘𝑏) ↔ 𝑎 = 𝑏))
9	8	biimpd 232	. . 3 ⊢ ((𝑎 ∈ On ∧ 𝑏 ∈ On) → ((𝑆‘𝑎) = (𝑆‘𝑏) → 𝑎 = 𝑏))
10	9	rgen2 3211	. 2 ⊢ ∀𝑎 ∈ On ∀𝑏 ∈ On ((𝑆‘𝑎) = (𝑆‘𝑏) → 𝑎 = 𝑏)
11		dff13 7250	. 2 ⊢ (𝑆:On–1-1→On ↔ (𝑆:On⟶On ∧ ∀𝑎 ∈ On ∀𝑏 ∈ On ((𝑆‘𝑎) = (𝑆‘𝑏) → 𝑎 = 𝑏)))
12	3, 10, 11	mpbir2an 723	1 ⊢ 𝑆:On–1-1→On

Syntax hints:   → wi 4   ∧ wa 400   = wceq 1567   ∈ wcel 2149  ∀wral 3085   ↦ cmpt 5193  Oncon0 6357  suc csuc 6359  ⟶wf 6529  –1-1→wf1 6530  ‘cfv 6533

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-sep 5258  ax-nul 5268  ax-pr 5402  ax-un 7730

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-ral 3086  df-rex 3096  df-rab 3424  df-v 3465  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-pss 3933  df-nul 4295  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4874  df-br 5111  df-opab 5175  df-mpt 5194  df-tr 5220  df-id 5554  df-eprel 5559  df-po 5567  df-so 5568  df-fr 5612  df-we 5614  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-ord 6360  df-on 6361  df-suc 6363  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fv 6541

This theorem is referenced by:  fin1a2lem6  10385  onsucf1o  43884