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

Theorem smoel 8008
 Description: If 𝑥 is less than 𝑦 then a strictly monotone function's value will be strictly less at 𝑥 than at 𝑦. (Contributed by Andrew Salmon, 22-Nov-2011.)
Assertion
Ref Expression
smoel ((Smo 𝐵𝐴 ∈ dom 𝐵𝐶𝐴) → (𝐵𝐶) ∈ (𝐵𝐴))

Proof of Theorem smoel
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 smodm 7999 . . . . 5 (Smo 𝐵 → Ord dom 𝐵)
2 ordtr1 6213 . . . . . . 7 (Ord dom 𝐵 → ((𝐶𝐴𝐴 ∈ dom 𝐵) → 𝐶 ∈ dom 𝐵))
32ancomsd 470 . . . . . 6 (Ord dom 𝐵 → ((𝐴 ∈ dom 𝐵𝐶𝐴) → 𝐶 ∈ dom 𝐵))
43expdimp 457 . . . . 5 ((Ord dom 𝐵𝐴 ∈ dom 𝐵) → (𝐶𝐴𝐶 ∈ dom 𝐵))
51, 4sylan 584 . . . 4 ((Smo 𝐵𝐴 ∈ dom 𝐵) → (𝐶𝐴𝐶 ∈ dom 𝐵))
6 df-smo 7994 . . . . . 6 (Smo 𝐵 ↔ (𝐵:dom 𝐵⟶On ∧ Ord dom 𝐵 ∧ ∀𝑥 ∈ dom 𝐵𝑦 ∈ dom 𝐵(𝑥𝑦 → (𝐵𝑥) ∈ (𝐵𝑦))))
7 eleq1 2840 . . . . . . . . . . 11 (𝑥 = 𝐶 → (𝑥𝑦𝐶𝑦))
8 fveq2 6659 . . . . . . . . . . . 12 (𝑥 = 𝐶 → (𝐵𝑥) = (𝐵𝐶))
98eleq1d 2837 . . . . . . . . . . 11 (𝑥 = 𝐶 → ((𝐵𝑥) ∈ (𝐵𝑦) ↔ (𝐵𝐶) ∈ (𝐵𝑦)))
107, 9imbi12d 349 . . . . . . . . . 10 (𝑥 = 𝐶 → ((𝑥𝑦 → (𝐵𝑥) ∈ (𝐵𝑦)) ↔ (𝐶𝑦 → (𝐵𝐶) ∈ (𝐵𝑦))))
11 eleq2 2841 . . . . . . . . . . 11 (𝑦 = 𝐴 → (𝐶𝑦𝐶𝐴))
12 fveq2 6659 . . . . . . . . . . . 12 (𝑦 = 𝐴 → (𝐵𝑦) = (𝐵𝐴))
1312eleq2d 2838 . . . . . . . . . . 11 (𝑦 = 𝐴 → ((𝐵𝐶) ∈ (𝐵𝑦) ↔ (𝐵𝐶) ∈ (𝐵𝐴)))
1411, 13imbi12d 349 . . . . . . . . . 10 (𝑦 = 𝐴 → ((𝐶𝑦 → (𝐵𝐶) ∈ (𝐵𝑦)) ↔ (𝐶𝐴 → (𝐵𝐶) ∈ (𝐵𝐴))))
1510, 14rspc2v 3552 . . . . . . . . 9 ((𝐶 ∈ dom 𝐵𝐴 ∈ dom 𝐵) → (∀𝑥 ∈ dom 𝐵𝑦 ∈ dom 𝐵(𝑥𝑦 → (𝐵𝑥) ∈ (𝐵𝑦)) → (𝐶𝐴 → (𝐵𝐶) ∈ (𝐵𝐴))))
1615ancoms 463 . . . . . . . 8 ((𝐴 ∈ dom 𝐵𝐶 ∈ dom 𝐵) → (∀𝑥 ∈ dom 𝐵𝑦 ∈ dom 𝐵(𝑥𝑦 → (𝐵𝑥) ∈ (𝐵𝑦)) → (𝐶𝐴 → (𝐵𝐶) ∈ (𝐵𝐴))))
1716com12 32 . . . . . . 7 (∀𝑥 ∈ dom 𝐵𝑦 ∈ dom 𝐵(𝑥𝑦 → (𝐵𝑥) ∈ (𝐵𝑦)) → ((𝐴 ∈ dom 𝐵𝐶 ∈ dom 𝐵) → (𝐶𝐴 → (𝐵𝐶) ∈ (𝐵𝐴))))
18173ad2ant3 1133 . . . . . 6 ((𝐵:dom 𝐵⟶On ∧ Ord dom 𝐵 ∧ ∀𝑥 ∈ dom 𝐵𝑦 ∈ dom 𝐵(𝑥𝑦 → (𝐵𝑥) ∈ (𝐵𝑦))) → ((𝐴 ∈ dom 𝐵𝐶 ∈ dom 𝐵) → (𝐶𝐴 → (𝐵𝐶) ∈ (𝐵𝐴))))
196, 18sylbi 220 . . . . 5 (Smo 𝐵 → ((𝐴 ∈ dom 𝐵𝐶 ∈ dom 𝐵) → (𝐶𝐴 → (𝐵𝐶) ∈ (𝐵𝐴))))
2019expdimp 457 . . . 4 ((Smo 𝐵𝐴 ∈ dom 𝐵) → (𝐶 ∈ dom 𝐵 → (𝐶𝐴 → (𝐵𝐶) ∈ (𝐵𝐴))))
215, 20syld 47 . . 3 ((Smo 𝐵𝐴 ∈ dom 𝐵) → (𝐶𝐴 → (𝐶𝐴 → (𝐵𝐶) ∈ (𝐵𝐴))))
2221pm2.43d 53 . 2 ((Smo 𝐵𝐴 ∈ dom 𝐵) → (𝐶𝐴 → (𝐵𝐶) ∈ (𝐵𝐴)))
23223impia 1115 1 ((Smo 𝐵𝐴 ∈ dom 𝐵𝐶𝐴) → (𝐵𝐶) ∈ (𝐵𝐴))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 400   ∧ w3a 1085   = wceq 1539   ∈ wcel 2112  ∀wral 3071  dom cdm 5525  Ord word 6169  Oncon0 6170  ⟶wf 6332  ‘cfv 6336  Smo wsmo 7993 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1912  ax-6 1971  ax-7 2016  ax-8 2114  ax-9 2122  ax-ext 2730 This theorem depends on definitions:  df-bi 210  df-an 401  df-or 846  df-3an 1087  df-tru 1542  df-ex 1783  df-sb 2071  df-clab 2737  df-cleq 2751  df-clel 2831  df-ral 3076  df-v 3412  df-un 3864  df-in 3866  df-ss 3876  df-sn 4524  df-pr 4526  df-op 4530  df-uni 4800  df-br 5034  df-tr 5140  df-ord 6173  df-iota 6295  df-fv 6344  df-smo 7994 This theorem is referenced by:  smoiun  8009  smoel2  8011
 Copyright terms: Public domain W3C validator