| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ordsucuniel | Structured version Visualization version GIF version | ||
| Description: Given an element 𝐴 of the union of an ordinal 𝐵, suc 𝐴 is an element of 𝐵 itself. (Contributed by Scott Fenton, 28-Mar-2012.) (Proof shortened by Mario Carneiro, 29-May-2015.) |
| Ref | Expression |
|---|---|
| ordsucuniel | ⊢ (Ord 𝐵 → (𝐴 ∈ ∪ 𝐵 ↔ suc 𝐴 ∈ 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | orduni 7739 | . . 3 ⊢ (Ord 𝐵 → Ord ∪ 𝐵) | |
| 2 | ordelord 6339 | . . . 4 ⊢ ((Ord ∪ 𝐵 ∧ 𝐴 ∈ ∪ 𝐵) → Ord 𝐴) | |
| 3 | 2 | ex 413 | . . 3 ⊢ (Ord ∪ 𝐵 → (𝐴 ∈ ∪ 𝐵 → Ord 𝐴)) |
| 4 | 1, 3 | syl 17 | . 2 ⊢ (Ord 𝐵 → (𝐴 ∈ ∪ 𝐵 → Ord 𝐴)) |
| 5 | ordelord 6339 | . . . 4 ⊢ ((Ord 𝐵 ∧ suc 𝐴 ∈ 𝐵) → Ord suc 𝐴) | |
| 6 | ordsuc 7761 | . . . 4 ⊢ (Ord 𝐴 ↔ Ord suc 𝐴) | |
| 7 | 5, 6 | sylibr 235 | . . 3 ⊢ ((Ord 𝐵 ∧ suc 𝐴 ∈ 𝐵) → Ord 𝐴) |
| 8 | 7 | ex 413 | . 2 ⊢ (Ord 𝐵 → (suc 𝐴 ∈ 𝐵 → Ord 𝐴)) |
| 9 | ordsson 7733 | . . . . . 6 ⊢ (Ord 𝐵 → 𝐵 ⊆ On) | |
| 10 | ordunisssuc 6425 | . . . . . 6 ⊢ ((𝐵 ⊆ On ∧ Ord 𝐴) → (∪ 𝐵 ⊆ 𝐴 ↔ 𝐵 ⊆ suc 𝐴)) | |
| 11 | 9, 10 | sylan 586 | . . . . 5 ⊢ ((Ord 𝐵 ∧ Ord 𝐴) → (∪ 𝐵 ⊆ 𝐴 ↔ 𝐵 ⊆ suc 𝐴)) |
| 12 | ordtri1 6350 | . . . . . 6 ⊢ ((Ord ∪ 𝐵 ∧ Ord 𝐴) → (∪ 𝐵 ⊆ 𝐴 ↔ ¬ 𝐴 ∈ ∪ 𝐵)) | |
| 13 | 1, 12 | sylan 586 | . . . . 5 ⊢ ((Ord 𝐵 ∧ Ord 𝐴) → (∪ 𝐵 ⊆ 𝐴 ↔ ¬ 𝐴 ∈ ∪ 𝐵)) |
| 14 | ordtri1 6350 | . . . . . 6 ⊢ ((Ord 𝐵 ∧ Ord suc 𝐴) → (𝐵 ⊆ suc 𝐴 ↔ ¬ suc 𝐴 ∈ 𝐵)) | |
| 15 | 6, 14 | sylan2b 600 | . . . . 5 ⊢ ((Ord 𝐵 ∧ Ord 𝐴) → (𝐵 ⊆ suc 𝐴 ↔ ¬ suc 𝐴 ∈ 𝐵)) |
| 16 | 11, 13, 15 | 3bitr3d 310 | . . . 4 ⊢ ((Ord 𝐵 ∧ Ord 𝐴) → (¬ 𝐴 ∈ ∪ 𝐵 ↔ ¬ suc 𝐴 ∈ 𝐵)) |
| 17 | 16 | con4bid 318 | . . 3 ⊢ ((Ord 𝐵 ∧ Ord 𝐴) → (𝐴 ∈ ∪ 𝐵 ↔ suc 𝐴 ∈ 𝐵)) |
| 18 | 17 | ex 413 | . 2 ⊢ (Ord 𝐵 → (Ord 𝐴 → (𝐴 ∈ ∪ 𝐵 ↔ suc 𝐴 ∈ 𝐵))) |
| 19 | 4, 8, 18 | pm5.21ndd 380 | 1 ⊢ (Ord 𝐵 → (𝐴 ∈ ∪ 𝐵 ↔ suc 𝐴 ∈ 𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 207 ∧ wa 396 ∈ wcel 2119 ⊆ wss 3890 ∪ cuni 4845 Ord word 6316 Oncon0 6317 suc csuc 6319 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-ext 2712 ax-sep 5225 ax-pr 5369 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3or 1093 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-sb 2074 df-clab 2719 df-cleq 2732 df-clel 2815 df-ne 2936 df-ral 3055 df-rex 3065 df-rab 3393 df-v 3434 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4269 df-if 4462 df-pw 4538 df-sn 4563 df-pr 4565 df-op 4569 df-uni 4846 df-br 5080 df-opab 5142 df-tr 5187 df-eprel 5525 df-po 5533 df-so 5534 df-fr 5578 df-we 5580 df-ord 6320 df-on 6321 df-suc 6323 |
| This theorem is referenced by: naddsuc2 8634 dfac12lem1 10064 dfac12lem2 10065 |
| Copyright terms: Public domain | W3C validator |