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

Theorem ltordlem 11770
Description: Lemma for ltord1 11771. (Contributed by Mario Carneiro, 14-Jun-2014.)
Hypotheses
Ref Expression
ltord.1 (𝑥 = 𝑦𝐴 = 𝐵)
ltord.2 (𝑥 = 𝐶𝐴 = 𝑀)
ltord.3 (𝑥 = 𝐷𝐴 = 𝑁)
ltord.4 𝑆 ⊆ ℝ
ltord.5 ((𝜑𝑥𝑆) → 𝐴 ∈ ℝ)
ltord.6 ((𝜑 ∧ (𝑥𝑆𝑦𝑆)) → (𝑥 < 𝑦𝐴 < 𝐵))
Assertion
Ref Expression
ltordlem ((𝜑 ∧ (𝐶𝑆𝐷𝑆)) → (𝐶 < 𝐷𝑀 < 𝑁))
Distinct variable groups:   𝑥,𝐵   𝑥,𝑦,𝐶   𝑥,𝐷,𝑦   𝑥,𝑀,𝑦   𝑥,𝑁,𝑦   𝜑,𝑥,𝑦   𝑥,𝑆,𝑦
Allowed substitution hints:   𝐴(𝑥,𝑦)   𝐵(𝑦)

Proof of Theorem ltordlem
StepHypRef Expression
1 ltord.6 . . 3 ((𝜑 ∧ (𝑥𝑆𝑦𝑆)) → (𝑥 < 𝑦𝐴 < 𝐵))
21ralrimivva 3189 . 2 (𝜑 → ∀𝑥𝑆𝑦𝑆 (𝑥 < 𝑦𝐴 < 𝐵))
3 breq1 5126 . . . 4 (𝑥 = 𝐶 → (𝑥 < 𝑦𝐶 < 𝑦))
4 ltord.2 . . . . 5 (𝑥 = 𝐶𝐴 = 𝑀)
54breq1d 5133 . . . 4 (𝑥 = 𝐶 → (𝐴 < 𝐵𝑀 < 𝐵))
63, 5imbi12d 344 . . 3 (𝑥 = 𝐶 → ((𝑥 < 𝑦𝐴 < 𝐵) ↔ (𝐶 < 𝑦𝑀 < 𝐵)))
7 breq2 5127 . . . 4 (𝑦 = 𝐷 → (𝐶 < 𝑦𝐶 < 𝐷))
8 eqeq1 2738 . . . . . . 7 (𝑥 = 𝑦 → (𝑥 = 𝐷𝑦 = 𝐷))
9 ltord.1 . . . . . . . 8 (𝑥 = 𝑦𝐴 = 𝐵)
109eqeq1d 2736 . . . . . . 7 (𝑥 = 𝑦 → (𝐴 = 𝑁𝐵 = 𝑁))
118, 10imbi12d 344 . . . . . 6 (𝑥 = 𝑦 → ((𝑥 = 𝐷𝐴 = 𝑁) ↔ (𝑦 = 𝐷𝐵 = 𝑁)))
12 ltord.3 . . . . . 6 (𝑥 = 𝐷𝐴 = 𝑁)
1311, 12chvarvv 1997 . . . . 5 (𝑦 = 𝐷𝐵 = 𝑁)
1413breq2d 5135 . . . 4 (𝑦 = 𝐷 → (𝑀 < 𝐵𝑀 < 𝑁))
157, 14imbi12d 344 . . 3 (𝑦 = 𝐷 → ((𝐶 < 𝑦𝑀 < 𝐵) ↔ (𝐶 < 𝐷𝑀 < 𝑁)))
166, 15rspc2v 3616 . 2 ((𝐶𝑆𝐷𝑆) → (∀𝑥𝑆𝑦𝑆 (𝑥 < 𝑦𝐴 < 𝐵) → (𝐶 < 𝐷𝑀 < 𝑁)))
172, 16mpan9 506 1 ((𝜑 ∧ (𝐶𝑆𝐷𝑆)) → (𝐶 < 𝐷𝑀 < 𝑁))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1539  wcel 2107  wral 3050  wss 3931   class class class wbr 5123  cr 11136   < clt 11277
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1794  ax-4 1808  ax-5 1909  ax-6 1966  ax-7 2006  ax-8 2109  ax-9 2117  ax-ext 2706
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1779  df-sb 2064  df-clab 2713  df-cleq 2726  df-clel 2808  df-ral 3051  df-rab 3420  df-v 3465  df-dif 3934  df-un 3936  df-ss 3948  df-nul 4314  df-if 4506  df-sn 4607  df-pr 4609  df-op 4613  df-br 5124
This theorem is referenced by:  ltord1  11771
  Copyright terms: Public domain W3C validator