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

Theorem smoel 8303
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 8294 . . . . 5 (Smo 𝐵 → Ord dom 𝐵)
2 ordtr1 6359 . . . . . . 7 (Ord dom 𝐵 → ((𝐶𝐴𝐴 ∈ dom 𝐵) → 𝐶 ∈ dom 𝐵))
32ancomsd 466 . . . . . 6 (Ord dom 𝐵 → ((𝐴 ∈ dom 𝐵𝐶𝐴) → 𝐶 ∈ dom 𝐵))
43expdimp 453 . . . . 5 ((Ord dom 𝐵𝐴 ∈ dom 𝐵) → (𝐶𝐴𝐶 ∈ dom 𝐵))
51, 4sylan 580 . . . 4 ((Smo 𝐵𝐴 ∈ dom 𝐵) → (𝐶𝐴𝐶 ∈ dom 𝐵))
6 df-smo 8289 . . . . . 6 (Smo 𝐵 ↔ (𝐵:dom 𝐵⟶On ∧ Ord dom 𝐵 ∧ ∀𝑥 ∈ dom 𝐵𝑦 ∈ dom 𝐵(𝑥𝑦 → (𝐵𝑥) ∈ (𝐵𝑦))))
7 eleq1 2825 . . . . . . . . . . 11 (𝑥 = 𝐶 → (𝑥𝑦𝐶𝑦))
8 fveq2 6840 . . . . . . . . . . . 12 (𝑥 = 𝐶 → (𝐵𝑥) = (𝐵𝐶))
98eleq1d 2822 . . . . . . . . . . 11 (𝑥 = 𝐶 → ((𝐵𝑥) ∈ (𝐵𝑦) ↔ (𝐵𝐶) ∈ (𝐵𝑦)))
107, 9imbi12d 344 . . . . . . . . . 10 (𝑥 = 𝐶 → ((𝑥𝑦 → (𝐵𝑥) ∈ (𝐵𝑦)) ↔ (𝐶𝑦 → (𝐵𝐶) ∈ (𝐵𝑦))))
11 eleq2 2826 . . . . . . . . . . 11 (𝑦 = 𝐴 → (𝐶𝑦𝐶𝐴))
12 fveq2 6840 . . . . . . . . . . . 12 (𝑦 = 𝐴 → (𝐵𝑦) = (𝐵𝐴))
1312eleq2d 2823 . . . . . . . . . . 11 (𝑦 = 𝐴 → ((𝐵𝐶) ∈ (𝐵𝑦) ↔ (𝐵𝐶) ∈ (𝐵𝐴)))
1411, 13imbi12d 344 . . . . . . . . . 10 (𝑦 = 𝐴 → ((𝐶𝑦 → (𝐵𝐶) ∈ (𝐵𝑦)) ↔ (𝐶𝐴 → (𝐵𝐶) ∈ (𝐵𝐴))))
1510, 14rspc2v 3589 . . . . . . . . 9 ((𝐶 ∈ dom 𝐵𝐴 ∈ dom 𝐵) → (∀𝑥 ∈ dom 𝐵𝑦 ∈ dom 𝐵(𝑥𝑦 → (𝐵𝑥) ∈ (𝐵𝑦)) → (𝐶𝐴 → (𝐵𝐶) ∈ (𝐵𝐴))))
1615ancoms 459 . . . . . . . 8 ((𝐴 ∈ dom 𝐵𝐶 ∈ dom 𝐵) → (∀𝑥 ∈ dom 𝐵𝑦 ∈ dom 𝐵(𝑥𝑦 → (𝐵𝑥) ∈ (𝐵𝑦)) → (𝐶𝐴 → (𝐵𝐶) ∈ (𝐵𝐴))))
1716com12 32 . . . . . . 7 (∀𝑥 ∈ dom 𝐵𝑦 ∈ dom 𝐵(𝑥𝑦 → (𝐵𝑥) ∈ (𝐵𝑦)) → ((𝐴 ∈ dom 𝐵𝐶 ∈ dom 𝐵) → (𝐶𝐴 → (𝐵𝐶) ∈ (𝐵𝐴))))
18173ad2ant3 1135 . . . . . 6 ((𝐵:dom 𝐵⟶On ∧ Ord dom 𝐵 ∧ ∀𝑥 ∈ dom 𝐵𝑦 ∈ dom 𝐵(𝑥𝑦 → (𝐵𝑥) ∈ (𝐵𝑦))) → ((𝐴 ∈ dom 𝐵𝐶 ∈ dom 𝐵) → (𝐶𝐴 → (𝐵𝐶) ∈ (𝐵𝐴))))
196, 18sylbi 216 . . . . 5 (Smo 𝐵 → ((𝐴 ∈ dom 𝐵𝐶 ∈ dom 𝐵) → (𝐶𝐴 → (𝐵𝐶) ∈ (𝐵𝐴))))
2019expdimp 453 . . . 4 ((Smo 𝐵𝐴 ∈ dom 𝐵) → (𝐶 ∈ dom 𝐵 → (𝐶𝐴 → (𝐵𝐶) ∈ (𝐵𝐴))))
215, 20syld 47 . . 3 ((Smo 𝐵𝐴 ∈ dom 𝐵) → (𝐶𝐴 → (𝐶𝐴 → (𝐵𝐶) ∈ (𝐵𝐴))))
2221pm2.43d 53 . 2 ((Smo 𝐵𝐴 ∈ dom 𝐵) → (𝐶𝐴 → (𝐵𝐶) ∈ (𝐵𝐴)))
23223impia 1117 1 ((Smo 𝐵𝐴 ∈ dom 𝐵𝐶𝐴) → (𝐵𝐶) ∈ (𝐵𝐴))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 396  w3a 1087   = wceq 1541  wcel 2106  wral 3063  dom cdm 5632  Ord word 6315  Oncon0 6316  wf 6490  cfv 6494  Smo wsmo 8288
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-ext 2707
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-sb 2068  df-clab 2714  df-cleq 2728  df-clel 2814  df-ral 3064  df-rab 3407  df-v 3446  df-dif 3912  df-un 3914  df-in 3916  df-ss 3926  df-nul 4282  df-if 4486  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4865  df-br 5105  df-tr 5222  df-ord 6319  df-iota 6446  df-fv 6502  df-smo 8289
This theorem is referenced by:  smoiun  8304  smoel2  8306
  Copyright terms: Public domain W3C validator