Theorem caovordid 5984

Description: Convert an operation ordering law to class notation. (Contributed by Mario Carneiro, 31-Dec-2014.)

Hypotheses

Ref	Expression
caovordig.1	⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → (𝑥𝑅𝑦 → (𝑧𝐹𝑥)𝑅(𝑧𝐹𝑦)))
caovordid.2	⊢ (𝜑 → 𝐴 ∈ 𝑆)
caovordid.3	⊢ (𝜑 → 𝐵 ∈ 𝑆)
caovordid.4	⊢ (𝜑 → 𝐶 ∈ 𝑆)

Assertion

Ref	Expression
caovordid	⊢ (𝜑 → (𝐴𝑅𝐵 → (𝐶𝐹𝐴)𝑅(𝐶𝐹𝐵)))

Distinct variable groups:   𝑥,𝑦,𝑧,𝐴   𝑥,𝐵,𝑦,𝑧   𝑥,𝐶,𝑦,𝑧   𝜑,𝑥,𝑦,𝑧   𝑥,𝐹,𝑦,𝑧   𝑥,𝑅,𝑦,𝑧   𝑥,𝑆,𝑦,𝑧

Proof of Theorem caovordid

Step	Hyp	Ref	Expression
1		id 19	. 2 ⊢ (𝜑 → 𝜑)
2		caovordid.2	. 2 ⊢ (𝜑 → 𝐴 ∈ 𝑆)
3		caovordid.3	. 2 ⊢ (𝜑 → 𝐵 ∈ 𝑆)
4		caovordid.4	. 2 ⊢ (𝜑 → 𝐶 ∈ 𝑆)
5		caovordig.1	. . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → (𝑥𝑅𝑦 → (𝑧𝐹𝑥)𝑅(𝑧𝐹𝑦)))
6	5	caovordig 5983	. 2 ⊢ ((𝜑 ∧ (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆)) → (𝐴𝑅𝐵 → (𝐶𝐹𝐴)𝑅(𝐶𝐹𝐵)))
7	1, 2, 3, 4, 6	syl13anc 1222	1 ⊢ (𝜑 → (𝐴𝑅𝐵 → (𝐶𝐹𝐴)𝑅(𝐶𝐹𝐵)))

Syntax hints:   → wi 4   ∧ wa 103   ∧ w3a 963   ∈ wcel 2128   class class class wbr 3965  (class class class)co 5821

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 699  ax-5 1427  ax-7 1428  ax-gen 1429  ax-ie1 1473  ax-ie2 1474  ax-8 1484  ax-10 1485  ax-11 1486  ax-i12 1487  ax-bndl 1489  ax-4 1490  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2139

This theorem depends on definitions:  df-bi 116  df-3an 965  df-tru 1338  df-nf 1441  df-sb 1743  df-clab 2144  df-cleq 2150  df-clel 2153  df-nfc 2288  df-ral 2440  df-rex 2441  df-v 2714  df-un 3106  df-sn 3566  df-pr 3567  df-op 3569  df-uni 3773  df-br 3966  df-iota 5134  df-fv 5177  df-ov 5824

This theorem is referenced by: (None)