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

Theorem swopolem 5478
Description: Perform the substitutions into the strict weak ordering law. (Contributed by Mario Carneiro, 31-Dec-2014.)
Hypothesis
Ref Expression
swopolem.1 ((𝜑 ∧ (𝑥𝐴𝑦𝐴𝑧𝐴)) → (𝑥𝑅𝑦 → (𝑥𝑅𝑧𝑧𝑅𝑦)))
Assertion
Ref Expression
swopolem ((𝜑 ∧ (𝑋𝐴𝑌𝐴𝑍𝐴)) → (𝑋𝑅𝑌 → (𝑋𝑅𝑍𝑍𝑅𝑌)))
Distinct variable groups:   𝑥,𝑦,𝑧,𝐴   𝜑,𝑥,𝑦,𝑧   𝑥,𝑅,𝑦,𝑧   𝑥,𝑋,𝑦,𝑧   𝑦,𝑌,𝑧   𝑧,𝑍
Allowed substitution hints:   𝑌(𝑥)   𝑍(𝑥,𝑦)

Proof of Theorem swopolem
StepHypRef Expression
1 swopolem.1 . . 3 ((𝜑 ∧ (𝑥𝐴𝑦𝐴𝑧𝐴)) → (𝑥𝑅𝑦 → (𝑥𝑅𝑧𝑧𝑅𝑦)))
21ralrimivvva 3192 . 2 (𝜑 → ∀𝑥𝐴𝑦𝐴𝑧𝐴 (𝑥𝑅𝑦 → (𝑥𝑅𝑧𝑧𝑅𝑦)))
3 breq1 5062 . . . 4 (𝑥 = 𝑋 → (𝑥𝑅𝑦𝑋𝑅𝑦))
4 breq1 5062 . . . . 5 (𝑥 = 𝑋 → (𝑥𝑅𝑧𝑋𝑅𝑧))
54orbi1d 913 . . . 4 (𝑥 = 𝑋 → ((𝑥𝑅𝑧𝑧𝑅𝑦) ↔ (𝑋𝑅𝑧𝑧𝑅𝑦)))
63, 5imbi12d 347 . . 3 (𝑥 = 𝑋 → ((𝑥𝑅𝑦 → (𝑥𝑅𝑧𝑧𝑅𝑦)) ↔ (𝑋𝑅𝑦 → (𝑋𝑅𝑧𝑧𝑅𝑦))))
7 breq2 5063 . . . 4 (𝑦 = 𝑌 → (𝑋𝑅𝑦𝑋𝑅𝑌))
8 breq2 5063 . . . . 5 (𝑦 = 𝑌 → (𝑧𝑅𝑦𝑧𝑅𝑌))
98orbi2d 912 . . . 4 (𝑦 = 𝑌 → ((𝑋𝑅𝑧𝑧𝑅𝑦) ↔ (𝑋𝑅𝑧𝑧𝑅𝑌)))
107, 9imbi12d 347 . . 3 (𝑦 = 𝑌 → ((𝑋𝑅𝑦 → (𝑋𝑅𝑧𝑧𝑅𝑦)) ↔ (𝑋𝑅𝑌 → (𝑋𝑅𝑧𝑧𝑅𝑌))))
11 breq2 5063 . . . . 5 (𝑧 = 𝑍 → (𝑋𝑅𝑧𝑋𝑅𝑍))
12 breq1 5062 . . . . 5 (𝑧 = 𝑍 → (𝑧𝑅𝑌𝑍𝑅𝑌))
1311, 12orbi12d 915 . . . 4 (𝑧 = 𝑍 → ((𝑋𝑅𝑧𝑧𝑅𝑌) ↔ (𝑋𝑅𝑍𝑍𝑅𝑌)))
1413imbi2d 343 . . 3 (𝑧 = 𝑍 → ((𝑋𝑅𝑌 → (𝑋𝑅𝑧𝑧𝑅𝑌)) ↔ (𝑋𝑅𝑌 → (𝑋𝑅𝑍𝑍𝑅𝑌))))
156, 10, 14rspc3v 3636 . 2 ((𝑋𝐴𝑌𝐴𝑍𝐴) → (∀𝑥𝐴𝑦𝐴𝑧𝐴 (𝑥𝑅𝑦 → (𝑥𝑅𝑧𝑧𝑅𝑦)) → (𝑋𝑅𝑌 → (𝑋𝑅𝑍𝑍𝑅𝑌))))
162, 15mpan9 509 1 ((𝜑 ∧ (𝑋𝐴𝑌𝐴𝑍𝐴)) → (𝑋𝑅𝑌 → (𝑋𝑅𝑍𝑍𝑅𝑌)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 398  wo 843  w3a 1083   = wceq 1533  wcel 2110  wral 3138   class class class wbr 5059
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2156  ax-12 2172  ax-ext 2793
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ral 3143  df-rab 3147  df-v 3497  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-nul 4292  df-if 4468  df-sn 4562  df-pr 4564  df-op 4568  df-br 5060
This theorem is referenced by:  swoer  8313  swoord1  8314  swoord2  8315
  Copyright terms: Public domain W3C validator