Theorem ordunidif 6408

Description: The union of an ordinal stays the same if a subset equal to one of its elements is removed. (Contributed by NM, 10-Dec-2004.)

Assertion

Ref	Expression
ordunidif	⊢ ((Ord 𝐴 ∧ 𝐵 ∈ 𝐴) → ∪ (𝐴 ∖ 𝐵) = ∪ 𝐴)

Proof of Theorem ordunidif

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ordelon 6381	. . . . . . . 8 ⊢ ((Ord 𝐴 ∧ 𝐵 ∈ 𝐴) → 𝐵 ∈ On)
2		onelss 6400	. . . . . . . 8 ⊢ (𝐵 ∈ On → (𝑥 ∈ 𝐵 → 𝑥 ⊆ 𝐵))
3	1, 2	syl 18	. . . . . . 7 ⊢ ((Ord 𝐴 ∧ 𝐵 ∈ 𝐴) → (𝑥 ∈ 𝐵 → 𝑥 ⊆ 𝐵))
4		eloni 6367	. . . . . . . . . . 11 ⊢ (𝐵 ∈ On → Ord 𝐵)
5		ordirr 6375	. . . . . . . . . . 11 ⊢ (Ord 𝐵 → ¬ 𝐵 ∈ 𝐵)
6	4, 5	syl 18	. . . . . . . . . 10 ⊢ (𝐵 ∈ On → ¬ 𝐵 ∈ 𝐵)
7		eldif 3909	. . . . . . . . . . 11 ⊢ (𝐵 ∈ (𝐴 ∖ 𝐵) ↔ (𝐵 ∈ 𝐴 ∧ ¬ 𝐵 ∈ 𝐵))
8	7	simplbi2 506	. . . . . . . . . 10 ⊢ (𝐵 ∈ 𝐴 → (¬ 𝐵 ∈ 𝐵 → 𝐵 ∈ (𝐴 ∖ 𝐵)))
9	6, 8	syl5 35	. . . . . . . . 9 ⊢ (𝐵 ∈ 𝐴 → (𝐵 ∈ On → 𝐵 ∈ (𝐴 ∖ 𝐵)))
10	9	adantl 487	. . . . . . . 8 ⊢ ((Ord 𝐴 ∧ 𝐵 ∈ 𝐴) → (𝐵 ∈ On → 𝐵 ∈ (𝐴 ∖ 𝐵)))
11	1, 10	mpd 16	. . . . . . 7 ⊢ ((Ord 𝐴 ∧ 𝐵 ∈ 𝐴) → 𝐵 ∈ (𝐴 ∖ 𝐵))
12	3, 11	jctild 535	. . . . . 6 ⊢ ((Ord 𝐴 ∧ 𝐵 ∈ 𝐴) → (𝑥 ∈ 𝐵 → (𝐵 ∈ (𝐴 ∖ 𝐵) ∧ 𝑥 ⊆ 𝐵)))
13	12	adantr 486	. . . . 5 ⊢ (((Ord 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑥 ∈ 𝐴) → (𝑥 ∈ 𝐵 → (𝐵 ∈ (𝐴 ∖ 𝐵) ∧ 𝑥 ⊆ 𝐵)))
14		sseq2 3957	. . . . . 6 ⊢ (𝑦 = 𝐵 → (𝑥 ⊆ 𝑦 ↔ 𝑥 ⊆ 𝐵))
15	14	rspcev 3576	. . . . 5 ⊢ ((𝐵 ∈ (𝐴 ∖ 𝐵) ∧ 𝑥 ⊆ 𝐵) → ∃𝑦 ∈ (𝐴 ∖ 𝐵)𝑥 ⊆ 𝑦)
16	13, 15	syl6 36	. . . 4 ⊢ (((Ord 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑥 ∈ 𝐴) → (𝑥 ∈ 𝐵 → ∃𝑦 ∈ (𝐴 ∖ 𝐵)𝑥 ⊆ 𝑦))
17		eldif 3909	. . . . . . . . 9 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) ↔ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ 𝐵))
18	17	biimpri 231	. . . . . . . 8 ⊢ ((𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ 𝐵) → 𝑥 ∈ (𝐴 ∖ 𝐵))
19		ssid 3953	. . . . . . . 8 ⊢ 𝑥 ⊆ 𝑥
20	18, 19	jctir 530	. . . . . . 7 ⊢ ((𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ 𝐵) → (𝑥 ∈ (𝐴 ∖ 𝐵) ∧ 𝑥 ⊆ 𝑥))
21	20	ex 418	. . . . . 6 ⊢ (𝑥 ∈ 𝐴 → (¬ 𝑥 ∈ 𝐵 → (𝑥 ∈ (𝐴 ∖ 𝐵) ∧ 𝑥 ⊆ 𝑥)))
22		sseq2 3957	. . . . . . 7 ⊢ (𝑦 = 𝑥 → (𝑥 ⊆ 𝑦 ↔ 𝑥 ⊆ 𝑥))
23	22	rspcev 3576	. . . . . 6 ⊢ ((𝑥 ∈ (𝐴 ∖ 𝐵) ∧ 𝑥 ⊆ 𝑥) → ∃𝑦 ∈ (𝐴 ∖ 𝐵)𝑥 ⊆ 𝑦)
24	21, 23	syl6 36	. . . . 5 ⊢ (𝑥 ∈ 𝐴 → (¬ 𝑥 ∈ 𝐵 → ∃𝑦 ∈ (𝐴 ∖ 𝐵)𝑥 ⊆ 𝑦))
25	24	adantl 487	. . . 4 ⊢ (((Ord 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑥 ∈ 𝐴) → (¬ 𝑥 ∈ 𝐵 → ∃𝑦 ∈ (𝐴 ∖ 𝐵)𝑥 ⊆ 𝑦))
26	16, 25	pm2.61d 181	. . 3 ⊢ (((Ord 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑥 ∈ 𝐴) → ∃𝑦 ∈ (𝐴 ∖ 𝐵)𝑥 ⊆ 𝑦)
27	26	ralrimiva 3154	. 2 ⊢ ((Ord 𝐴 ∧ 𝐵 ∈ 𝐴) → ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ (𝐴 ∖ 𝐵)𝑥 ⊆ 𝑦)
28		unidif 4903	. 2 ⊢ (∀𝑥 ∈ 𝐴 ∃𝑦 ∈ (𝐴 ∖ 𝐵)𝑥 ⊆ 𝑦 → ∪ (𝐴 ∖ 𝐵) = ∪ 𝐴)
29	27, 28	syl 18	1 ⊢ ((Ord 𝐴 ∧ 𝐵 ∈ 𝐴) → ∪ (𝐴 ∖ 𝐵) = ∪ 𝐴)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∀wral 3076  ∃wrex 3086   ∖ cdif 3896   ⊆ wss 3899  ∪ cuni 4867  Ord word 6356  Oncon0 6357

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 5251  ax-pr 5398

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  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 3902  df-un 3904  df-in 3906  df-ss 3916  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 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-ord 6360  df-on 6361

This theorem is used by: (None)