Theorem orduninsuc 7837

Description: An ordinal class is equal to its union if and only if it is not the successor of an ordinal. Closed-form generalization of onuninsuci 7834. (Contributed by NM, 18-Feb-2004.)

Assertion

Ref	Expression
orduninsuc	⊢ (Ord 𝐴 → (𝐴 = ∪ 𝐴 ↔ ¬ ∃𝑥 ∈ On 𝐴 = suc 𝑥))

Distinct variable group:   𝑥,𝐴

Proof of Theorem orduninsuc

Step	Hyp	Ref	Expression
1		ordeleqon 7779	. 2 ⊢ (Ord 𝐴 ↔ (𝐴 ∈ On ∨ 𝐴 = On))
2		id 23	. . . . . 6 ⊢ (𝐴 = if(𝐴 ∈ On, 𝐴, ∅) → 𝐴 = if(𝐴 ∈ On, 𝐴, ∅))
3		unieq 4877	. . . . . 6 ⊢ (𝐴 = if(𝐴 ∈ On, 𝐴, ∅) → ∪ 𝐴 = ∪ if(𝐴 ∈ On, 𝐴, ∅))
4	2, 3	eqeq12d 2776	. . . . 5 ⊢ (𝐴 = if(𝐴 ∈ On, 𝐴, ∅) → (𝐴 = ∪ 𝐴 ↔ if(𝐴 ∈ On, 𝐴, ∅) = ∪ if(𝐴 ∈ On, 𝐴, ∅)))
5		eqeq1 2764	. . . . . . 7 ⊢ (𝐴 = if(𝐴 ∈ On, 𝐴, ∅) → (𝐴 = suc 𝑥 ↔ if(𝐴 ∈ On, 𝐴, ∅) = suc 𝑥))
6	5	rexbidv 3186	. . . . . 6 ⊢ (𝐴 = if(𝐴 ∈ On, 𝐴, ∅) → (∃𝑥 ∈ On 𝐴 = suc 𝑥 ↔ ∃𝑥 ∈ On if(𝐴 ∈ On, 𝐴, ∅) = suc 𝑥))
7	6	notbid 321	. . . . 5 ⊢ (𝐴 = if(𝐴 ∈ On, 𝐴, ∅) → (¬ ∃𝑥 ∈ On 𝐴 = suc 𝑥 ↔ ¬ ∃𝑥 ∈ On if(𝐴 ∈ On, 𝐴, ∅) = suc 𝑥))
8	4, 7	bibi12d 348	. . . 4 ⊢ (𝐴 = if(𝐴 ∈ On, 𝐴, ∅) → ((𝐴 = ∪ 𝐴 ↔ ¬ ∃𝑥 ∈ On 𝐴 = suc 𝑥) ↔ (if(𝐴 ∈ On, 𝐴, ∅) = ∪ if(𝐴 ∈ On, 𝐴, ∅) ↔ ¬ ∃𝑥 ∈ On if(𝐴 ∈ On, 𝐴, ∅) = suc 𝑥)))
9		0elon 6407	. . . . . 6 ⊢ ∅ ∈ On
10	9	elimel 4551	. . . . 5 ⊢ if(𝐴 ∈ On, 𝐴, ∅) ∈ On
11	10	onuninsuci 7834	. . . 4 ⊢ (if(𝐴 ∈ On, 𝐴, ∅) = ∪ if(𝐴 ∈ On, 𝐴, ∅) ↔ ¬ ∃𝑥 ∈ On if(𝐴 ∈ On, 𝐴, ∅) = suc 𝑥)
12	8, 11	dedth 4540	. . 3 ⊢ (𝐴 ∈ On → (𝐴 = ∪ 𝐴 ↔ ¬ ∃𝑥 ∈ On 𝐴 = suc 𝑥))
13		unon 7825	. . . . . 6 ⊢ ∪ On = On
14	13	eqcomi 2769	. . . . 5 ⊢ On = ∪ On
15		onprc 7775	. . . . . . . 8 ⊢ ¬ On ∈ V
16		vex 3454	. . . . . . . . . 10 ⊢ 𝑥 ∈ V
17	16	sucex 7803	. . . . . . . . 9 ⊢ suc 𝑥 ∈ V
18		eleq1 2848	. . . . . . . . 9 ⊢ (On = suc 𝑥 → (On ∈ V ↔ suc 𝑥 ∈ V))
19	17, 18	mpbiri 261	. . . . . . . 8 ⊢ (On = suc 𝑥 → On ∈ V)
20	15, 19	mto 200	. . . . . . 7 ⊢ ¬ On = suc 𝑥
21	20	a1i 11	. . . . . 6 ⊢ (𝑥 ∈ On → ¬ On = suc 𝑥)
22	21	nrex 3090	. . . . 5 ⊢ ¬ ∃𝑥 ∈ On On = suc 𝑥
23	14, 22	2th 267	. . . 4 ⊢ (On = ∪ On ↔ ¬ ∃𝑥 ∈ On On = suc 𝑥)
24		id 23	. . . . . 6 ⊢ (𝐴 = On → 𝐴 = On)
25		unieq 4877	. . . . . 6 ⊢ (𝐴 = On → ∪ 𝐴 = ∪ On)
26	24, 25	eqeq12d 2776	. . . . 5 ⊢ (𝐴 = On → (𝐴 = ∪ 𝐴 ↔ On = ∪ On))
27		eqeq1 2764	. . . . . . 7 ⊢ (𝐴 = On → (𝐴 = suc 𝑥 ↔ On = suc 𝑥))
28	27	rexbidv 3186	. . . . . 6 ⊢ (𝐴 = On → (∃𝑥 ∈ On 𝐴 = suc 𝑥 ↔ ∃𝑥 ∈ On On = suc 𝑥))
29	28	notbid 321	. . . . 5 ⊢ (𝐴 = On → (¬ ∃𝑥 ∈ On 𝐴 = suc 𝑥 ↔ ¬ ∃𝑥 ∈ On On = suc 𝑥))
30	26, 29	bibi12d 348	. . . 4 ⊢ (𝐴 = On → ((𝐴 = ∪ 𝐴 ↔ ¬ ∃𝑥 ∈ On 𝐴 = suc 𝑥) ↔ (On = ∪ On ↔ ¬ ∃𝑥 ∈ On On = suc 𝑥)))
31	23, 30	mpbiri 261	. . 3 ⊢ (𝐴 = On → (𝐴 = ∪ 𝐴 ↔ ¬ ∃𝑥 ∈ On 𝐴 = suc 𝑥))
32	12, 31	jaoi 871	. 2 ⊢ ((𝐴 ∈ On ∨ 𝐴 = On) → (𝐴 = ∪ 𝐴 ↔ ¬ ∃𝑥 ∈ On 𝐴 = suc 𝑥))
33	1, 32	sylbi 220	1 ⊢ (Ord 𝐴 → (𝐴 = ∪ 𝐴 ↔ ¬ ∃𝑥 ∈ On 𝐴 = suc 𝑥))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∨ wo 861   = wceq 1570   ∈ wcel 2145  ∃wrex 3086  Vcvv 3450  ∅c0 4278  ifcif 4481  ∪ cuni 4866  Ord word 6350  Oncon0 6351  suc csuc 6353

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 2732  ax-sep 5248  ax-nul 5259  ax-pr 5390  ax-un 7734

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 2739  df-cleq 2752  df-clel 2835  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-pss 3918  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-br 5103  df-opab 5167  df-tr 5212  df-eprel 5547  df-po 5555  df-so 5556  df-fr 5600  df-we 5602  df-ord 6354  df-on 6355  df-suc 6357

This theorem is used by:  ordunisuc2  7838  ordzsl  7839  dflim3  7841  nnsuc  7878  onsupsucismax  44224