Metamath Proof Explorer


Theorem unwf

Description: A binary union is well-founded iff its elements are. (Contributed by Mario Carneiro, 10-Jun-2013) (Revised by Mario Carneiro, 17-Nov-2014)

Ref Expression
Assertion unwf ⊢ A ∈ ⋃ R1 On ∧ B ∈ ⋃ R1 On ↔ A ∪ B ∈ ⋃ R1 On

Proof

Step Hyp Ref Expression
1 r1rankidb ⊢ A ∈ ⋃ R1 On → A ⊆ R1 ⁡ rank ⁡ A
2 1 adantr ⊢ A ∈ ⋃ R1 On ∧ B ∈ ⋃ R1 On → A ⊆ R1 ⁡ rank ⁡ A
3 ssun1 ⊢ rank ⁡ A ⊆ rank ⁡ A ∪ rank ⁡ B
4 rankdmr1 ⊢ rank ⁡ A ∈ dom ⁡ R1
5 r1dmlim ⊢ Lim ⁡ dom ⁡ R1
6 limord ⊢ Lim ⁡ dom ⁡ R1 → Ord ⁡ dom ⁡ R1
7 5 6 ax-mp ⊢ Ord ⁡ dom ⁡ R1
8 rankdmr1 ⊢ rank ⁡ B ∈ dom ⁡ R1
9 ordunel ⊢ Ord ⁡ dom ⁡ R1 ∧ rank ⁡ A ∈ dom ⁡ R1 ∧ rank ⁡ B ∈ dom ⁡ R1 → rank ⁡ A ∪ rank ⁡ B ∈ dom ⁡ R1
10 7 4 8 9 mp3an ⊢ rank ⁡ A ∪ rank ⁡ B ∈ dom ⁡ R1
11 r1ord3g ⊢ rank ⁡ A ∈ dom ⁡ R1 ∧ rank ⁡ A ∪ rank ⁡ B ∈ dom ⁡ R1 → rank ⁡ A ⊆ rank ⁡ A ∪ rank ⁡ B → R1 ⁡ rank ⁡ A ⊆ R1 ⁡ rank ⁡ A ∪ rank ⁡ B
12 4 10 11 mp2an ⊢ rank ⁡ A ⊆ rank ⁡ A ∪ rank ⁡ B → R1 ⁡ rank ⁡ A ⊆ R1 ⁡ rank ⁡ A ∪ rank ⁡ B
13 3 12 ax-mp ⊢ R1 ⁡ rank ⁡ A ⊆ R1 ⁡ rank ⁡ A ∪ rank ⁡ B
14 2 13 sstrdi ⊢ A ∈ ⋃ R1 On ∧ B ∈ ⋃ R1 On → A ⊆ R1 ⁡ rank ⁡ A ∪ rank ⁡ B
15 r1rankidb ⊢ B ∈ ⋃ R1 On → B ⊆ R1 ⁡ rank ⁡ B
16 15 adantl ⊢ A ∈ ⋃ R1 On ∧ B ∈ ⋃ R1 On → B ⊆ R1 ⁡ rank ⁡ B
17 ssun2 ⊢ rank ⁡ B ⊆ rank ⁡ A ∪ rank ⁡ B
18 r1ord3g ⊢ rank ⁡ B ∈ dom ⁡ R1 ∧ rank ⁡ A ∪ rank ⁡ B ∈ dom ⁡ R1 → rank ⁡ B ⊆ rank ⁡ A ∪ rank ⁡ B → R1 ⁡ rank ⁡ B ⊆ R1 ⁡ rank ⁡ A ∪ rank ⁡ B
19 8 10 18 mp2an ⊢ rank ⁡ B ⊆ rank ⁡ A ∪ rank ⁡ B → R1 ⁡ rank ⁡ B ⊆ R1 ⁡ rank ⁡ A ∪ rank ⁡ B
20 17 19 ax-mp ⊢ R1 ⁡ rank ⁡ B ⊆ R1 ⁡ rank ⁡ A ∪ rank ⁡ B
21 16 20 sstrdi ⊢ A ∈ ⋃ R1 On ∧ B ∈ ⋃ R1 On → B ⊆ R1 ⁡ rank ⁡ A ∪ rank ⁡ B
22 14 21 unssd ⊢ A ∈ ⋃ R1 On ∧ B ∈ ⋃ R1 On → A ∪ B ⊆ R1 ⁡ rank ⁡ A ∪ rank ⁡ B
23 fvex ⊢ R1 ⁡ rank ⁡ A ∪ rank ⁡ B ∈ V
24 23 elpw2 ⊢ A ∪ B ∈ 𝒫 R1 ⁡ rank ⁡ A ∪ rank ⁡ B ↔ A ∪ B ⊆ R1 ⁡ rank ⁡ A ∪ rank ⁡ B
25 22 24 sylibr ⊢ A ∈ ⋃ R1 On ∧ B ∈ ⋃ R1 On → A ∪ B ∈ 𝒫 R1 ⁡ rank ⁡ A ∪ rank ⁡ B
26 r1sucg ⊢ rank ⁡ A ∪ rank ⁡ B ∈ dom ⁡ R1 → R1 ⁡ suc ⁡ rank ⁡ A ∪ rank ⁡ B = 𝒫 R1 ⁡ rank ⁡ A ∪ rank ⁡ B
27 10 26 ax-mp ⊢ R1 ⁡ suc ⁡ rank ⁡ A ∪ rank ⁡ B = 𝒫 R1 ⁡ rank ⁡ A ∪ rank ⁡ B
28 25 27 eleqtrrdi ⊢ A ∈ ⋃ R1 On ∧ B ∈ ⋃ R1 On → A ∪ B ∈ R1 ⁡ suc ⁡ rank ⁡ A ∪ rank ⁡ B
29 r1elwf ⊢ A ∪ B ∈ R1 ⁡ suc ⁡ rank ⁡ A ∪ rank ⁡ B → A ∪ B ∈ ⋃ R1 On
30 28 29 syl ⊢ A ∈ ⋃ R1 On ∧ B ∈ ⋃ R1 On → A ∪ B ∈ ⋃ R1 On
31 ssun1 ⊢ A ⊆ A ∪ B
32 sswf ⊢ A ∪ B ∈ ⋃ R1 On ∧ A ⊆ A ∪ B → A ∈ ⋃ R1 On
33 31 32 mpan2 ⊢ A ∪ B ∈ ⋃ R1 On → A ∈ ⋃ R1 On
34 ssun2 ⊢ B ⊆ A ∪ B
35 sswf ⊢ A ∪ B ∈ ⋃ R1 On ∧ B ⊆ A ∪ B → B ∈ ⋃ R1 On
36 34 35 mpan2 ⊢ A ∪ B ∈ ⋃ R1 On → B ∈ ⋃ R1 On
37 33 36 jca ⊢ A ∪ B ∈ ⋃ R1 On → A ∈ ⋃ R1 On ∧ B ∈ ⋃ R1 On
38 30 37 impbii ⊢ A ∈ ⋃ R1 On ∧ B ∈ ⋃ R1 On ↔ A ∪ B ∈ ⋃ R1 On