Theorem ordunisuc2r 4636

Description: An ordinal which contains the successor of each of its members is equal to its union. (Contributed by Jim Kingdon, 14-Nov-2018.)

Assertion

Ref	Expression
ordunisuc2r	⊢ (Ord 𝐴 → (∀𝑥 ∈ 𝐴 suc 𝑥 ∈ 𝐴 → 𝐴 = ∪ 𝐴))

Distinct variable group:   𝑥,𝐴

Proof of Theorem ordunisuc2r

Step	Hyp	Ref	Expression
1		vex 2816	. . . . . . . . 9 ⊢ 𝑥 ∈ V
2	1	sucid 4538	. . . . . . . 8 ⊢ 𝑥 ∈ suc 𝑥
3		elunii 3919	. . . . . . . 8 ⊢ ((𝑥 ∈ suc 𝑥 ∧ suc 𝑥 ∈ 𝐴) → 𝑥 ∈ ∪ 𝐴)
4	2, 3	mpan 424	. . . . . . 7 ⊢ (suc 𝑥 ∈ 𝐴 → 𝑥 ∈ ∪ 𝐴)
5	4	imim2i 12	. . . . . 6 ⊢ ((𝑥 ∈ 𝐴 → suc 𝑥 ∈ 𝐴) → (𝑥 ∈ 𝐴 → 𝑥 ∈ ∪ 𝐴))
6	5	alimi 1504	. . . . 5 ⊢ (∀𝑥(𝑥 ∈ 𝐴 → suc 𝑥 ∈ 𝐴) → ∀𝑥(𝑥 ∈ 𝐴 → 𝑥 ∈ ∪ 𝐴))
7		df-ral 2525	. . . . 5 ⊢ (∀𝑥 ∈ 𝐴 suc 𝑥 ∈ 𝐴 ↔ ∀𝑥(𝑥 ∈ 𝐴 → suc 𝑥 ∈ 𝐴))
8		ssalel 3226	. . . . 5 ⊢ (𝐴 ⊆ ∪ 𝐴 ↔ ∀𝑥(𝑥 ∈ 𝐴 → 𝑥 ∈ ∪ 𝐴))
9	6, 7, 8	3imtr4i 201	. . . 4 ⊢ (∀𝑥 ∈ 𝐴 suc 𝑥 ∈ 𝐴 → 𝐴 ⊆ ∪ 𝐴)
10	9	a1i 9	. . 3 ⊢ (Ord 𝐴 → (∀𝑥 ∈ 𝐴 suc 𝑥 ∈ 𝐴 → 𝐴 ⊆ ∪ 𝐴))
11		orduniss 4546	. . 3 ⊢ (Ord 𝐴 → ∪ 𝐴 ⊆ 𝐴)
12	10, 11	jctird 317	. 2 ⊢ (Ord 𝐴 → (∀𝑥 ∈ 𝐴 suc 𝑥 ∈ 𝐴 → (𝐴 ⊆ ∪ 𝐴 ∧ ∪ 𝐴 ⊆ 𝐴)))
13		eqss 3253	. 2 ⊢ (𝐴 = ∪ 𝐴 ↔ (𝐴 ⊆ ∪ 𝐴 ∧ ∪ 𝐴 ⊆ 𝐴))
14	12, 13	imbitrrdi 162	1 ⊢ (Ord 𝐴 → (∀𝑥 ∈ 𝐴 suc 𝑥 ∈ 𝐴 → 𝐴 = ∪ 𝐴))

Syntax hints:   → wi 4   ∧ wa 104  ∀wal 1396   = wceq 1398   ∈ wcel 2203  ∀wral 2520   ⊆ wss 3211  ∪ cuni 3914  Ord word 4483  suc csuc 4486

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-ext 2214

This theorem depends on definitions:  df-bi 117  df-tru 1401  df-nf 1510  df-sb 1812  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ral 2525  df-v 2815  df-un 3215  df-in 3217  df-ss 3224  df-sn 3695  df-uni 3915  df-tr 4209  df-iord 4487  df-suc 4492

This theorem is referenced by: (None)