Metamath Proof Explorer


Theorem xpwf

Description: The Cartesian product of two well-founded sets is well-founded. (Contributed by Eric Schmidt, 12-Sep-2025)

Ref Expression
Assertion xpwf ⊢ A ∈ ⋃ R1 On ∧ B ∈ ⋃ R1 On → A × B ∈ ⋃ R1 On

Proof

Step Hyp Ref Expression
1 unwf ⊢ A ∈ ⋃ R1 On ∧ B ∈ ⋃ R1 On ↔ A ∪ B ∈ ⋃ R1 On
2 pwwf ⊢ A ∪ B ∈ ⋃ R1 On ↔ 𝒫 A ∪ B ∈ ⋃ R1 On
3 pwwf ⊢ 𝒫 A ∪ B ∈ ⋃ R1 On ↔ 𝒫 𝒫 A ∪ B ∈ ⋃ R1 On
4 1 2 3 3bitri ⊢ A ∈ ⋃ R1 On ∧ B ∈ ⋃ R1 On ↔ 𝒫 𝒫 A ∪ B ∈ ⋃ R1 On
5 xpsspw ⊢ A × B ⊆ 𝒫 𝒫 A ∪ B
6 sswf ⊢ 𝒫 𝒫 A ∪ B ∈ ⋃ R1 On ∧ A × B ⊆ 𝒫 𝒫 A ∪ B → A × B ∈ ⋃ R1 On
7 5 6 mpan2 ⊢ 𝒫 𝒫 A ∪ B ∈ ⋃ R1 On → A × B ∈ ⋃ R1 On
8 4 7 sylbi ⊢ A ∈ ⋃ R1 On ∧ B ∈ ⋃ R1 On → A × B ∈ ⋃ R1 On