| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > fin1a2lem2 | Structured version Visualization version GIF version | ||
| Description: Lemma for fin1a2 10410. 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.) |
| Ref | Expression |
|---|---|
| fin1a2lem.a | ⊢ 𝑆 = (𝑥 ∈ On ↦ suc 𝑥) |
| Ref | Expression |
|---|---|
| fin1a2lem2 | ⊢ 𝑆:On–1-1→On |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fin1a2lem.a | . . 3 ⊢ 𝑆 = (𝑥 ∈ On ↦ suc 𝑥) | |
| 2 | onsuc 7811 | . . 3 ⊢ (𝑥 ∈ On → suc 𝑥 ∈ On) | |
| 3 | 1, 2 | fmpti 7111 | . 2 ⊢ 𝑆:On⟶On |
| 4 | 1 | fin1a2lem1 10395 | . . . . . 6 ⊢ (𝑎 ∈ On → (𝑆‘𝑎) = suc 𝑎) |
| 5 | 1 | fin1a2lem1 10395 | . . . . . 6 ⊢ (𝑏 ∈ On → (𝑆‘𝑏) = suc 𝑏) |
| 6 | 4, 5 | eqeqan12d 2779 | . . . . 5 ⊢ ((𝑎 ∈ On ∧ 𝑏 ∈ On) → ((𝑆‘𝑎) = (𝑆‘𝑏) ↔ suc 𝑎 = suc 𝑏)) |
| 7 | suc11 6474 | . . . . 5 ⊢ ((𝑎 ∈ On ∧ 𝑏 ∈ On) → (suc 𝑎 = suc 𝑏 ↔ 𝑎 = 𝑏)) | |
| 8 | 6, 7 | bitrd 282 | . . . 4 ⊢ ((𝑎 ∈ On ∧ 𝑏 ∈ On) → ((𝑆‘𝑎) = (𝑆‘𝑏) ↔ 𝑎 = 𝑏)) |
| 9 | 8 | biimpd 232 | . . 3 ⊢ ((𝑎 ∈ On ∧ 𝑏 ∈ On) → ((𝑆‘𝑎) = (𝑆‘𝑏) → 𝑎 = 𝑏)) |
| 10 | 9 | rgen2 3207 | . 2 ⊢ ∀𝑎 ∈ On ∀𝑏 ∈ On ((𝑆‘𝑎) = (𝑆‘𝑏) → 𝑎 = 𝑏) |
| 11 | dff13 7254 | . 2 ⊢ (𝑆:On–1-1→On ↔ (𝑆:On⟶On ∧ ∀𝑎 ∈ On ∀𝑏 ∈ On ((𝑆‘𝑎) = (𝑆‘𝑏) → 𝑎 = 𝑏))) | |
| 12 | 3, 10, 11 | mpbir2an 724 | 1 ⊢ 𝑆:On–1-1→On |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2146 ∀wral 3081 ↦ cmpt 5194 Oncon0 6364 suc csuc 6366 ⟶wf 6536 –1-1→wf1 6537 ‘cfv 6540 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-sep 5259 ax-nul 5271 ax-pr 5406 ax-un 7738 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-ral 3082 df-rex 3092 df-rab 3419 df-v 3459 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-br 5112 df-opab 5176 df-mpt 5195 df-tr 5221 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-ord 6367 df-on 6368 df-suc 6370 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fv 6548 |
| This theorem is used by: fin1a2lem6 10400 onsucf1o 44032 |
| Copyright terms: Public domain | W3C validator |