| 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 7734 | . . 3 ⊢ (Ord 𝐵 → Ord ∪ 𝐵) | |
| 2 | ordelord 6339 | . . . 4 ⊢ ((Ord ∪ 𝐵 ∧ 𝐴 ∈ ∪ 𝐵) → Ord 𝐴) | |
| 3 | 2 | ex 412 | . . 3 ⊢ (Ord ∪ 𝐵 → (𝐴 ∈ ∪ 𝐵 → Ord 𝐴)) |
| 4 | 1, 3 | syl 17 | . 2 ⊢ (Ord 𝐵 → (𝐴 ∈ ∪ 𝐵 → Ord 𝐴)) |
| 5 | ordelord 6339 | . . . 4 ⊢ ((Ord 𝐵 ∧ suc 𝐴 ∈ 𝐵) → Ord suc 𝐴) | |
| 6 | ordsuc 7756 | . . . 4 ⊢ (Ord 𝐴 ↔ Ord suc 𝐴) | |
| 7 | 5, 6 | sylibr 234 | . . 3 ⊢ ((Ord 𝐵 ∧ suc 𝐴 ∈ 𝐵) → Ord 𝐴) |
| 8 | 7 | ex 412 | . 2 ⊢ (Ord 𝐵 → (suc 𝐴 ∈ 𝐵 → Ord 𝐴)) |
| 9 | ordsson 7728 | . . . . . 6 ⊢ (Ord 𝐵 → 𝐵 ⊆ On) | |
| 10 | ordunisssuc 6425 | . . . . . 6 ⊢ ((𝐵 ⊆ On ∧ Ord 𝐴) → (∪ 𝐵 ⊆ 𝐴 ↔ 𝐵 ⊆ suc 𝐴)) | |
| 11 | 9, 10 | sylan 580 | . . . . 5 ⊢ ((Ord 𝐵 ∧ Ord 𝐴) → (∪ 𝐵 ⊆ 𝐴 ↔ 𝐵 ⊆ suc 𝐴)) |
| 12 | ordtri1 6350 | . . . . . 6 ⊢ ((Ord ∪ 𝐵 ∧ Ord 𝐴) → (∪ 𝐵 ⊆ 𝐴 ↔ ¬ 𝐴 ∈ ∪ 𝐵)) | |
| 13 | 1, 12 | sylan 580 | . . . . 5 ⊢ ((Ord 𝐵 ∧ Ord 𝐴) → (∪ 𝐵 ⊆ 𝐴 ↔ ¬ 𝐴 ∈ ∪ 𝐵)) |
| 14 | ordtri1 6350 | . . . . . 6 ⊢ ((Ord 𝐵 ∧ Ord suc 𝐴) → (𝐵 ⊆ suc 𝐴 ↔ ¬ suc 𝐴 ∈ 𝐵)) | |
| 15 | 6, 14 | sylan2b 594 | . . . . 5 ⊢ ((Ord 𝐵 ∧ Ord 𝐴) → (𝐵 ⊆ suc 𝐴 ↔ ¬ suc 𝐴 ∈ 𝐵)) |
| 16 | 11, 13, 15 | 3bitr3d 309 | . . . 4 ⊢ ((Ord 𝐵 ∧ Ord 𝐴) → (¬ 𝐴 ∈ ∪ 𝐵 ↔ ¬ suc 𝐴 ∈ 𝐵)) |
| 17 | 16 | con4bid 317 | . . 3 ⊢ ((Ord 𝐵 ∧ Ord 𝐴) → (𝐴 ∈ ∪ 𝐵 ↔ suc 𝐴 ∈ 𝐵)) |
| 18 | 17 | ex 412 | . 2 ⊢ (Ord 𝐵 → (Ord 𝐴 → (𝐴 ∈ ∪ 𝐵 ↔ suc 𝐴 ∈ 𝐵))) |
| 19 | 4, 8, 18 | pm5.21ndd 379 | 1 ⊢ (Ord 𝐵 → (𝐴 ∈ ∪ 𝐵 ↔ suc 𝐴 ∈ 𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 ∈ wcel 2113 ⊆ wss 3901 ∪ cuni 4863 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 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-ext 2708 ax-sep 5241 ax-nul 5251 ax-pr 5377 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-sb 2068 df-clab 2715 df-cleq 2728 df-clel 2811 df-ne 2933 df-ral 3052 df-rex 3061 df-rab 3400 df-v 3442 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-pss 3921 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-br 5099 df-opab 5161 df-tr 5206 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-we 5579 df-ord 6320 df-on 6321 df-suc 6323 |
| This theorem is referenced by: naddsuc2 8629 dfac12lem1 10054 dfac12lem2 10055 |
| Copyright terms: Public domain | W3C validator |