| 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 7776 | . . 3 ⊢ (Ord 𝐵 → Ord ∪ 𝐵) | |
| 2 | ordelord 6372 | . . . 4 ⊢ ((Ord ∪ 𝐵 ∧ 𝐴 ∈ ∪ 𝐵) → Ord 𝐴) | |
| 3 | 2 | ex 417 | . . 3 ⊢ (Ord ∪ 𝐵 → (𝐴 ∈ ∪ 𝐵 → Ord 𝐴)) |
| 4 | 1, 3 | syl 18 | . 2 ⊢ (Ord 𝐵 → (𝐴 ∈ ∪ 𝐵 → Ord 𝐴)) |
| 5 | ordelord 6372 | . . . 4 ⊢ ((Ord 𝐵 ∧ suc 𝐴 ∈ 𝐵) → Ord suc 𝐴) | |
| 6 | ordsuc 7798 | . . . 4 ⊢ (Ord 𝐴 ↔ Ord suc 𝐴) | |
| 7 | 5, 6 | sylibr 237 | . . 3 ⊢ ((Ord 𝐵 ∧ suc 𝐴 ∈ 𝐵) → Ord 𝐴) |
| 8 | 7 | ex 417 | . 2 ⊢ (Ord 𝐵 → (suc 𝐴 ∈ 𝐵 → Ord 𝐴)) |
| 9 | ordsson 7770 | . . . . . 6 ⊢ (Ord 𝐵 → 𝐵 ⊆ On) | |
| 10 | ordunisssuc 6458 | . . . . . 6 ⊢ ((𝐵 ⊆ On ∧ Ord 𝐴) → (∪ 𝐵 ⊆ 𝐴 ↔ 𝐵 ⊆ suc 𝐴)) | |
| 11 | 9, 10 | sylan 591 | . . . . 5 ⊢ ((Ord 𝐵 ∧ Ord 𝐴) → (∪ 𝐵 ⊆ 𝐴 ↔ 𝐵 ⊆ suc 𝐴)) |
| 12 | ordtri1 6383 | . . . . . 6 ⊢ ((Ord ∪ 𝐵 ∧ Ord 𝐴) → (∪ 𝐵 ⊆ 𝐴 ↔ ¬ 𝐴 ∈ ∪ 𝐵)) | |
| 13 | 1, 12 | sylan 591 | . . . . 5 ⊢ ((Ord 𝐵 ∧ Ord 𝐴) → (∪ 𝐵 ⊆ 𝐴 ↔ ¬ 𝐴 ∈ ∪ 𝐵)) |
| 14 | ordtri1 6383 | . . . . . 6 ⊢ ((Ord 𝐵 ∧ Ord suc 𝐴) → (𝐵 ⊆ suc 𝐴 ↔ ¬ suc 𝐴 ∈ 𝐵)) | |
| 15 | 6, 14 | sylan2b 605 | . . . . 5 ⊢ ((Ord 𝐵 ∧ Ord 𝐴) → (𝐵 ⊆ suc 𝐴 ↔ ¬ suc 𝐴 ∈ 𝐵)) |
| 16 | 11, 13, 15 | 3bitr3d 312 | . . . 4 ⊢ ((Ord 𝐵 ∧ Ord 𝐴) → (¬ 𝐴 ∈ ∪ 𝐵 ↔ ¬ suc 𝐴 ∈ 𝐵)) |
| 17 | 16 | con4bid 320 | . . 3 ⊢ ((Ord 𝐵 ∧ Ord 𝐴) → (𝐴 ∈ ∪ 𝐵 ↔ suc 𝐴 ∈ 𝐵)) |
| 18 | 17 | ex 417 | . 2 ⊢ (Ord 𝐵 → (Ord 𝐴 → (𝐴 ∈ ∪ 𝐵 ↔ suc 𝐴 ∈ 𝐵))) |
| 19 | 4, 8, 18 | pm5.21ndd 382 | 1 ⊢ (Ord 𝐵 → (𝐴 ∈ ∪ 𝐵 ↔ suc 𝐴 ∈ 𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 400 ∈ wcel 2145 ⊆ wss 3907 ∪ cuni 4868 Ord word 6349 Oncon0 6350 suc csuc 6352 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-ext 2737 ax-sep 5251 ax-pr 5395 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1566 df-fal 1576 df-ex 1803 df-sb 2094 df-clab 2744 df-cleq 2757 df-clel 2840 df-ne 2961 df-ral 3080 df-rex 3090 df-rab 3418 df-v 3459 df-dif 3910 df-un 3912 df-in 3914 df-ss 3924 df-pss 3927 df-nul 4289 df-if 4484 df-pw 4560 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4869 df-br 5106 df-opab 5168 df-tr 5213 df-eprel 5552 df-po 5560 df-so 5561 df-fr 5605 df-we 5607 df-ord 6353 df-on 6354 df-suc 6356 |
| This theorem is referenced by: naddsuc2 8676 dfac12lem1 10115 dfac12lem2 10116 |
| Copyright terms: Public domain | W3C validator |