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

Theorem smores2 8274
Description: A strictly monotone ordinal function restricted to an ordinal is still monotone. (Contributed by Mario Carneiro, 15-Mar-2013.)
Assertion
Ref Expression
smores2 ((Smo 𝐹 ∧ Ord 𝐴) → Smo (𝐹𝐴))

Proof of Theorem smores2
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 dfsmo2 8267 . . . . . . 7 (Smo 𝐹 ↔ (𝐹:dom 𝐹⟶On ∧ Ord dom 𝐹 ∧ ∀𝑥 ∈ dom 𝐹𝑦𝑥 (𝐹𝑦) ∈ (𝐹𝑥)))
21simp1bi 1145 . . . . . 6 (Smo 𝐹𝐹:dom 𝐹⟶On)
32ffund 6655 . . . . 5 (Smo 𝐹 → Fun 𝐹)
4 funres 6523 . . . . . 6 (Fun 𝐹 → Fun (𝐹𝐴))
54funfnd 6512 . . . . 5 (Fun 𝐹 → (𝐹𝐴) Fn dom (𝐹𝐴))
63, 5syl 17 . . . 4 (Smo 𝐹 → (𝐹𝐴) Fn dom (𝐹𝐴))
7 df-ima 5627 . . . . . 6 (𝐹𝐴) = ran (𝐹𝐴)
8 imassrn 6019 . . . . . 6 (𝐹𝐴) ⊆ ran 𝐹
97, 8eqsstrri 3977 . . . . 5 ran (𝐹𝐴) ⊆ ran 𝐹
102frnd 6659 . . . . 5 (Smo 𝐹 → ran 𝐹 ⊆ On)
119, 10sstrid 3941 . . . 4 (Smo 𝐹 → ran (𝐹𝐴) ⊆ On)
12 df-f 6485 . . . 4 ((𝐹𝐴):dom (𝐹𝐴)⟶On ↔ ((𝐹𝐴) Fn dom (𝐹𝐴) ∧ ran (𝐹𝐴) ⊆ On))
136, 11, 12sylanbrc 583 . . 3 (Smo 𝐹 → (𝐹𝐴):dom (𝐹𝐴)⟶On)
1413adantr 480 . 2 ((Smo 𝐹 ∧ Ord 𝐴) → (𝐹𝐴):dom (𝐹𝐴)⟶On)
15 smodm 8271 . . 3 (Smo 𝐹 → Ord dom 𝐹)
16 ordin 6336 . . . . 5 ((Ord 𝐴 ∧ Ord dom 𝐹) → Ord (𝐴 ∩ dom 𝐹))
17 dmres 5960 . . . . . 6 dom (𝐹𝐴) = (𝐴 ∩ dom 𝐹)
18 ordeq 6313 . . . . . 6 (dom (𝐹𝐴) = (𝐴 ∩ dom 𝐹) → (Ord dom (𝐹𝐴) ↔ Ord (𝐴 ∩ dom 𝐹)))
1917, 18ax-mp 5 . . . . 5 (Ord dom (𝐹𝐴) ↔ Ord (𝐴 ∩ dom 𝐹))
2016, 19sylibr 234 . . . 4 ((Ord 𝐴 ∧ Ord dom 𝐹) → Ord dom (𝐹𝐴))
2120ancoms 458 . . 3 ((Ord dom 𝐹 ∧ Ord 𝐴) → Ord dom (𝐹𝐴))
2215, 21sylan 580 . 2 ((Smo 𝐹 ∧ Ord 𝐴) → Ord dom (𝐹𝐴))
23 resss 5949 . . . . . 6 (𝐹𝐴) ⊆ 𝐹
24 dmss 5841 . . . . . 6 ((𝐹𝐴) ⊆ 𝐹 → dom (𝐹𝐴) ⊆ dom 𝐹)
2523, 24ax-mp 5 . . . . 5 dom (𝐹𝐴) ⊆ dom 𝐹
261simp3bi 1147 . . . . 5 (Smo 𝐹 → ∀𝑥 ∈ dom 𝐹𝑦𝑥 (𝐹𝑦) ∈ (𝐹𝑥))
27 ssralv 3998 . . . . 5 (dom (𝐹𝐴) ⊆ dom 𝐹 → (∀𝑥 ∈ dom 𝐹𝑦𝑥 (𝐹𝑦) ∈ (𝐹𝑥) → ∀𝑥 ∈ dom (𝐹𝐴)∀𝑦𝑥 (𝐹𝑦) ∈ (𝐹𝑥)))
2825, 26, 27mpsyl 68 . . . 4 (Smo 𝐹 → ∀𝑥 ∈ dom (𝐹𝐴)∀𝑦𝑥 (𝐹𝑦) ∈ (𝐹𝑥))
2928adantr 480 . . 3 ((Smo 𝐹 ∧ Ord 𝐴) → ∀𝑥 ∈ dom (𝐹𝐴)∀𝑦𝑥 (𝐹𝑦) ∈ (𝐹𝑥))
30 ordtr1 6350 . . . . . . . . . . 11 (Ord dom (𝐹𝐴) → ((𝑦𝑥𝑥 ∈ dom (𝐹𝐴)) → 𝑦 ∈ dom (𝐹𝐴)))
3122, 30syl 17 . . . . . . . . . 10 ((Smo 𝐹 ∧ Ord 𝐴) → ((𝑦𝑥𝑥 ∈ dom (𝐹𝐴)) → 𝑦 ∈ dom (𝐹𝐴)))
32 inss1 4184 . . . . . . . . . . . 12 (𝐴 ∩ dom 𝐹) ⊆ 𝐴
3317, 32eqsstri 3976 . . . . . . . . . . 11 dom (𝐹𝐴) ⊆ 𝐴
3433sseli 3925 . . . . . . . . . 10 (𝑦 ∈ dom (𝐹𝐴) → 𝑦𝐴)
3531, 34syl6 35 . . . . . . . . 9 ((Smo 𝐹 ∧ Ord 𝐴) → ((𝑦𝑥𝑥 ∈ dom (𝐹𝐴)) → 𝑦𝐴))
3635expcomd 416 . . . . . . . 8 ((Smo 𝐹 ∧ Ord 𝐴) → (𝑥 ∈ dom (𝐹𝐴) → (𝑦𝑥𝑦𝐴)))
3736imp31 417 . . . . . . 7 ((((Smo 𝐹 ∧ Ord 𝐴) ∧ 𝑥 ∈ dom (𝐹𝐴)) ∧ 𝑦𝑥) → 𝑦𝐴)
3837fvresd 6842 . . . . . 6 ((((Smo 𝐹 ∧ Ord 𝐴) ∧ 𝑥 ∈ dom (𝐹𝐴)) ∧ 𝑦𝑥) → ((𝐹𝐴)‘𝑦) = (𝐹𝑦))
3933sseli 3925 . . . . . . . 8 (𝑥 ∈ dom (𝐹𝐴) → 𝑥𝐴)
4039fvresd 6842 . . . . . . 7 (𝑥 ∈ dom (𝐹𝐴) → ((𝐹𝐴)‘𝑥) = (𝐹𝑥))
4140ad2antlr 727 . . . . . 6 ((((Smo 𝐹 ∧ Ord 𝐴) ∧ 𝑥 ∈ dom (𝐹𝐴)) ∧ 𝑦𝑥) → ((𝐹𝐴)‘𝑥) = (𝐹𝑥))
4238, 41eleq12d 2825 . . . . 5 ((((Smo 𝐹 ∧ Ord 𝐴) ∧ 𝑥 ∈ dom (𝐹𝐴)) ∧ 𝑦𝑥) → (((𝐹𝐴)‘𝑦) ∈ ((𝐹𝐴)‘𝑥) ↔ (𝐹𝑦) ∈ (𝐹𝑥)))
4342ralbidva 3153 . . . 4 (((Smo 𝐹 ∧ Ord 𝐴) ∧ 𝑥 ∈ dom (𝐹𝐴)) → (∀𝑦𝑥 ((𝐹𝐴)‘𝑦) ∈ ((𝐹𝐴)‘𝑥) ↔ ∀𝑦𝑥 (𝐹𝑦) ∈ (𝐹𝑥)))
4443ralbidva 3153 . . 3 ((Smo 𝐹 ∧ Ord 𝐴) → (∀𝑥 ∈ dom (𝐹𝐴)∀𝑦𝑥 ((𝐹𝐴)‘𝑦) ∈ ((𝐹𝐴)‘𝑥) ↔ ∀𝑥 ∈ dom (𝐹𝐴)∀𝑦𝑥 (𝐹𝑦) ∈ (𝐹𝑥)))
4529, 44mpbird 257 . 2 ((Smo 𝐹 ∧ Ord 𝐴) → ∀𝑥 ∈ dom (𝐹𝐴)∀𝑦𝑥 ((𝐹𝐴)‘𝑦) ∈ ((𝐹𝐴)‘𝑥))
46 dfsmo2 8267 . 2 (Smo (𝐹𝐴) ↔ ((𝐹𝐴):dom (𝐹𝐴)⟶On ∧ Ord dom (𝐹𝐴) ∧ ∀𝑥 ∈ dom (𝐹𝐴)∀𝑦𝑥 ((𝐹𝐴)‘𝑦) ∈ ((𝐹𝐴)‘𝑥)))
4714, 22, 45, 46syl3anbrc 1344 1 ((Smo 𝐹 ∧ Ord 𝐴) → Smo (𝐹𝐴))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1541  wcel 2111  wral 3047  cin 3896  wss 3897  dom cdm 5614  ran crn 5615  cres 5616  cima 5617  Ord word 6305  Oncon0 6306  Fun wfun 6475   Fn wfn 6476  wf 6477  cfv 6481  Smo wsmo 8265
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-11 2160  ax-ext 2703  ax-sep 5232  ax-nul 5242  ax-pr 5368
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-sb 2068  df-clab 2710  df-cleq 2723  df-clel 2806  df-ral 3048  df-rex 3057  df-rab 3396  df-v 3438  df-dif 3900  df-un 3902  df-in 3904  df-ss 3914  df-nul 4281  df-if 4473  df-sn 4574  df-pr 4576  df-op 4580  df-uni 4857  df-br 5090  df-opab 5152  df-tr 5197  df-po 5522  df-so 5523  df-fr 5567  df-we 5569  df-xp 5620  df-rel 5621  df-cnv 5622  df-co 5623  df-dm 5624  df-rn 5625  df-res 5626  df-ima 5627  df-ord 6309  df-iota 6437  df-fun 6483  df-fn 6484  df-f 6485  df-fv 6489  df-smo 8266
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator