MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  ssonprc Structured version   Visualization version   GIF version

Theorem ssonprc 7805
Description: Two ways of saying a class of ordinals is unbounded. (Contributed by Mario Carneiro, 8-Jun-2013.)
Assertion
Ref Expression
ssonprc (𝐴 ⊆ On → (𝐴 ∉ V ↔ ∪ 𝐴 = On))

Proof of Theorem ssonprc
StepHypRef Expression
1 df-nel 3062 . 2 (𝐴 ∉ V ↔ ¬ 𝐴 ∈ V)
2 ssorduni 7797 . . . . . . . 8 (𝐴 ⊆ On → Ord ∪ 𝐴)
3 ordeleqon 7800 . . . . . . . 8 (Ord ∪ 𝐴 ↔ (∪ 𝐴 ∈ On ∨ ∪ 𝐴 = On))
42, 3sylib 221 . . . . . . 7 (𝐴 ⊆ On → (∪ 𝐴 ∈ On ∨ ∪ 𝐴 = On))
54orcomd 885 . . . . . 6 (𝐴 ⊆ On → (∪ 𝐴 = On ∨ ∪ 𝐴 ∈ On))
65ord 878 . . . . 5 (𝐴 ⊆ On → (¬ ∪ 𝐴 = On → ∪ 𝐴 ∈ On))
7 uniexr 7781 . . . . 5 (∪ 𝐴 ∈ On → 𝐴 ∈ V)
86, 7syl6 36 . . . 4 (𝐴 ⊆ On → (¬ ∪ 𝐴 = On → 𝐴 ∈ V))
98con1d 146 . . 3 (𝐴 ⊆ On → (¬ 𝐴 ∈ V → ∪ 𝐴 = On))
10 onprc 7796 . . . 4 ¬ On ∈ V
11 uniexg 7761 . . . . 5 (𝐴 ∈ V → ∪ 𝐴 ∈ V)
12 eleq1 2848 . . . . 5 (∪ 𝐴 = On → (∪ 𝐴 ∈ V ↔ On ∈ V))
1311, 12imbitrid 247 . . . 4 (∪ 𝐴 = On → (𝐴 ∈ V → On ∈ V))
1410, 13mtoi 202 . . 3 (∪ 𝐴 = On → ¬ 𝐴 ∈ V)
159, 14impbid1 228 . 2 (𝐴 ⊆ On → (¬ 𝐴 ∈ V ↔ ∪ 𝐴 = On))
161, 15bitrid 286 1 (𝐴 ⊆ On → (𝐴 ∉ V ↔ ∪ 𝐴 = On))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∨ wo 861   = wceq 1569   ∈ wcel 2144   ∉ wnel 3061  Vcvv 3450   ⊆ wss 3896  ∪ cuni 4866  Ord word 6364  Oncon0 6365
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732  ax-sep 5248  ax-pow 5327  ax-pr 5391  ax-un 7755
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ne 2956  df-nel 3062  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3897  df-pss 4013  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-opab 5167  df-tr 5212  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  df-ord 6368  df-on 6369
This theorem is used by:  inaprc  10928
  Copyright terms: Public domain W3C validator