Theorem caovord3 5984

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 5983	. . . 4 ⊢ (𝐵 ∈ 𝑆 → (𝐴𝑅𝐶 ↔ (𝐴𝐹𝐵)𝑅(𝐶𝐹𝐵)))
7	6	adantr 274	. . 3 ⊢ ((𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆) → (𝐴𝑅𝐶 ↔ (𝐴𝐹𝐵)𝑅(𝐶𝐹𝐵)))
8		breq1 3964	. . 3 ⊢ ((𝐴𝐹𝐵) = (𝐶𝐹𝐷) → ((𝐴𝐹𝐵)𝑅(𝐶𝐹𝐵) ↔ (𝐶𝐹𝐷)𝑅(𝐶𝐹𝐵)))
9	7, 8	sylan9bb 458	. 2 ⊢ (((𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆) ∧ (𝐴𝐹𝐵) = (𝐶𝐹𝐷)) → (𝐴𝑅𝐶 ↔ (𝐶𝐹𝐷)𝑅(𝐶𝐹𝐵)))
10		caovord3.4	. . . 4 ⊢ 𝐷 ∈ V
11	10, 4, 3	caovord 5982	. . 3 ⊢ (𝐶 ∈ 𝑆 → (𝐷𝑅𝐵 ↔ (𝐶𝐹𝐷)𝑅(𝐶𝐹𝐵)))
12	11	ad2antlr 481	. 2 ⊢ (((𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆) ∧ (𝐴𝐹𝐵) = (𝐶𝐹𝐷)) → (𝐷𝑅𝐵 ↔ (𝐶𝐹𝐷)𝑅(𝐶𝐹𝐵)))
13	9, 12	bitr4d 190	1 ⊢ (((𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆) ∧ (𝐴𝐹𝐵) = (𝐶𝐹𝐷)) → (𝐴𝑅𝐶 ↔ 𝐷𝑅𝐵))

Syntax hints:   → wi 4   ∧ wa 103   ↔ wb 104   = wceq 1332   ∈ wcel 2125  Vcvv 2709   class class class wbr 3961  (class class class)co 5814

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 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1481  ax-10 1482  ax-11 1483  ax-i12 1484  ax-bndl 1486  ax-4 1487  ax-17 1503  ax-i9 1507  ax-ial 1511  ax-i5r 1512  ax-ext 2136

This theorem depends on definitions:  df-bi 116  df-3an 965  df-tru 1335  df-nf 1438  df-sb 1740  df-clab 2141  df-cleq 2147  df-clel 2150  df-nfc 2285  df-ral 2437  df-rex 2438  df-v 2711  df-un 3102  df-sn 3562  df-pr 3563  df-op 3565  df-uni 3769  df-br 3962  df-iota 5128  df-fv 5171  df-ov 5817

This theorem is referenced by: (None)