![]() |
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 6994 | . . 3 ⊢ (Ord 𝐵 → Ord ∪ 𝐵) | |
2 | ordelord 5745 | . . . 4 ⊢ ((Ord ∪ 𝐵 ∧ 𝐴 ∈ ∪ 𝐵) → Ord 𝐴) | |
3 | 2 | ex 450 | . . 3 ⊢ (Ord ∪ 𝐵 → (𝐴 ∈ ∪ 𝐵 → Ord 𝐴)) |
4 | 1, 3 | syl 17 | . 2 ⊢ (Ord 𝐵 → (𝐴 ∈ ∪ 𝐵 → Ord 𝐴)) |
5 | ordelord 5745 | . . . 4 ⊢ ((Ord 𝐵 ∧ suc 𝐴 ∈ 𝐵) → Ord suc 𝐴) | |
6 | ordsuc 7014 | . . . 4 ⊢ (Ord 𝐴 ↔ Ord suc 𝐴) | |
7 | 5, 6 | sylibr 224 | . . 3 ⊢ ((Ord 𝐵 ∧ suc 𝐴 ∈ 𝐵) → Ord 𝐴) |
8 | 7 | ex 450 | . 2 ⊢ (Ord 𝐵 → (suc 𝐴 ∈ 𝐵 → Ord 𝐴)) |
9 | ordsson 6989 | . . . . . 6 ⊢ (Ord 𝐵 → 𝐵 ⊆ On) | |
10 | ordunisssuc 5830 | . . . . . 6 ⊢ ((𝐵 ⊆ On ∧ Ord 𝐴) → (∪ 𝐵 ⊆ 𝐴 ↔ 𝐵 ⊆ suc 𝐴)) | |
11 | 9, 10 | sylan 488 | . . . . 5 ⊢ ((Ord 𝐵 ∧ Ord 𝐴) → (∪ 𝐵 ⊆ 𝐴 ↔ 𝐵 ⊆ suc 𝐴)) |
12 | ordtri1 5756 | . . . . . 6 ⊢ ((Ord ∪ 𝐵 ∧ Ord 𝐴) → (∪ 𝐵 ⊆ 𝐴 ↔ ¬ 𝐴 ∈ ∪ 𝐵)) | |
13 | 1, 12 | sylan 488 | . . . . 5 ⊢ ((Ord 𝐵 ∧ Ord 𝐴) → (∪ 𝐵 ⊆ 𝐴 ↔ ¬ 𝐴 ∈ ∪ 𝐵)) |
14 | ordtri1 5756 | . . . . . 6 ⊢ ((Ord 𝐵 ∧ Ord suc 𝐴) → (𝐵 ⊆ suc 𝐴 ↔ ¬ suc 𝐴 ∈ 𝐵)) | |
15 | 6, 14 | sylan2b 492 | . . . . 5 ⊢ ((Ord 𝐵 ∧ Ord 𝐴) → (𝐵 ⊆ suc 𝐴 ↔ ¬ suc 𝐴 ∈ 𝐵)) |
16 | 11, 13, 15 | 3bitr3d 298 | . . . 4 ⊢ ((Ord 𝐵 ∧ Ord 𝐴) → (¬ 𝐴 ∈ ∪ 𝐵 ↔ ¬ suc 𝐴 ∈ 𝐵)) |
17 | 16 | con4bid 307 | . . 3 ⊢ ((Ord 𝐵 ∧ Ord 𝐴) → (𝐴 ∈ ∪ 𝐵 ↔ suc 𝐴 ∈ 𝐵)) |
18 | 17 | ex 450 | . 2 ⊢ (Ord 𝐵 → (Ord 𝐴 → (𝐴 ∈ ∪ 𝐵 ↔ suc 𝐴 ∈ 𝐵))) |
19 | 4, 8, 18 | pm5.21ndd 369 | 1 ⊢ (Ord 𝐵 → (𝐴 ∈ ∪ 𝐵 ↔ suc 𝐴 ∈ 𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 196 ∧ wa 384 ∈ wcel 1990 ⊆ wss 3574 ∪ cuni 4436 Ord word 5722 Oncon0 5723 suc csuc 5725 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-8 1992 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-sep 4781 ax-nul 4789 ax-pr 4906 ax-un 6949 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3or 1038 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-ral 2917 df-rex 2918 df-rab 2921 df-v 3202 df-sbc 3436 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-pss 3590 df-nul 3916 df-if 4087 df-sn 4178 df-pr 4180 df-tp 4182 df-op 4184 df-uni 4437 df-br 4654 df-opab 4713 df-tr 4753 df-eprel 5029 df-po 5035 df-so 5036 df-fr 5073 df-we 5075 df-ord 5726 df-on 5727 df-suc 5729 |
This theorem is referenced by: dfac12lem1 8965 dfac12lem2 8966 |
Copyright terms: Public domain | W3C validator |