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

Theorem smores 7336
Description: A strictly monotone function restricted to an ordinal remains strictly monotone. (Contributed by Andrew Salmon, 16-Nov-2011.) (Proof shortened by Mario Carneiro, 5-Dec-2016.)
Assertion
Ref Expression
smores ((Smo 𝐴𝐵 ∈ dom 𝐴) → Smo (𝐴𝐵))

Proof of Theorem smores
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 funres 5843 . . . . . . . 8 (Fun 𝐴 → Fun (𝐴𝐵))
2 funfn 5833 . . . . . . . 8 (Fun 𝐴𝐴 Fn dom 𝐴)
3 funfn 5833 . . . . . . . 8 (Fun (𝐴𝐵) ↔ (𝐴𝐵) Fn dom (𝐴𝐵))
41, 2, 33imtr3i 279 . . . . . . 7 (𝐴 Fn dom 𝐴 → (𝐴𝐵) Fn dom (𝐴𝐵))
5 resss 5342 . . . . . . . . 9 (𝐴𝐵) ⊆ 𝐴
6 rnss 5275 . . . . . . . . 9 ((𝐴𝐵) ⊆ 𝐴 → ran (𝐴𝐵) ⊆ ran 𝐴)
75, 6ax-mp 5 . . . . . . . 8 ran (𝐴𝐵) ⊆ ran 𝐴
8 sstr 3576 . . . . . . . 8 ((ran (𝐴𝐵) ⊆ ran 𝐴 ∧ ran 𝐴 ⊆ On) → ran (𝐴𝐵) ⊆ On)
97, 8mpan 702 . . . . . . 7 (ran 𝐴 ⊆ On → ran (𝐴𝐵) ⊆ On)
104, 9anim12i 588 . . . . . 6 ((𝐴 Fn dom 𝐴 ∧ ran 𝐴 ⊆ On) → ((𝐴𝐵) Fn dom (𝐴𝐵) ∧ ran (𝐴𝐵) ⊆ On))
11 df-f 5808 . . . . . 6 (𝐴:dom 𝐴⟶On ↔ (𝐴 Fn dom 𝐴 ∧ ran 𝐴 ⊆ On))
12 df-f 5808 . . . . . 6 ((𝐴𝐵):dom (𝐴𝐵)⟶On ↔ ((𝐴𝐵) Fn dom (𝐴𝐵) ∧ ran (𝐴𝐵) ⊆ On))
1310, 11, 123imtr4i 280 . . . . 5 (𝐴:dom 𝐴⟶On → (𝐴𝐵):dom (𝐴𝐵)⟶On)
1413a1i 11 . . . 4 (𝐵 ∈ dom 𝐴 → (𝐴:dom 𝐴⟶On → (𝐴𝐵):dom (𝐴𝐵)⟶On))
15 ordelord 5662 . . . . . . 7 ((Ord dom 𝐴𝐵 ∈ dom 𝐴) → Ord 𝐵)
1615expcom 450 . . . . . 6 (𝐵 ∈ dom 𝐴 → (Ord dom 𝐴 → Ord 𝐵))
17 ordin 5670 . . . . . . 7 ((Ord 𝐵 ∧ Ord dom 𝐴) → Ord (𝐵 ∩ dom 𝐴))
1817ex 449 . . . . . 6 (Ord 𝐵 → (Ord dom 𝐴 → Ord (𝐵 ∩ dom 𝐴)))
1916, 18syli 38 . . . . 5 (𝐵 ∈ dom 𝐴 → (Ord dom 𝐴 → Ord (𝐵 ∩ dom 𝐴)))
20 dmres 5339 . . . . . 6 dom (𝐴𝐵) = (𝐵 ∩ dom 𝐴)
21 ordeq 5647 . . . . . 6 (dom (𝐴𝐵) = (𝐵 ∩ dom 𝐴) → (Ord dom (𝐴𝐵) ↔ Ord (𝐵 ∩ dom 𝐴)))
2220, 21ax-mp 5 . . . . 5 (Ord dom (𝐴𝐵) ↔ Ord (𝐵 ∩ dom 𝐴))
2319, 22syl6ibr 241 . . . 4 (𝐵 ∈ dom 𝐴 → (Ord dom 𝐴 → Ord dom (𝐴𝐵)))
24 dmss 5245 . . . . . . . . 9 ((𝐴𝐵) ⊆ 𝐴 → dom (𝐴𝐵) ⊆ dom 𝐴)
255, 24ax-mp 5 . . . . . . . 8 dom (𝐴𝐵) ⊆ dom 𝐴
26 ssralv 3629 . . . . . . . 8 (dom (𝐴𝐵) ⊆ dom 𝐴 → (∀𝑥 ∈ dom 𝐴𝑦 ∈ dom 𝐴(𝑥𝑦 → (𝐴𝑥) ∈ (𝐴𝑦)) → ∀𝑥 ∈ dom (𝐴𝐵)∀𝑦 ∈ dom 𝐴(𝑥𝑦 → (𝐴𝑥) ∈ (𝐴𝑦))))
2725, 26ax-mp 5 . . . . . . 7 (∀𝑥 ∈ dom 𝐴𝑦 ∈ dom 𝐴(𝑥𝑦 → (𝐴𝑥) ∈ (𝐴𝑦)) → ∀𝑥 ∈ dom (𝐴𝐵)∀𝑦 ∈ dom 𝐴(𝑥𝑦 → (𝐴𝑥) ∈ (𝐴𝑦)))
28 ssralv 3629 . . . . . . . . 9 (dom (𝐴𝐵) ⊆ dom 𝐴 → (∀𝑦 ∈ dom 𝐴(𝑥𝑦 → (𝐴𝑥) ∈ (𝐴𝑦)) → ∀𝑦 ∈ dom (𝐴𝐵)(𝑥𝑦 → (𝐴𝑥) ∈ (𝐴𝑦))))
2925, 28ax-mp 5 . . . . . . . 8 (∀𝑦 ∈ dom 𝐴(𝑥𝑦 → (𝐴𝑥) ∈ (𝐴𝑦)) → ∀𝑦 ∈ dom (𝐴𝐵)(𝑥𝑦 → (𝐴𝑥) ∈ (𝐴𝑦)))
3029ralimi 2936 . . . . . . 7 (∀𝑥 ∈ dom (𝐴𝐵)∀𝑦 ∈ dom 𝐴(𝑥𝑦 → (𝐴𝑥) ∈ (𝐴𝑦)) → ∀𝑥 ∈ dom (𝐴𝐵)∀𝑦 ∈ dom (𝐴𝐵)(𝑥𝑦 → (𝐴𝑥) ∈ (𝐴𝑦)))
3127, 30syl 17 . . . . . 6 (∀𝑥 ∈ dom 𝐴𝑦 ∈ dom 𝐴(𝑥𝑦 → (𝐴𝑥) ∈ (𝐴𝑦)) → ∀𝑥 ∈ dom (𝐴𝐵)∀𝑦 ∈ dom (𝐴𝐵)(𝑥𝑦 → (𝐴𝑥) ∈ (𝐴𝑦)))
32 inss1 3795 . . . . . . . . . . . . 13 (𝐵 ∩ dom 𝐴) ⊆ 𝐵
3320, 32eqsstri 3598 . . . . . . . . . . . 12 dom (𝐴𝐵) ⊆ 𝐵
34 simpl 472 . . . . . . . . . . . 12 ((𝑥 ∈ dom (𝐴𝐵) ∧ 𝑦 ∈ dom (𝐴𝐵)) → 𝑥 ∈ dom (𝐴𝐵))
3533, 34sseldi 3566 . . . . . . . . . . 11 ((𝑥 ∈ dom (𝐴𝐵) ∧ 𝑦 ∈ dom (𝐴𝐵)) → 𝑥𝐵)
36 fvres 6117 . . . . . . . . . . 11 (𝑥𝐵 → ((𝐴𝐵)‘𝑥) = (𝐴𝑥))
3735, 36syl 17 . . . . . . . . . 10 ((𝑥 ∈ dom (𝐴𝐵) ∧ 𝑦 ∈ dom (𝐴𝐵)) → ((𝐴𝐵)‘𝑥) = (𝐴𝑥))
38 simpr 476 . . . . . . . . . . . 12 ((𝑥 ∈ dom (𝐴𝐵) ∧ 𝑦 ∈ dom (𝐴𝐵)) → 𝑦 ∈ dom (𝐴𝐵))
3933, 38sseldi 3566 . . . . . . . . . . 11 ((𝑥 ∈ dom (𝐴𝐵) ∧ 𝑦 ∈ dom (𝐴𝐵)) → 𝑦𝐵)
40 fvres 6117 . . . . . . . . . . 11 (𝑦𝐵 → ((𝐴𝐵)‘𝑦) = (𝐴𝑦))
4139, 40syl 17 . . . . . . . . . 10 ((𝑥 ∈ dom (𝐴𝐵) ∧ 𝑦 ∈ dom (𝐴𝐵)) → ((𝐴𝐵)‘𝑦) = (𝐴𝑦))
4237, 41eleq12d 2682 . . . . . . . . 9 ((𝑥 ∈ dom (𝐴𝐵) ∧ 𝑦 ∈ dom (𝐴𝐵)) → (((𝐴𝐵)‘𝑥) ∈ ((𝐴𝐵)‘𝑦) ↔ (𝐴𝑥) ∈ (𝐴𝑦)))
4342imbi2d 329 . . . . . . . 8 ((𝑥 ∈ dom (𝐴𝐵) ∧ 𝑦 ∈ dom (𝐴𝐵)) → ((𝑥𝑦 → ((𝐴𝐵)‘𝑥) ∈ ((𝐴𝐵)‘𝑦)) ↔ (𝑥𝑦 → (𝐴𝑥) ∈ (𝐴𝑦))))
4443ralbidva 2968 . . . . . . 7 (𝑥 ∈ dom (𝐴𝐵) → (∀𝑦 ∈ dom (𝐴𝐵)(𝑥𝑦 → ((𝐴𝐵)‘𝑥) ∈ ((𝐴𝐵)‘𝑦)) ↔ ∀𝑦 ∈ dom (𝐴𝐵)(𝑥𝑦 → (𝐴𝑥) ∈ (𝐴𝑦))))
4544ralbiia 2962 . . . . . 6 (∀𝑥 ∈ dom (𝐴𝐵)∀𝑦 ∈ dom (𝐴𝐵)(𝑥𝑦 → ((𝐴𝐵)‘𝑥) ∈ ((𝐴𝐵)‘𝑦)) ↔ ∀𝑥 ∈ dom (𝐴𝐵)∀𝑦 ∈ dom (𝐴𝐵)(𝑥𝑦 → (𝐴𝑥) ∈ (𝐴𝑦)))
4631, 45sylibr 223 . . . . 5 (∀𝑥 ∈ dom 𝐴𝑦 ∈ dom 𝐴(𝑥𝑦 → (𝐴𝑥) ∈ (𝐴𝑦)) → ∀𝑥 ∈ dom (𝐴𝐵)∀𝑦 ∈ dom (𝐴𝐵)(𝑥𝑦 → ((𝐴𝐵)‘𝑥) ∈ ((𝐴𝐵)‘𝑦)))
4746a1i 11 . . . 4 (𝐵 ∈ dom 𝐴 → (∀𝑥 ∈ dom 𝐴𝑦 ∈ dom 𝐴(𝑥𝑦 → (𝐴𝑥) ∈ (𝐴𝑦)) → ∀𝑥 ∈ dom (𝐴𝐵)∀𝑦 ∈ dom (𝐴𝐵)(𝑥𝑦 → ((𝐴𝐵)‘𝑥) ∈ ((𝐴𝐵)‘𝑦))))
4814, 23, 473anim123d 1398 . . 3 (𝐵 ∈ dom 𝐴 → ((𝐴:dom 𝐴⟶On ∧ Ord dom 𝐴 ∧ ∀𝑥 ∈ dom 𝐴𝑦 ∈ dom 𝐴(𝑥𝑦 → (𝐴𝑥) ∈ (𝐴𝑦))) → ((𝐴𝐵):dom (𝐴𝐵)⟶On ∧ Ord dom (𝐴𝐵) ∧ ∀𝑥 ∈ dom (𝐴𝐵)∀𝑦 ∈ dom (𝐴𝐵)(𝑥𝑦 → ((𝐴𝐵)‘𝑥) ∈ ((𝐴𝐵)‘𝑦)))))
49 df-smo 7330 . . 3 (Smo 𝐴 ↔ (𝐴:dom 𝐴⟶On ∧ Ord dom 𝐴 ∧ ∀𝑥 ∈ dom 𝐴𝑦 ∈ dom 𝐴(𝑥𝑦 → (𝐴𝑥) ∈ (𝐴𝑦))))
50 df-smo 7330 . . 3 (Smo (𝐴𝐵) ↔ ((𝐴𝐵):dom (𝐴𝐵)⟶On ∧ Ord dom (𝐴𝐵) ∧ ∀𝑥 ∈ dom (𝐴𝐵)∀𝑦 ∈ dom (𝐴𝐵)(𝑥𝑦 → ((𝐴𝐵)‘𝑥) ∈ ((𝐴𝐵)‘𝑦))))
5148, 49, 503imtr4g 284 . 2 (𝐵 ∈ dom 𝐴 → (Smo 𝐴 → Smo (𝐴𝐵)))
5251impcom 445 1 ((Smo 𝐴𝐵 ∈ dom 𝐴) → Smo (𝐴𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 195  wa 383  w3a 1031   = wceq 1475  wcel 1977  wral 2896  cin 3539  wss 3540  dom cdm 5038  ran crn 5039  cres 5040  Ord word 5639  Oncon0 5640  Fun wfun 5798   Fn wfn 5799  wf 5800  cfv 5804  Smo wsmo 7329
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-sep 4709  ax-nul 4717  ax-pr 4833
This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-ral 2901  df-rex 2902  df-rab 2905  df-v 3175  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-br 4584  df-opab 4644  df-tr 4681  df-eprel 4949  df-po 4959  df-so 4960  df-fr 4997  df-we 4999  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ord 5643  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-fv 5812  df-smo 7330
This theorem is referenced by:  smores3  7337  alephsing  8981
  Copyright terms: Public domain W3C validator