caovord - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > caovord		Structured version Visualization version GIF version

Theorem caovord 7653

Description: Convert an operation ordering law to class notation. (Contributed by NM, 19-Feb-1996.)

**Hypotheses**
Ref	Expression
caovord.1	⊢ 𝐴 ∈ V
caovord.2	⊢ 𝐵 ∈ V
caovord.3	⊢ (𝑧 ∈ 𝑆 → (𝑥𝑅𝑦 ↔ (𝑧𝐹𝑥)𝑅(𝑧𝐹𝑦)))

**Assertion**
Ref	Expression
caovord	⊢ (𝐶 ∈ 𝑆 → (𝐴𝑅𝐵 ↔ (𝐶𝐹𝐴)𝑅(𝐶𝐹𝐵)))

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

**Proof of Theorem caovord**
Step	Hyp	Ref	Expression
1		oveq1 7447	. . . 4 ⊢ (𝑧 = 𝐶 → (𝑧𝐹𝐴) = (𝐶𝐹𝐴))
2		oveq1 7447	. . . 4 ⊢ (𝑧 = 𝐶 → (𝑧𝐹𝐵) = (𝐶𝐹𝐵))
3	1, 2	breq12d 5119	. . 3 ⊢ (𝑧 = 𝐶 → ((𝑧𝐹𝐴)𝑅(𝑧𝐹𝐵) ↔ (𝐶𝐹𝐴)𝑅(𝐶𝐹𝐵)))
4	3	bibi2d 345	. 2 ⊢ (𝑧 = 𝐶 → ((𝐴𝑅𝐵 ↔ (𝑧𝐹𝐴)𝑅(𝑧𝐹𝐵)) ↔ (𝐴𝑅𝐵 ↔ (𝐶𝐹𝐴)𝑅(𝐶𝐹𝐵))))
5		caovord.1	. . 3 ⊢ 𝐴 ∈ V
6		caovord.2	. . 3 ⊢ 𝐵 ∈ V
7		breq1 5109	. . . . . 6 ⊢ (𝑥 = 𝐴 → (𝑥𝑅𝑦 ↔ 𝐴𝑅𝑦))
8		oveq2 7448	. . . . . . 7 ⊢ (𝑥 = 𝐴 → (𝑧𝐹𝑥) = (𝑧𝐹𝐴))
9	8	breq1d 5116	. . . . . 6 ⊢ (𝑥 = 𝐴 → ((𝑧𝐹𝑥)𝑅(𝑧𝐹𝑦) ↔ (𝑧𝐹𝐴)𝑅(𝑧𝐹𝑦)))
10	7, 9	bibi12d 348	. . . . 5 ⊢ (𝑥 = 𝐴 → ((𝑥𝑅𝑦 ↔ (𝑧𝐹𝑥)𝑅(𝑧𝐹𝑦)) ↔ (𝐴𝑅𝑦 ↔ (𝑧𝐹𝐴)𝑅(𝑧𝐹𝑦))))
11		breq2 5110	. . . . . 6 ⊢ (𝑦 = 𝐵 → (𝐴𝑅𝑦 ↔ 𝐴𝑅𝐵))
12		oveq2 7448	. . . . . . 7 ⊢ (𝑦 = 𝐵 → (𝑧𝐹𝑦) = (𝑧𝐹𝐵))
13	12	breq2d 5118	. . . . . 6 ⊢ (𝑦 = 𝐵 → ((𝑧𝐹𝐴)𝑅(𝑧𝐹𝑦) ↔ (𝑧𝐹𝐴)𝑅(𝑧𝐹𝐵)))
14	11, 13	bibi12d 348	. . . . 5 ⊢ (𝑦 = 𝐵 → ((𝐴𝑅𝑦 ↔ (𝑧𝐹𝐴)𝑅(𝑧𝐹𝑦)) ↔ (𝐴𝑅𝐵 ↔ (𝑧𝐹𝐴)𝑅(𝑧𝐹𝐵))))
15	10, 14	sylan9bb 519	. . . 4 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → ((𝑥𝑅𝑦 ↔ (𝑧𝐹𝑥)𝑅(𝑧𝐹𝑦)) ↔ (𝐴𝑅𝐵 ↔ (𝑧𝐹𝐴)𝑅(𝑧𝐹𝐵))))
16	15	imbi2d 343	. . 3 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → ((𝑧 ∈ 𝑆 → (𝑥𝑅𝑦 ↔ (𝑧𝐹𝑥)𝑅(𝑧𝐹𝑦))) ↔ (𝑧 ∈ 𝑆 → (𝐴𝑅𝐵 ↔ (𝑧𝐹𝐴)𝑅(𝑧𝐹𝐵)))))
17		caovord.3	. . 3 ⊢ (𝑧 ∈ 𝑆 → (𝑥𝑅𝑦 ↔ (𝑧𝐹𝑥)𝑅(𝑧𝐹𝑦)))
18	5, 6, 16, 17	vtocl2 3530	. 2 ⊢ (𝑧 ∈ 𝑆 → (𝐴𝑅𝐵 ↔ (𝑧𝐹𝐴)𝑅(𝑧𝐹𝐵)))
19	4, 18	vtoclga 3540	1 ⊢ (𝐶 ∈ 𝑆 → (𝐴𝑅𝐵 ↔ (𝐶𝐹𝐴)𝑅(𝐶𝐹𝐵)))

Colors of variables: wff setvar class

This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2147 Vcvv 3454 class class class wbr 5106 (class class class)co 7440

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-ext 2735

This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2102 df-clab 2742 df-cleq 2755 df-clel 2839 df-rab 3417 df-v 3456 df-ss 3901 df-dif 4050 df-un 4154 df-nul 4282 df-if 4486 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-br 5107 df-iota 6509 df-fv 6563 df-ov 7443

This theorem is used by: caovord2 7654 caovord3 7655 genpcl 11117

W3C validator