Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > onsucmin | GIF version |
Description: The successor of an ordinal number is the smallest larger ordinal number. (Contributed by NM, 28-Nov-2003.) |
Ref | Expression |
---|---|
onsucmin | ⊢ (𝐴 ∈ On → suc 𝐴 = ∩ {𝑥 ∈ On ∣ 𝐴 ∈ 𝑥}) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eloni 4292 | . . . . 5 ⊢ (𝑥 ∈ On → Ord 𝑥) | |
2 | ordelsuc 4416 | . . . . 5 ⊢ ((𝐴 ∈ On ∧ Ord 𝑥) → (𝐴 ∈ 𝑥 ↔ suc 𝐴 ⊆ 𝑥)) | |
3 | 1, 2 | sylan2 284 | . . . 4 ⊢ ((𝐴 ∈ On ∧ 𝑥 ∈ On) → (𝐴 ∈ 𝑥 ↔ suc 𝐴 ⊆ 𝑥)) |
4 | 3 | rabbidva 2669 | . . 3 ⊢ (𝐴 ∈ On → {𝑥 ∈ On ∣ 𝐴 ∈ 𝑥} = {𝑥 ∈ On ∣ suc 𝐴 ⊆ 𝑥}) |
5 | 4 | inteqd 3771 | . 2 ⊢ (𝐴 ∈ On → ∩ {𝑥 ∈ On ∣ 𝐴 ∈ 𝑥} = ∩ {𝑥 ∈ On ∣ suc 𝐴 ⊆ 𝑥}) |
6 | sucelon 4414 | . . 3 ⊢ (𝐴 ∈ On ↔ suc 𝐴 ∈ On) | |
7 | intmin 3786 | . . 3 ⊢ (suc 𝐴 ∈ On → ∩ {𝑥 ∈ On ∣ suc 𝐴 ⊆ 𝑥} = suc 𝐴) | |
8 | 6, 7 | sylbi 120 | . 2 ⊢ (𝐴 ∈ On → ∩ {𝑥 ∈ On ∣ suc 𝐴 ⊆ 𝑥} = suc 𝐴) |
9 | 5, 8 | eqtr2d 2171 | 1 ⊢ (𝐴 ∈ On → suc 𝐴 = ∩ {𝑥 ∈ On ∣ 𝐴 ∈ 𝑥}) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ↔ wb 104 = wceq 1331 ∈ wcel 1480 {crab 2418 ⊆ wss 3066 ∩ cint 3766 Ord word 4279 Oncon0 4280 suc csuc 4282 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-io 698 ax-5 1423 ax-7 1424 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-8 1482 ax-10 1483 ax-11 1484 ax-i12 1485 ax-bndl 1486 ax-4 1487 ax-13 1491 ax-14 1492 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2119 ax-sep 4041 ax-pow 4093 ax-pr 4126 ax-un 4350 |
This theorem depends on definitions: df-bi 116 df-3an 964 df-tru 1334 df-nf 1437 df-sb 1736 df-clab 2124 df-cleq 2130 df-clel 2133 df-nfc 2268 df-ral 2419 df-rex 2420 df-rab 2423 df-v 2683 df-un 3070 df-in 3072 df-ss 3079 df-pw 3507 df-sn 3528 df-pr 3529 df-uni 3732 df-int 3767 df-tr 4022 df-iord 4283 df-on 4285 df-suc 4288 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |