Theorem smoel 8400

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.

Step	Hyp	Ref	Expression
1		smodm 8391	. . . . 5 ⊢ (Smo 𝐵 → Ord dom 𝐵)
2		ordtr1 6427	. . . . . . 7 ⊢ (Ord dom 𝐵 → ((𝐶 ∈ 𝐴 ∧ 𝐴 ∈ dom 𝐵) → 𝐶 ∈ dom 𝐵))
3	2	ancomsd 465	. . . . . 6 ⊢ (Ord dom 𝐵 → ((𝐴 ∈ dom 𝐵 ∧ 𝐶 ∈ 𝐴) → 𝐶 ∈ dom 𝐵))
4	3	expdimp 452	. . . . 5 ⊢ ((Ord dom 𝐵 ∧ 𝐴 ∈ dom 𝐵) → (𝐶 ∈ 𝐴 → 𝐶 ∈ dom 𝐵))
5	1, 4	sylan 580	. . . 4 ⊢ ((Smo 𝐵 ∧ 𝐴 ∈ dom 𝐵) → (𝐶 ∈ 𝐴 → 𝐶 ∈ dom 𝐵))
6		df-smo 8386	. . . . . 6 ⊢ (Smo 𝐵 ↔ (𝐵:dom 𝐵⟶On ∧ Ord dom 𝐵 ∧ ∀𝑥 ∈ dom 𝐵∀𝑦 ∈ dom 𝐵(𝑥 ∈ 𝑦 → (𝐵‘𝑥) ∈ (𝐵‘𝑦))))
7		eleq1 2829	. . . . . . . . . . 11 ⊢ (𝑥 = 𝐶 → (𝑥 ∈ 𝑦 ↔ 𝐶 ∈ 𝑦))
8		fveq2 6906	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝐶 → (𝐵‘𝑥) = (𝐵‘𝐶))
9	8	eleq1d 2826	. . . . . . . . . . 11 ⊢ (𝑥 = 𝐶 → ((𝐵‘𝑥) ∈ (𝐵‘𝑦) ↔ (𝐵‘𝐶) ∈ (𝐵‘𝑦)))
10	7, 9	imbi12d 344	. . . . . . . . . 10 ⊢ (𝑥 = 𝐶 → ((𝑥 ∈ 𝑦 → (𝐵‘𝑥) ∈ (𝐵‘𝑦)) ↔ (𝐶 ∈ 𝑦 → (𝐵‘𝐶) ∈ (𝐵‘𝑦))))
11		eleq2 2830	. . . . . . . . . . 11 ⊢ (𝑦 = 𝐴 → (𝐶 ∈ 𝑦 ↔ 𝐶 ∈ 𝐴))
12		fveq2 6906	. . . . . . . . . . . 12 ⊢ (𝑦 = 𝐴 → (𝐵‘𝑦) = (𝐵‘𝐴))
13	12	eleq2d 2827	. . . . . . . . . . 11 ⊢ (𝑦 = 𝐴 → ((𝐵‘𝐶) ∈ (𝐵‘𝑦) ↔ (𝐵‘𝐶) ∈ (𝐵‘𝐴)))
14	11, 13	imbi12d 344	. . . . . . . . . 10 ⊢ (𝑦 = 𝐴 → ((𝐶 ∈ 𝑦 → (𝐵‘𝐶) ∈ (𝐵‘𝑦)) ↔ (𝐶 ∈ 𝐴 → (𝐵‘𝐶) ∈ (𝐵‘𝐴))))
15	10, 14	rspc2v 3633	. . . . . . . . 9 ⊢ ((𝐶 ∈ dom 𝐵 ∧ 𝐴 ∈ dom 𝐵) → (∀𝑥 ∈ dom 𝐵∀𝑦 ∈ dom 𝐵(𝑥 ∈ 𝑦 → (𝐵‘𝑥) ∈ (𝐵‘𝑦)) → (𝐶 ∈ 𝐴 → (𝐵‘𝐶) ∈ (𝐵‘𝐴))))
16	15	ancoms 458	. . . . . . . 8 ⊢ ((𝐴 ∈ dom 𝐵 ∧ 𝐶 ∈ dom 𝐵) → (∀𝑥 ∈ dom 𝐵∀𝑦 ∈ dom 𝐵(𝑥 ∈ 𝑦 → (𝐵‘𝑥) ∈ (𝐵‘𝑦)) → (𝐶 ∈ 𝐴 → (𝐵‘𝐶) ∈ (𝐵‘𝐴))))
17	16	com12 32	. . . . . . 7 ⊢ (∀𝑥 ∈ dom 𝐵∀𝑦 ∈ dom 𝐵(𝑥 ∈ 𝑦 → (𝐵‘𝑥) ∈ (𝐵‘𝑦)) → ((𝐴 ∈ dom 𝐵 ∧ 𝐶 ∈ dom 𝐵) → (𝐶 ∈ 𝐴 → (𝐵‘𝐶) ∈ (𝐵‘𝐴))))
18	17	3ad2ant3 1136	. . . . . 6 ⊢ ((𝐵:dom 𝐵⟶On ∧ Ord dom 𝐵 ∧ ∀𝑥 ∈ dom 𝐵∀𝑦 ∈ dom 𝐵(𝑥 ∈ 𝑦 → (𝐵‘𝑥) ∈ (𝐵‘𝑦))) → ((𝐴 ∈ dom 𝐵 ∧ 𝐶 ∈ dom 𝐵) → (𝐶 ∈ 𝐴 → (𝐵‘𝐶) ∈ (𝐵‘𝐴))))
19	6, 18	sylbi 217	. . . . 5 ⊢ (Smo 𝐵 → ((𝐴 ∈ dom 𝐵 ∧ 𝐶 ∈ dom 𝐵) → (𝐶 ∈ 𝐴 → (𝐵‘𝐶) ∈ (𝐵‘𝐴))))
20	19	expdimp 452	. . . 4 ⊢ ((Smo 𝐵 ∧ 𝐴 ∈ dom 𝐵) → (𝐶 ∈ dom 𝐵 → (𝐶 ∈ 𝐴 → (𝐵‘𝐶) ∈ (𝐵‘𝐴))))
21	5, 20	syld 47	. . 3 ⊢ ((Smo 𝐵 ∧ 𝐴 ∈ dom 𝐵) → (𝐶 ∈ 𝐴 → (𝐶 ∈ 𝐴 → (𝐵‘𝐶) ∈ (𝐵‘𝐴))))
22	21	pm2.43d 53	. 2 ⊢ ((Smo 𝐵 ∧ 𝐴 ∈ dom 𝐵) → (𝐶 ∈ 𝐴 → (𝐵‘𝐶) ∈ (𝐵‘𝐴)))
23	22	3impia 1118	1 ⊢ ((Smo 𝐵 ∧ 𝐴 ∈ dom 𝐵 ∧ 𝐶 ∈ 𝐴) → (𝐵‘𝐶) ∈ (𝐵‘𝐴))

Syntax hints:   → wi 4   ∧ wa 395   ∧ w3a 1087   = wceq 1540   ∈ wcel 2108  ∀wral 3061  dom cdm 5685  Ord word 6383  Oncon0 6384  ⟶wf 6557  ‘cfv 6561  Smo wsmo 8385

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-ext 2708

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1543  df-fal 1553  df-ex 1780  df-sb 2065  df-clab 2715  df-cleq 2729  df-clel 2816  df-ral 3062  df-rab 3437  df-v 3482  df-dif 3954  df-un 3956  df-ss 3968  df-nul 4334  df-if 4526  df-sn 4627  df-pr 4629  df-op 4633  df-uni 4908  df-br 5144  df-tr 5260  df-ord 6387  df-iota 6514  df-fv 6569  df-smo 8386

This theorem is referenced by:  smoiun  8401  smoel2  8403