Theorem caovord3 5876

Description: Ordering law. (Contributed by NM, 29-Feb-1996.)

Hypotheses

Ref	Expression
caovord.1	⊢ 𝐴 ∈ V
caovord.2	⊢ 𝐵 ∈ V
caovord.3	⊢ (𝑧 ∈ 𝑆 → (𝑥𝑅𝑦 ↔ (𝑧𝐹𝑥)𝑅(𝑧𝐹𝑦)))
caovord2.3	⊢ 𝐶 ∈ V
caovord2.com	⊢ (𝑥𝐹𝑦) = (𝑦𝐹𝑥)
caovord3.4	⊢ 𝐷 ∈ V

Assertion

Ref	Expression
caovord3	⊢ (((𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆) ∧ (𝐴𝐹𝐵) = (𝐶𝐹𝐷)) → (𝐴𝑅𝐶 ↔ 𝐷𝑅𝐵))

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

Proof of Theorem caovord3

Step	Hyp	Ref	Expression
1		caovord.1	. . . . 5 ⊢ 𝐴 ∈ V
2		caovord2.3	. . . . 5 ⊢ 𝐶 ∈ V
3		caovord.3	. . . . 5 ⊢ (𝑧 ∈ 𝑆 → (𝑥𝑅𝑦 ↔ (𝑧𝐹𝑥)𝑅(𝑧𝐹𝑦)))
4		caovord.2	. . . . 5 ⊢ 𝐵 ∈ V
5		caovord2.com	. . . . 5 ⊢ (𝑥𝐹𝑦) = (𝑦𝐹𝑥)
6	1, 2, 3, 4, 5	caovord2 5875	. . . 4 ⊢ (𝐵 ∈ 𝑆 → (𝐴𝑅𝐶 ↔ (𝐴𝐹𝐵)𝑅(𝐶𝐹𝐵)))
7	6	adantr 272	. . 3 ⊢ ((𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆) → (𝐴𝑅𝐶 ↔ (𝐴𝐹𝐵)𝑅(𝐶𝐹𝐵)))
8		breq1 3878	. . 3 ⊢ ((𝐴𝐹𝐵) = (𝐶𝐹𝐷) → ((𝐴𝐹𝐵)𝑅(𝐶𝐹𝐵) ↔ (𝐶𝐹𝐷)𝑅(𝐶𝐹𝐵)))
9	7, 8	sylan9bb 453	. 2 ⊢ (((𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆) ∧ (𝐴𝐹𝐵) = (𝐶𝐹𝐷)) → (𝐴𝑅𝐶 ↔ (𝐶𝐹𝐷)𝑅(𝐶𝐹𝐵)))
10		caovord3.4	. . . 4 ⊢ 𝐷 ∈ V
11	10, 4, 3	caovord 5874	. . 3 ⊢ (𝐶 ∈ 𝑆 → (𝐷𝑅𝐵 ↔ (𝐶𝐹𝐷)𝑅(𝐶𝐹𝐵)))
12	11	ad2antlr 476	. 2 ⊢ (((𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆) ∧ (𝐴𝐹𝐵) = (𝐶𝐹𝐷)) → (𝐷𝑅𝐵 ↔ (𝐶𝐹𝐷)𝑅(𝐶𝐹𝐵)))
13	9, 12	bitr4d 190	1 ⊢ (((𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆) ∧ (𝐴𝐹𝐵) = (𝐶𝐹𝐷)) → (𝐴𝑅𝐶 ↔ 𝐷𝑅𝐵))

Syntax hints:   → wi 4   ∧ wa 103   ↔ wb 104   = wceq 1299   ∈ wcel 1448  Vcvv 2641   class class class wbr 3875  (class class class)co 5706

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 671  ax-5 1391  ax-7 1392  ax-gen 1393  ax-ie1 1437  ax-ie2 1438  ax-8 1450  ax-10 1451  ax-11 1452  ax-i12 1453  ax-bndl 1454  ax-4 1455  ax-17 1474  ax-i9 1478  ax-ial 1482  ax-i5r 1483  ax-ext 2082

This theorem depends on definitions:  df-bi 116  df-3an 932  df-tru 1302  df-nf 1405  df-sb 1704  df-clab 2087  df-cleq 2093  df-clel 2096  df-nfc 2229  df-ral 2380  df-rex 2381  df-v 2643  df-un 3025  df-sn 3480  df-pr 3481  df-op 3483  df-uni 3684  df-br 3876  df-iota 5024  df-fv 5067  df-ov 5709

This theorem is referenced by: (None)