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

Theorem ssonprc 7801
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 3063 . 2 (𝐴 ∉ V ↔ ¬ 𝐴 ∈ V)
2 ssorduni 7793 . . . . . . . 8 (𝐴 ⊆ On → Ord ∪ 𝐴)
3 ordeleqon 7796 . . . . . . . 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 7777 . . . . 5 (∪ 𝐴 ∈ On → 𝐴 ∈ V)
86, 7syl6 36 . . . 4 (𝐴 ⊆ On → (¬ ∪ 𝐴 = On → 𝐴 ∈ V))
98con1d 146 . . 3 (𝐴 ⊆ On → (¬ 𝐴 ∈ V → ∪ 𝐴 = On))
10 onprc 7792 . . . 4 ¬ On ∈ V
11 uniexg 7757 . . . . 5 (𝐴 ∈ V → ∪ 𝐴 ∈ V)
12 eleq1 2849 . . . . 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 1570   ∈ wcel 2145   ∉ wnel 3062  Vcvv 3451   ⊆ wss 3899  ∪ cuni 4867  Ord word 6361  Oncon0 6362
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2733  ax-sep 5249  ax-pow 5327  ax-pr 5391  ax-un 7751
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-ne 2957  df-nel 3063  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-tr 5213  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  df-ord 6365  df-on 6366
This theorem is used by:  inaprc  10921
  Copyright terms: Public domain W3C validator