| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ssonprc | Structured version Visualization version GIF version | ||
| Description: Two ways of saying a class of ordinals is unbounded. (Contributed by Mario Carneiro, 8-Jun-2013.) |
| Ref | Expression |
|---|---|
| ssonprc | ⊢ (𝐴 ⊆ On → (𝐴 ∉ V ↔ ∪ 𝐴 = On)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-nel 3038 | . 2 ⊢ (𝐴 ∉ V ↔ ¬ 𝐴 ∈ V) | |
| 2 | ssorduni 7727 | . . . . . . . 8 ⊢ (𝐴 ⊆ On → Ord ∪ 𝐴) | |
| 3 | ordeleqon 7730 | . . . . . . . 8 ⊢ (Ord ∪ 𝐴 ↔ (∪ 𝐴 ∈ On ∨ ∪ 𝐴 = On)) | |
| 4 | 2, 3 | sylib 218 | . . . . . . 7 ⊢ (𝐴 ⊆ On → (∪ 𝐴 ∈ On ∨ ∪ 𝐴 = On)) |
| 5 | 4 | orcomd 872 | . . . . . 6 ⊢ (𝐴 ⊆ On → (∪ 𝐴 = On ∨ ∪ 𝐴 ∈ On)) |
| 6 | 5 | ord 865 | . . . . 5 ⊢ (𝐴 ⊆ On → (¬ ∪ 𝐴 = On → ∪ 𝐴 ∈ On)) |
| 7 | uniexr 7711 | . . . . 5 ⊢ (∪ 𝐴 ∈ On → 𝐴 ∈ V) | |
| 8 | 6, 7 | syl6 35 | . . . 4 ⊢ (𝐴 ⊆ On → (¬ ∪ 𝐴 = On → 𝐴 ∈ V)) |
| 9 | 8 | con1d 145 | . . 3 ⊢ (𝐴 ⊆ On → (¬ 𝐴 ∈ V → ∪ 𝐴 = On)) |
| 10 | onprc 7726 | . . . 4 ⊢ ¬ On ∈ V | |
| 11 | uniexg 7688 | . . . . 5 ⊢ (𝐴 ∈ V → ∪ 𝐴 ∈ V) | |
| 12 | eleq1 2825 | . . . . 5 ⊢ (∪ 𝐴 = On → (∪ 𝐴 ∈ V ↔ On ∈ V)) | |
| 13 | 11, 12 | imbitrid 244 | . . . 4 ⊢ (∪ 𝐴 = On → (𝐴 ∈ V → On ∈ V)) |
| 14 | 10, 13 | mtoi 199 | . . 3 ⊢ (∪ 𝐴 = On → ¬ 𝐴 ∈ V) |
| 15 | 9, 14 | impbid1 225 | . 2 ⊢ (𝐴 ⊆ On → (¬ 𝐴 ∈ V ↔ ∪ 𝐴 = On)) |
| 16 | 1, 15 | bitrid 283 | 1 ⊢ (𝐴 ⊆ On → (𝐴 ∉ V ↔ ∪ 𝐴 = On)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∨ wo 848 = wceq 1542 ∈ wcel 2114 ∉ wnel 3037 Vcvv 3430 ⊆ wss 3890 ∪ cuni 4851 Ord word 6317 Oncon0 6318 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-ext 2709 ax-sep 5232 ax-pow 5303 ax-pr 5371 ax-un 7683 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-sb 2069 df-clab 2716 df-cleq 2729 df-clel 2812 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-rab 3391 df-v 3432 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-br 5087 df-opab 5149 df-tr 5194 df-eprel 5525 df-po 5533 df-so 5534 df-fr 5578 df-we 5580 df-ord 6321 df-on 6322 |
| This theorem is referenced by: inaprc 10753 |
| Copyright terms: Public domain | W3C validator |