ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  smores GIF version

Theorem smores 6563
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 5418 . . . . . . . 8 (Fun 𝐴 → Fun (𝐴𝐵))
2 funfn 5407 . . . . . . . 8 (Fun 𝐴𝐴 Fn dom 𝐴)
3 funfn 5407 . . . . . . . 8 (Fun (𝐴𝐵) ↔ (𝐴𝐵) Fn dom (𝐴𝐵))
41, 2, 33imtr3i 200 . . . . . . 7 (𝐴 Fn dom 𝐴 → (𝐴𝐵) Fn dom (𝐴𝐵))
5 resss 5087 . . . . . . . . 9 (𝐴𝐵) ⊆ 𝐴
6 rnss 5012 . . . . . . . . 9 ((𝐴𝐵) ⊆ 𝐴 → ran (𝐴𝐵) ⊆ ran 𝐴)
75, 6ax-mp 5 . . . . . . . 8 ran (𝐴𝐵) ⊆ ran 𝐴
8 sstr 3256 . . . . . . . 8 ((ran (𝐴𝐵) ⊆ ran 𝐴 ∧ ran 𝐴 ⊆ On) → ran (𝐴𝐵) ⊆ On)
97, 8mpan 428 . . . . . . 7 (ran 𝐴 ⊆ On → ran (𝐴𝐵) ⊆ On)
104, 9anim12i 338 . . . . . 6 ((𝐴 Fn dom 𝐴 ∧ ran 𝐴 ⊆ On) → ((𝐴𝐵) Fn dom (𝐴𝐵) ∧ ran (𝐴𝐵) ⊆ On))
11 df-f 5381 . . . . . 6 (𝐴:dom 𝐴⟶On ↔ (𝐴 Fn dom 𝐴 ∧ ran 𝐴 ⊆ On))
12 df-f 5381 . . . . . 6 ((𝐴𝐵):dom (𝐴𝐵)⟶On ↔ ((𝐴𝐵) Fn dom (𝐴𝐵) ∧ ran (𝐴𝐵) ⊆ On))
1310, 11, 123imtr4i 201 . . . . 5 (𝐴:dom 𝐴⟶On → (𝐴𝐵):dom (𝐴𝐵)⟶On)
1413a1i 9 . . . 4 (𝐵 ∈ dom 𝐴 → (𝐴:dom 𝐴⟶On → (𝐴𝐵):dom (𝐴𝐵)⟶On))
15 ordelord 4526 . . . . . . 7 ((Ord dom 𝐴𝐵 ∈ dom 𝐴) → Ord 𝐵)
1615expcom 116 . . . . . 6 (𝐵 ∈ dom 𝐴 → (Ord dom 𝐴 → Ord 𝐵))
17 ordin 4530 . . . . . . 7 ((Ord 𝐵 ∧ Ord dom 𝐴) → Ord (𝐵 ∩ dom 𝐴))
1817ex 115 . . . . . 6 (Ord 𝐵 → (Ord dom 𝐴 → Ord (𝐵 ∩ dom 𝐴)))
1916, 18syli 37 . . . . 5 (𝐵 ∈ dom 𝐴 → (Ord dom 𝐴 → Ord (𝐵 ∩ dom 𝐴)))
20 dmres 5084 . . . . . 6 dom (𝐴𝐵) = (𝐵 ∩ dom 𝐴)
21 ordeq 4517 . . . . . 6 (dom (𝐴𝐵) = (𝐵 ∩ dom 𝐴) → (Ord dom (𝐴𝐵) ↔ Ord (𝐵 ∩ dom 𝐴)))
2220, 21ax-mp 5 . . . . 5 (Ord dom (𝐴𝐵) ↔ Ord (𝐵 ∩ dom 𝐴))
2319, 22imbitrrdi 162 . . . 4 (𝐵 ∈ dom 𝐴 → (Ord dom 𝐴 → Ord dom (𝐴𝐵)))
24 dmss 4980 . . . . . . . . 9 ((𝐴𝐵) ⊆ 𝐴 → dom (𝐴𝐵) ⊆ dom 𝐴)
255, 24ax-mp 5 . . . . . . . 8 dom (𝐴𝐵) ⊆ dom 𝐴
26 ssralv 3312 . . . . . . . 8 (dom (𝐴𝐵) ⊆ dom 𝐴 → (∀𝑥 ∈ dom 𝐴𝑦 ∈ dom 𝐴(𝑥𝑦 → (𝐴𝑥) ∈ (𝐴𝑦)) → ∀𝑥 ∈ dom (𝐴𝐵)∀𝑦 ∈ dom 𝐴(𝑥𝑦 → (𝐴𝑥) ∈ (𝐴𝑦))))
2725, 26ax-mp 5 . . . . . . 7 (∀𝑥 ∈ dom 𝐴𝑦 ∈ dom 𝐴(𝑥𝑦 → (𝐴𝑥) ∈ (𝐴𝑦)) → ∀𝑥 ∈ dom (𝐴𝐵)∀𝑦 ∈ dom 𝐴(𝑥𝑦 → (𝐴𝑥) ∈ (𝐴𝑦)))
28 ssralv 3312 . . . . . . . . 9 (dom (𝐴𝐵) ⊆ dom 𝐴 → (∀𝑦 ∈ dom 𝐴(𝑥𝑦 → (𝐴𝑥) ∈ (𝐴𝑦)) → ∀𝑦 ∈ dom (𝐴𝐵)(𝑥𝑦 → (𝐴𝑥) ∈ (𝐴𝑦))))
2925, 28ax-mp 5 . . . . . . . 8 (∀𝑦 ∈ dom 𝐴(𝑥𝑦 → (𝐴𝑥) ∈ (𝐴𝑦)) → ∀𝑦 ∈ dom (𝐴𝐵)(𝑥𝑦 → (𝐴𝑥) ∈ (𝐴𝑦)))
3029ralimi 2613 . . . . . . 7 (∀𝑥 ∈ dom (𝐴𝐵)∀𝑦 ∈ dom 𝐴(𝑥𝑦 → (𝐴𝑥) ∈ (𝐴𝑦)) → ∀𝑥 ∈ dom (𝐴𝐵)∀𝑦 ∈ dom (𝐴𝐵)(𝑥𝑦 → (𝐴𝑥) ∈ (𝐴𝑦)))
3127, 30syl 14 . . . . . 6 (∀𝑥 ∈ dom 𝐴𝑦 ∈ dom 𝐴(𝑥𝑦 → (𝐴𝑥) ∈ (𝐴𝑦)) → ∀𝑥 ∈ dom (𝐴𝐵)∀𝑦 ∈ dom (𝐴𝐵)(𝑥𝑦 → (𝐴𝑥) ∈ (𝐴𝑦)))
32 inss1 3451 . . . . . . . . . . . . 13 (𝐵 ∩ dom 𝐴) ⊆ 𝐵
3320, 32eqsstri 3280 . . . . . . . . . . . 12 dom (𝐴𝐵) ⊆ 𝐵
34 simpl 109 . . . . . . . . . . . 12 ((𝑥 ∈ dom (𝐴𝐵) ∧ 𝑦 ∈ dom (𝐴𝐵)) → 𝑥 ∈ dom (𝐴𝐵))
3533, 34sselid 3246 . . . . . . . . . . 11 ((𝑥 ∈ dom (𝐴𝐵) ∧ 𝑦 ∈ dom (𝐴𝐵)) → 𝑥𝐵)
36 fvres 5719 . . . . . . . . . . 11 (𝑥𝐵 → ((𝐴𝐵)‘𝑥) = (𝐴𝑥))
3735, 36syl 14 . . . . . . . . . 10 ((𝑥 ∈ dom (𝐴𝐵) ∧ 𝑦 ∈ dom (𝐴𝐵)) → ((𝐴𝐵)‘𝑥) = (𝐴𝑥))
38 simpr 110 . . . . . . . . . . . 12 ((𝑥 ∈ dom (𝐴𝐵) ∧ 𝑦 ∈ dom (𝐴𝐵)) → 𝑦 ∈ dom (𝐴𝐵))
3933, 38sselid 3246 . . . . . . . . . . 11 ((𝑥 ∈ dom (𝐴𝐵) ∧ 𝑦 ∈ dom (𝐴𝐵)) → 𝑦𝐵)
40 fvres 5719 . . . . . . . . . . 11 (𝑦𝐵 → ((𝐴𝐵)‘𝑦) = (𝐴𝑦))
4139, 40syl 14 . . . . . . . . . 10 ((𝑥 ∈ dom (𝐴𝐵) ∧ 𝑦 ∈ dom (𝐴𝐵)) → ((𝐴𝐵)‘𝑦) = (𝐴𝑦))
4237, 41eleq12d 2309 . . . . . . . . 9 ((𝑥 ∈ dom (𝐴𝐵) ∧ 𝑦 ∈ dom (𝐴𝐵)) → (((𝐴𝐵)‘𝑥) ∈ ((𝐴𝐵)‘𝑦) ↔ (𝐴𝑥) ∈ (𝐴𝑦)))
4342imbi2d 230 . . . . . . . 8 ((𝑥 ∈ dom (𝐴𝐵) ∧ 𝑦 ∈ dom (𝐴𝐵)) → ((𝑥𝑦 → ((𝐴𝐵)‘𝑥) ∈ ((𝐴𝐵)‘𝑦)) ↔ (𝑥𝑦 → (𝐴𝑥) ∈ (𝐴𝑦))))
4443ralbidva 2546 . . . . . . 7 (𝑥 ∈ dom (𝐴𝐵) → (∀𝑦 ∈ dom (𝐴𝐵)(𝑥𝑦 → ((𝐴𝐵)‘𝑥) ∈ ((𝐴𝐵)‘𝑦)) ↔ ∀𝑦 ∈ dom (𝐴𝐵)(𝑥𝑦 → (𝐴𝑥) ∈ (𝐴𝑦))))
4544ralbiia 2564 . . . . . 6 (∀𝑥 ∈ dom (𝐴𝐵)∀𝑦 ∈ dom (𝐴𝐵)(𝑥𝑦 → ((𝐴𝐵)‘𝑥) ∈ ((𝐴𝐵)‘𝑦)) ↔ ∀𝑥 ∈ dom (𝐴𝐵)∀𝑦 ∈ dom (𝐴𝐵)(𝑥𝑦 → (𝐴𝑥) ∈ (𝐴𝑦)))
4631, 45sylibr 134 . . . . 5 (∀𝑥 ∈ dom 𝐴𝑦 ∈ dom 𝐴(𝑥𝑦 → (𝐴𝑥) ∈ (𝐴𝑦)) → ∀𝑥 ∈ dom (𝐴𝐵)∀𝑦 ∈ dom (𝐴𝐵)(𝑥𝑦 → ((𝐴𝐵)‘𝑥) ∈ ((𝐴𝐵)‘𝑦)))
4746a1i 9 . . . 4 (𝐵 ∈ dom 𝐴 → (∀𝑥 ∈ dom 𝐴𝑦 ∈ dom 𝐴(𝑥𝑦 → (𝐴𝑥) ∈ (𝐴𝑦)) → ∀𝑥 ∈ dom (𝐴𝐵)∀𝑦 ∈ dom (𝐴𝐵)(𝑥𝑦 → ((𝐴𝐵)‘𝑥) ∈ ((𝐴𝐵)‘𝑦))))
4814, 23, 473anim123d 1360 . . 3 (𝐵 ∈ dom 𝐴 → ((𝐴:dom 𝐴⟶On ∧ Ord dom 𝐴 ∧ ∀𝑥 ∈ dom 𝐴𝑦 ∈ dom 𝐴(𝑥𝑦 → (𝐴𝑥) ∈ (𝐴𝑦))) → ((𝐴𝐵):dom (𝐴𝐵)⟶On ∧ Ord dom (𝐴𝐵) ∧ ∀𝑥 ∈ dom (𝐴𝐵)∀𝑦 ∈ dom (𝐴𝐵)(𝑥𝑦 → ((𝐴𝐵)‘𝑥) ∈ ((𝐴𝐵)‘𝑦)))))
49 df-smo 6557 . . 3 (Smo 𝐴 ↔ (𝐴:dom 𝐴⟶On ∧ Ord dom 𝐴 ∧ ∀𝑥 ∈ dom 𝐴𝑦 ∈ dom 𝐴(𝑥𝑦 → (𝐴𝑥) ∈ (𝐴𝑦))))
50 df-smo 6557 . . 3 (Smo (𝐴𝐵) ↔ ((𝐴𝐵):dom (𝐴𝐵)⟶On ∧ Ord dom (𝐴𝐵) ∧ ∀𝑥 ∈ dom (𝐴𝐵)∀𝑦 ∈ dom (𝐴𝐵)(𝑥𝑦 → ((𝐴𝐵)‘𝑥) ∈ ((𝐴𝐵)‘𝑦))))
5148, 49, 503imtr4g 205 . 2 (𝐵 ∈ dom 𝐴 → (Smo 𝐴 → Smo (𝐴𝐵)))
5251impcom 125 1 ((Smo 𝐴𝐵 ∈ dom 𝐴) → Smo (𝐴𝐵))
Colors of variables:    wff set class
This proof depends on syntax axioms:  wi 4  wa 104  wb 105  w3a 1009   = wceq 1402  wcel 2209  wral 2528  cin 3219  wss 3220  Ord word 4507  Oncon0 4508  dom cdm 4774  ran crn 4775  cres 4776  Fun wfun 5371   Fn wfn 5372  wf 5373  cfv 5377  Smo wsmo 6556
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4131  df-opab 4193  df-tr 4230  df-iord 4511  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-fv 5385  df-smo 6557
This theorem is used by:  smores3  6564
  Copyright terms: Public domain W3C validator