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

Theorem ltordlem 10591
 Description: Lemma for ltord1 10592. (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 3000 . 2 (𝜑 → ∀𝑥𝑆𝑦𝑆 (𝑥 < 𝑦𝐴 < 𝐵))
3 breq1 4688 . . . 4 (𝑥 = 𝐶 → (𝑥 < 𝑦𝐶 < 𝑦))
4 ltord.2 . . . . 5 (𝑥 = 𝐶𝐴 = 𝑀)
54breq1d 4695 . . . 4 (𝑥 = 𝐶 → (𝐴 < 𝐵𝑀 < 𝐵))
63, 5imbi12d 333 . . 3 (𝑥 = 𝐶 → ((𝑥 < 𝑦𝐴 < 𝐵) ↔ (𝐶 < 𝑦𝑀 < 𝐵)))
7 breq2 4689 . . . 4 (𝑦 = 𝐷 → (𝐶 < 𝑦𝐶 < 𝐷))
8 eqeq1 2655 . . . . . . 7 (𝑥 = 𝑦 → (𝑥 = 𝐷𝑦 = 𝐷))
9 ltord.1 . . . . . . . 8 (𝑥 = 𝑦𝐴 = 𝐵)
109eqeq1d 2653 . . . . . . 7 (𝑥 = 𝑦 → (𝐴 = 𝑁𝐵 = 𝑁))
118, 10imbi12d 333 . . . . . 6 (𝑥 = 𝑦 → ((𝑥 = 𝐷𝐴 = 𝑁) ↔ (𝑦 = 𝐷𝐵 = 𝑁)))
12 ltord.3 . . . . . 6 (𝑥 = 𝐷𝐴 = 𝑁)
1311, 12chvarv 2299 . . . . 5 (𝑦 = 𝐷𝐵 = 𝑁)
1413breq2d 4697 . . . 4 (𝑦 = 𝐷 → (𝑀 < 𝐵𝑀 < 𝑁))
157, 14imbi12d 333 . . 3 (𝑦 = 𝐷 → ((𝐶 < 𝑦𝑀 < 𝐵) ↔ (𝐶 < 𝐷𝑀 < 𝑁)))
166, 15rspc2v 3353 . 2 ((𝐶𝑆𝐷𝑆) → (∀𝑥𝑆𝑦𝑆 (𝑥 < 𝑦𝐴 < 𝐵) → (𝐶 < 𝐷𝑀 < 𝑁)))
172, 16mpan9 485 1 ((𝜑 ∧ (𝐶𝑆𝐷𝑆)) → (𝐶 < 𝐷𝑀 < 𝑁))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 383   = wceq 1523   ∈ wcel 2030  ∀wral 2941   ⊆ wss 3607   class class class wbr 4685  ℝcr 9973   < clt 10112 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1762  ax-4 1777  ax-5 1879  ax-6 1945  ax-7 1981  ax-9 2039  ax-10 2059  ax-11 2074  ax-12 2087  ax-13 2282  ax-ext 2631 This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3an 1056  df-tru 1526  df-ex 1745  df-nf 1750  df-sb 1938  df-clab 2638  df-cleq 2644  df-clel 2647  df-nfc 2782  df-ral 2946  df-rab 2950  df-v 3233  df-dif 3610  df-un 3612  df-in 3614  df-ss 3621  df-nul 3949  df-if 4120  df-sn 4211  df-pr 4213  df-op 4217  df-br 4686 This theorem is referenced by:  ltord1  10592
 Copyright terms: Public domain W3C validator