Metamath Proof Explorer


Theorem divdiv32d

Description: Swap denominators in a division. (Contributed by Mario Carneiro, 27-May-2016)

Ref Expression
Hypotheses div1d.1 ⊢ φ → A ∈ ℂ
divcld.2 ⊢ φ → B ∈ ℂ
divmuld.3 ⊢ φ → C ∈ ℂ
divmuld.4 ⊢ φ → B ≠ 0
divdiv23d.5 ⊢ φ → C ≠ 0
Assertion divdiv32d ⊢ φ → A B C = A C B

Proof

Step Hyp Ref Expression
1 div1d.1 ⊢ φ → A ∈ ℂ
2 divcld.2 ⊢ φ → B ∈ ℂ
3 divmuld.3 ⊢ φ → C ∈ ℂ
4 divmuld.4 ⊢ φ → B ≠ 0
5 divdiv23d.5 ⊢ φ → C ≠ 0
6 divdiv32 ⊢ A ∈ ℂ ∧ B ∈ ℂ ∧ B ≠ 0 ∧ C ∈ ℂ ∧ C ≠ 0 → A B C = A C B
7 1 2 4 3 5 6 syl122anc ⊢ φ → A B C = A C B