Metamath Proof Explorer


Theorem chnrun

Description: Satisfying either of two chain relations is sufficient to make a chain under their union. (Contributed by Ender Ting, 24-Jul-2026)

Ref Expression
Assertion chnrun ⊢ A ∈ Chain B R ∨ A ∈ Chain B < ˙ → A ∈ Chain B R ∪ < ˙

Proof

Step Hyp Ref Expression
1 ssun1 ⊢ R ⊆ R ∪ < ˙
2 chnrss ⊢ R ⊆ R ∪ < ˙ → Chain B R ⊆ Chain B R ∪ < ˙
3 1 2 ax-mp ⊢ Chain B R ⊆ Chain B R ∪ < ˙
4 3 sseli ⊢ A ∈ Chain B R → A ∈ Chain B R ∪ < ˙
5 ssun2 ⊢ < ˙ ⊆ R ∪ < ˙
6 chnrss ⊢ < ˙ ⊆ R ∪ < ˙ → Chain B < ˙ ⊆ Chain B R ∪ < ˙
7 5 6 ax-mp ⊢ Chain B < ˙ ⊆ Chain B R ∪ < ˙
8 7 sseli ⊢ A ∈ Chain B < ˙ → A ∈ Chain B R ∪ < ˙
9 4 8 jaoi ⊢ A ∈ Chain B R ∨ A ∈ Chain B < ˙ → A ∈ Chain B R ∪ < ˙