Metamath Proof Explorer


Theorem infxpdom

Description: Dominance law for multiplication with an infinite cardinal. (Contributed by NM, 26-Mar-2006) (Revised by Mario Carneiro, 29-Apr-2015)

Ref Expression
Assertion infxpdom ⊢ A ∈ dom ⁡ card ∧ ω ≼ A ∧ B ≼ A → A × B ≼ A

Proof

Step Hyp Ref Expression
1 xpdom2g ⊢ A ∈ dom ⁡ card ∧ B ≼ A → A × B ≼ A × A
2 1 3adant2 ⊢ A ∈ dom ⁡ card ∧ ω ≼ A ∧ B ≼ A → A × B ≼ A × A
3 infxpidm2 ⊢ A ∈ dom ⁡ card ∧ ω ≼ A → A × A ≈ A
4 3 3adant3 ⊢ A ∈ dom ⁡ card ∧ ω ≼ A ∧ B ≼ A → A × A ≈ A
5 domentr ⊢ A × B ≼ A × A ∧ A × A ≈ A → A × B ≼ A
6 2 4 5 syl2anc ⊢ A ∈ dom ⁡ card ∧ ω ≼ A ∧ B ≼ A → A × B ≼ A