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

Theorem ssonprc 7835
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 3066 . 2 (𝐴 ∉ V ↔ ¬ 𝐴 ∈ V)
2 ssorduni 7827 . . . . . . . 8 (𝐴 ⊆ On → Ord ∪ 𝐴)
3 ordeleqon 7830 . . . . . . . 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 7809 . . . . 5 (∪ 𝐴 ∈ On → 𝐴 ∈ V)
86, 7syl6 36 . . . 4 (𝐴 ⊆ On → (¬ ∪ 𝐴 = On → 𝐴 ∈ V))
98con1d 146 . . 3 (𝐴 ⊆ On → (¬ 𝐴 ∈ V → ∪ 𝐴 = On))
10 onprc 7824 . . . 4 ¬ On ∈ V
11 uniexg 7789 . . . . 5 (𝐴 ∈ V → ∪ 𝐴 ∈ V)
12 eleq1 2852 . . . . 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 2147   ∉ wnel 3065  Vcvv 3454   ⊆ wss 3900  ∪ cuni 4872  Ord word 6387  Oncon0 6388
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735  ax-sep 5255  ax-pow 5334  ax-pr 5398  ax-un 7783
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 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ne 2960  df-nel 3066  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-tr 5219  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  df-ord 6391  df-on 6392
This theorem is used by:  inaprc  10960
  Copyright terms: Public domain W3C validator