Theorem ssonprc 7792

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

Step	Hyp	Ref	Expression
1		df-nel 3067	. 2 ⊢ (𝐴 ∉ V ↔ ¬ 𝐴 ∈ V)
2		ssorduni 7784	. . . . . . . 8 ⊢ (𝐴 ⊆ On → Ord ∪ 𝐴)
3		ordeleqon 7787	. . . . . . . 8 ⊢ (Ord ∪ 𝐴 ↔ (∪ 𝐴 ∈ On ∨ ∪ 𝐴 = On))
4	2, 3	sylib 221	. . . . . . 7 ⊢ (𝐴 ⊆ On → (∪ 𝐴 ∈ On ∨ ∪ 𝐴 = On))
5	4	orcomd 885	. . . . . 6 ⊢ (𝐴 ⊆ On → (∪ 𝐴 = On ∨ ∪ 𝐴 ∈ On))
6	5	ord 878	. . . . 5 ⊢ (𝐴 ⊆ On → (¬ ∪ 𝐴 = On → ∪ 𝐴 ∈ On))
7		uniexr 7768	. . . . 5 ⊢ (∪ 𝐴 ∈ On → 𝐴 ∈ V)
8	6, 7	syl6 36	. . . 4 ⊢ (𝐴 ⊆ On → (¬ ∪ 𝐴 = On → 𝐴 ∈ V))
9	8	con1d 146	. . 3 ⊢ (𝐴 ⊆ On → (¬ 𝐴 ∈ V → ∪ 𝐴 = On))
10		onprc 7783	. . . 4 ⊢ ¬ On ∈ V
11		uniexg 7748	. . . . 5 ⊢ (𝐴 ∈ V → ∪ 𝐴 ∈ V)
12		eleq1 2853	. . . . 5 ⊢ (∪ 𝐴 = On → (∪ 𝐴 ∈ V ↔ On ∈ V))
13	11, 12	imbitrid 247	. . . 4 ⊢ (∪ 𝐴 = On → (𝐴 ∈ V → On ∈ V))
14	10, 13	mtoi 202	. . 3 ⊢ (∪ 𝐴 = On → ¬ 𝐴 ∈ V)
15	9, 14	impbid1 228	. 2 ⊢ (𝐴 ⊆ On → (¬ 𝐴 ∈ V ↔ ∪ 𝐴 = On))
16	1, 15	bitrid 286	1 ⊢ (𝐴 ⊆ On → (𝐴 ∉ V ↔ ∪ 𝐴 = On))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∨ wo 861   = wceq 1570   ∈ wcel 2146   ∉ wnel 3066  Vcvv 3457   ⊆ wss 3906  ∪ cuni 4874  Ord word 6363  Oncon0 6364

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 2148  ax-9 2156  ax-ext 2737  ax-sep 5259  ax-pow 5338  ax-pr 5406  ax-un 7742

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 2744  df-cleq 2757  df-clel 2840  df-ne 2961  df-nel 3067  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-pss 3926  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-br 5112  df-opab 5176  df-tr 5221  df-eprel 5563  df-po 5571  df-so 5572  df-fr 5616  df-we 5618  df-ord 6367  df-on 6368

This theorem is used by:  inaprc  10836