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

Theorem smores2 8286
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 8279 . . . . . . 7 (Smo 𝐹 ↔ (𝐹:dom 𝐹⟶On ∧ Ord dom 𝐹 ∧ ∀𝑥 ∈ dom 𝐹𝑦𝑥 (𝐹𝑦) ∈ (𝐹𝑥)))
21simp1bi 1145 . . . . . 6 (Smo 𝐹𝐹:dom 𝐹⟶On)
32ffund 6666 . . . . 5 (Smo 𝐹 → Fun 𝐹)
4 funres 6534 . . . . . 6 (Fun 𝐹 → Fun (𝐹𝐴))
54funfnd 6523 . . . . 5 (Fun 𝐹 → (𝐹𝐴) Fn dom (𝐹𝐴))
63, 5syl 17 . . . 4 (Smo 𝐹 → (𝐹𝐴) Fn dom (𝐹𝐴))
7 df-ima 5637 . . . . . 6 (𝐹𝐴) = ran (𝐹𝐴)
8 imassrn 6030 . . . . . 6 (𝐹𝐴) ⊆ ran 𝐹
97, 8eqsstrri 3981 . . . . 5 ran (𝐹𝐴) ⊆ ran 𝐹
102frnd 6670 . . . . 5 (Smo 𝐹 → ran 𝐹 ⊆ On)
119, 10sstrid 3945 . . . 4 (Smo 𝐹 → ran (𝐹𝐴) ⊆ On)
12 df-f 6496 . . . 4 ((𝐹𝐴):dom (𝐹𝐴)⟶On ↔ ((𝐹𝐴) Fn dom (𝐹𝐴) ∧ ran (𝐹𝐴) ⊆ On))
136, 11, 12sylanbrc 583 . . 3 (Smo 𝐹 → (𝐹𝐴):dom (𝐹𝐴)⟶On)
1413adantr 480 . 2 ((Smo 𝐹 ∧ Ord 𝐴) → (𝐹𝐴):dom (𝐹𝐴)⟶On)
15 smodm 8283 . . 3 (Smo 𝐹 → Ord dom 𝐹)
16 ordin 6347 . . . . 5 ((Ord 𝐴 ∧ Ord dom 𝐹) → Ord (𝐴 ∩ dom 𝐹))
17 dmres 5971 . . . . . 6 dom (𝐹𝐴) = (𝐴 ∩ dom 𝐹)
18 ordeq 6324 . . . . . 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 5960 . . . . . 6 (𝐹𝐴) ⊆ 𝐹
24 dmss 5851 . . . . . 6 ((𝐹𝐴) ⊆ 𝐹 → dom (𝐹𝐴) ⊆ dom 𝐹)
2523, 24ax-mp 5 . . . . 5 dom (𝐹𝐴) ⊆ dom 𝐹
261simp3bi 1147 . . . . 5 (Smo 𝐹 → ∀𝑥 ∈ dom 𝐹𝑦𝑥 (𝐹𝑦) ∈ (𝐹𝑥))
27 ssralv 4002 . . . . 5 (dom (𝐹𝐴) ⊆ dom 𝐹 → (∀𝑥 ∈ dom 𝐹𝑦𝑥 (𝐹𝑦) ∈ (𝐹𝑥) → ∀𝑥 ∈ dom (𝐹𝐴)∀𝑦𝑥 (𝐹𝑦) ∈ (𝐹𝑥)))
2825, 26, 27mpsyl 68 . . . 4 (Smo 𝐹 → ∀𝑥 ∈ dom (𝐹𝐴)∀𝑦𝑥 (𝐹𝑦) ∈ (𝐹𝑥))
2928adantr 480 . . 3 ((Smo 𝐹 ∧ Ord 𝐴) → ∀𝑥 ∈ dom (𝐹𝐴)∀𝑦𝑥 (𝐹𝑦) ∈ (𝐹𝑥))
30 ordtr1 6361 . . . . . . . . . . 11 (Ord dom (𝐹𝐴) → ((𝑦𝑥𝑥 ∈ dom (𝐹𝐴)) → 𝑦 ∈ dom (𝐹𝐴)))
3122, 30syl 17 . . . . . . . . . 10 ((Smo 𝐹 ∧ Ord 𝐴) → ((𝑦𝑥𝑥 ∈ dom (𝐹𝐴)) → 𝑦 ∈ dom (𝐹𝐴)))
32 inss1 4189 . . . . . . . . . . . 12 (𝐴 ∩ dom 𝐹) ⊆ 𝐴
3317, 32eqsstri 3980 . . . . . . . . . . 11 dom (𝐹𝐴) ⊆ 𝐴
3433sseli 3929 . . . . . . . . . 10 (𝑦 ∈ dom (𝐹𝐴) → 𝑦𝐴)
3531, 34syl6 35 . . . . . . . . 9 ((Smo 𝐹 ∧ Ord 𝐴) → ((𝑦𝑥𝑥 ∈ dom (𝐹𝐴)) → 𝑦𝐴))
3635expcomd 416 . . . . . . . 8 ((Smo 𝐹 ∧ Ord 𝐴) → (𝑥 ∈ dom (𝐹𝐴) → (𝑦𝑥𝑦𝐴)))
3736imp31 417 . . . . . . 7 ((((Smo 𝐹 ∧ Ord 𝐴) ∧ 𝑥 ∈ dom (𝐹𝐴)) ∧ 𝑦𝑥) → 𝑦𝐴)
3837fvresd 6854 . . . . . 6 ((((Smo 𝐹 ∧ Ord 𝐴) ∧ 𝑥 ∈ dom (𝐹𝐴)) ∧ 𝑦𝑥) → ((𝐹𝐴)‘𝑦) = (𝐹𝑦))
3933sseli 3929 . . . . . . . 8 (𝑥 ∈ dom (𝐹𝐴) → 𝑥𝐴)
4039fvresd 6854 . . . . . . 7 (𝑥 ∈ dom (𝐹𝐴) → ((𝐹𝐴)‘𝑥) = (𝐹𝑥))
4140ad2antlr 727 . . . . . 6 ((((Smo 𝐹 ∧ Ord 𝐴) ∧ 𝑥 ∈ dom (𝐹𝐴)) ∧ 𝑦𝑥) → ((𝐹𝐴)‘𝑥) = (𝐹𝑥))
4238, 41eleq12d 2830 . . . . 5 ((((Smo 𝐹 ∧ Ord 𝐴) ∧ 𝑥 ∈ dom (𝐹𝐴)) ∧ 𝑦𝑥) → (((𝐹𝐴)‘𝑦) ∈ ((𝐹𝐴)‘𝑥) ↔ (𝐹𝑦) ∈ (𝐹𝑥)))
4342ralbidva 3157 . . . 4 (((Smo 𝐹 ∧ Ord 𝐴) ∧ 𝑥 ∈ dom (𝐹𝐴)) → (∀𝑦𝑥 ((𝐹𝐴)‘𝑦) ∈ ((𝐹𝐴)‘𝑥) ↔ ∀𝑦𝑥 (𝐹𝑦) ∈ (𝐹𝑥)))
4443ralbidva 3157 . . 3 ((Smo 𝐹 ∧ Ord 𝐴) → (∀𝑥 ∈ dom (𝐹𝐴)∀𝑦𝑥 ((𝐹𝐴)‘𝑦) ∈ ((𝐹𝐴)‘𝑥) ↔ ∀𝑥 ∈ dom (𝐹𝐴)∀𝑦𝑥 (𝐹𝑦) ∈ (𝐹𝑥)))
4529, 44mpbird 257 . 2 ((Smo 𝐹 ∧ Ord 𝐴) → ∀𝑥 ∈ dom (𝐹𝐴)∀𝑦𝑥 ((𝐹𝐴)‘𝑦) ∈ ((𝐹𝐴)‘𝑥))
46 dfsmo2 8279 . 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 2113  wral 3051  cin 3900  wss 3901  dom cdm 5624  ran crn 5625  cres 5626  cima 5627  Ord word 6316  Oncon0 6317  Fun wfun 6486   Fn wfn 6487  wf 6488  cfv 6492  Smo wsmo 8277
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 2115  ax-9 2123  ax-11 2162  ax-ext 2708  ax-sep 5241  ax-nul 5251  ax-pr 5377
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 2715  df-cleq 2728  df-clel 2811  df-ral 3052  df-rex 3061  df-rab 3400  df-v 3442  df-dif 3904  df-un 3906  df-in 3908  df-ss 3918  df-nul 4286  df-if 4480  df-sn 4581  df-pr 4583  df-op 4587  df-uni 4864  df-br 5099  df-opab 5161  df-tr 5206  df-po 5532  df-so 5533  df-fr 5577  df-we 5579  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-ord 6320  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-fv 6500  df-smo 8278
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator