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

Theorem smoel 8406
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 8397 . . . . 5 (Smo 𝐵 → Ord dom 𝐵)
2 ordtr1 6433 . . . . . . 7 (Ord dom 𝐵 → ((𝐶 ∈ 𝐴 ∧ 𝐴 ∈ dom 𝐵) → 𝐶 ∈ dom 𝐵))
32ancomsd 471 . . . . . 6 (Ord dom 𝐵 → ((𝐴 ∈ dom 𝐵 ∧ 𝐶 ∈ 𝐴) → 𝐶 ∈ dom 𝐵))
43expdimp 458 . . . . 5 ((Ord dom 𝐵 ∧ 𝐴 ∈ dom 𝐵) → (𝐶 ∈ 𝐴 → 𝐶 ∈ dom 𝐵))
51, 4sylan 592 . . . 4 ((Smo 𝐵 ∧ 𝐴 ∈ dom 𝐵) → (𝐶 ∈ 𝐴 → 𝐶 ∈ dom 𝐵))
6 df-smo 8392 . . . . . 6 (Smo 𝐵 ↔ (𝐵:dom 𝐵⟶On ∧ Ord dom 𝐵 ∧ ∀𝑥 ∈ dom 𝐵∀𝑦 ∈ dom 𝐵(𝑥 ∈ 𝑦 → (𝐵‘𝑥) ∈ (𝐵‘𝑦))))
7 eleq1 2852 . . . . . . . . . . 11 (𝑥 = 𝐶 → (𝑥 ∈ 𝑦 ↔ 𝐶 ∈ 𝑦))
8 fveq2 6916 . . . . . . . . . . . 12 (𝑥 = 𝐶 → (𝐵‘𝑥) = (𝐵‘𝐶))
98eleq1d 2849 . . . . . . . . . . 11 (𝑥 = 𝐶 → ((𝐵‘𝑥) ∈ (𝐵‘𝑦) ↔ (𝐵‘𝐶) ∈ (𝐵‘𝑦)))
107, 9imbi12d 347 . . . . . . . . . 10 (𝑥 = 𝐶 → ((𝑥 ∈ 𝑦 → (𝐵‘𝑥) ∈ (𝐵‘𝑦)) ↔ (𝐶 ∈ 𝑦 → (𝐵‘𝐶) ∈ (𝐵‘𝑦))))
11 eleq2 2853 . . . . . . . . . . 11 (𝑦 = 𝐴 → (𝐶 ∈ 𝑦 ↔ 𝐶 ∈ 𝐴))
12 fveq2 6916 . . . . . . . . . . . 12 (𝑦 = 𝐴 → (𝐵‘𝑦) = (𝐵‘𝐴))
1312eleq2d 2850 . . . . . . . . . . 11 (𝑦 = 𝐴 → ((𝐵‘𝐶) ∈ (𝐵‘𝑦) ↔ (𝐵‘𝐶) ∈ (𝐵‘𝐴)))
1411, 13imbi12d 347 . . . . . . . . . 10 (𝑦 = 𝐴 → ((𝐶 ∈ 𝑦 → (𝐵‘𝐶) ∈ (𝐵‘𝑦)) ↔ (𝐶 ∈ 𝐴 → (𝐵‘𝐶) ∈ (𝐵‘𝐴))))
1510, 14rspc2v 3590 . . . . . . . . 9 ((𝐶 ∈ dom 𝐵 ∧ 𝐴 ∈ dom 𝐵) → (∀𝑥 ∈ dom 𝐵∀𝑦 ∈ dom 𝐵(𝑥 ∈ 𝑦 → (𝐵‘𝑥) ∈ (𝐵‘𝑦)) → (𝐶 ∈ 𝐴 → (𝐵‘𝐶) ∈ (𝐵‘𝐴))))
1615ancoms 464 . . . . . . . 8 ((𝐴 ∈ dom 𝐵 ∧ 𝐶 ∈ dom 𝐵) → (∀𝑥 ∈ dom 𝐵∀𝑦 ∈ dom 𝐵(𝑥 ∈ 𝑦 → (𝐵‘𝑥) ∈ (𝐵‘𝑦)) → (𝐶 ∈ 𝐴 → (𝐵‘𝐶) ∈ (𝐵‘𝐴))))
1716com12 33 . . . . . . 7 (∀𝑥 ∈ dom 𝐵∀𝑦 ∈ dom 𝐵(𝑥 ∈ 𝑦 → (𝐵‘𝑥) ∈ (𝐵‘𝑦)) → ((𝐴 ∈ dom 𝐵 ∧ 𝐶 ∈ dom 𝐵) → (𝐶 ∈ 𝐴 → (𝐵‘𝐶) ∈ (𝐵‘𝐴))))
18173ad2ant3 1153 . . . . . 6 ((𝐵:dom 𝐵⟶On ∧ Ord dom 𝐵 ∧ ∀𝑥 ∈ dom 𝐵∀𝑦 ∈ dom 𝐵(𝑥 ∈ 𝑦 → (𝐵‘𝑥) ∈ (𝐵‘𝑦))) → ((𝐴 ∈ dom 𝐵 ∧ 𝐶 ∈ dom 𝐵) → (𝐶 ∈ 𝐴 → (𝐵‘𝐶) ∈ (𝐵‘𝐴))))
196, 18sylbi 220 . . . . 5 (Smo 𝐵 → ((𝐴 ∈ dom 𝐵 ∧ 𝐶 ∈ dom 𝐵) → (𝐶 ∈ 𝐴 → (𝐵‘𝐶) ∈ (𝐵‘𝐴))))
2019expdimp 458 . . . 4 ((Smo 𝐵 ∧ 𝐴 ∈ dom 𝐵) → (𝐶 ∈ dom 𝐵 → (𝐶 ∈ 𝐴 → (𝐵‘𝐶) ∈ (𝐵‘𝐴))))
215, 20syld 48 . . 3 ((Smo 𝐵 ∧ 𝐴 ∈ dom 𝐵) → (𝐶 ∈ 𝐴 → (𝐶 ∈ 𝐴 → (𝐵‘𝐶) ∈ (𝐵‘𝐴))))
2221pm2.43d 54 . 2 ((Smo 𝐵 ∧ 𝐴 ∈ dom 𝐵) → (𝐶 ∈ 𝐴 → (𝐵‘𝐶) ∈ (𝐵‘𝐴)))
23223impia 1135 1 ((Smo 𝐵 ∧ 𝐴 ∈ dom 𝐵 ∧ 𝐶 ∈ 𝐴) → (𝐵‘𝐶) ∈ (𝐵‘𝐴))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147  ∀wral 3080  dom cdm 5658  Ord word 6387  Oncon0 6388  ⟶wf 6562  ‘cfv 6566  Smo wsmo 8391
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ral 3081  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-tr 5219  df-ord 6391  df-iota 6520  df-fv 6574  df-smo 8392
This theorem is used by:  smoiun  8407  smoel2  8409
  Copyright terms: Public domain W3C validator