Theorem smores2 5909

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.

Step	Hyp	Ref	Expression
1		dfsmo2 5902	. . . . . . 7 ⊢ (Smo 𝐹 ↔ (𝐹:dom 𝐹⟶On ∧ Ord dom 𝐹 ∧ ∀𝑥 ∈ dom 𝐹∀𝑦 ∈ 𝑥 (𝐹‘𝑦) ∈ (𝐹‘𝑥)))
2	1	simp1bi 919	. . . . . 6 ⊢ (Smo 𝐹 → 𝐹:dom 𝐹⟶On)
3		ffun 5048	. . . . . 6 ⊢ (𝐹:dom 𝐹⟶On → Fun 𝐹)
4	2, 3	syl 14	. . . . 5 ⊢ (Smo 𝐹 → Fun 𝐹)
5		funres 4941	. . . . . 6 ⊢ (Fun 𝐹 → Fun (𝐹 ↾ 𝐴))
6		funfn 4931	. . . . . 6 ⊢ (Fun (𝐹 ↾ 𝐴) ↔ (𝐹 ↾ 𝐴) Fn dom (𝐹 ↾ 𝐴))
7	5, 6	sylib 127	. . . . 5 ⊢ (Fun 𝐹 → (𝐹 ↾ 𝐴) Fn dom (𝐹 ↾ 𝐴))
8	4, 7	syl 14	. . . 4 ⊢ (Smo 𝐹 → (𝐹 ↾ 𝐴) Fn dom (𝐹 ↾ 𝐴))
9		df-ima 4358	. . . . . 6 ⊢ (𝐹 “ 𝐴) = ran (𝐹 ↾ 𝐴)
10		imassrn 4679	. . . . . 6 ⊢ (𝐹 “ 𝐴) ⊆ ran 𝐹
11	9, 10	eqsstr3i 2976	. . . . 5 ⊢ ran (𝐹 ↾ 𝐴) ⊆ ran 𝐹
12		frn 5052	. . . . . 6 ⊢ (𝐹:dom 𝐹⟶On → ran 𝐹 ⊆ On)
13	2, 12	syl 14	. . . . 5 ⊢ (Smo 𝐹 → ran 𝐹 ⊆ On)
14	11, 13	syl5ss 2956	. . . 4 ⊢ (Smo 𝐹 → ran (𝐹 ↾ 𝐴) ⊆ On)
15		df-f 4906	. . . 4 ⊢ ((𝐹 ↾ 𝐴):dom (𝐹 ↾ 𝐴)⟶On ↔ ((𝐹 ↾ 𝐴) Fn dom (𝐹 ↾ 𝐴) ∧ ran (𝐹 ↾ 𝐴) ⊆ On))
16	8, 14, 15	sylanbrc 394	. . 3 ⊢ (Smo 𝐹 → (𝐹 ↾ 𝐴):dom (𝐹 ↾ 𝐴)⟶On)
17	16	adantr 261	. 2 ⊢ ((Smo 𝐹 ∧ Ord 𝐴) → (𝐹 ↾ 𝐴):dom (𝐹 ↾ 𝐴)⟶On)
18		smodm 5906	. . 3 ⊢ (Smo 𝐹 → Ord dom 𝐹)
19		ordin 4122	. . . . 5 ⊢ ((Ord 𝐴 ∧ Ord dom 𝐹) → Ord (𝐴 ∩ dom 𝐹))
20		dmres 4632	. . . . . 6 ⊢ dom (𝐹 ↾ 𝐴) = (𝐴 ∩ dom 𝐹)
21		ordeq 4109	. . . . . 6 ⊢ (dom (𝐹 ↾ 𝐴) = (𝐴 ∩ dom 𝐹) → (Ord dom (𝐹 ↾ 𝐴) ↔ Ord (𝐴 ∩ dom 𝐹)))
22	20, 21	ax-mp 7	. . . . 5 ⊢ (Ord dom (𝐹 ↾ 𝐴) ↔ Ord (𝐴 ∩ dom 𝐹))
23	19, 22	sylibr 137	. . . 4 ⊢ ((Ord 𝐴 ∧ Ord dom 𝐹) → Ord dom (𝐹 ↾ 𝐴))
24	23	ancoms 255	. . 3 ⊢ ((Ord dom 𝐹 ∧ Ord 𝐴) → Ord dom (𝐹 ↾ 𝐴))
25	18, 24	sylan 267	. 2 ⊢ ((Smo 𝐹 ∧ Ord 𝐴) → Ord dom (𝐹 ↾ 𝐴))
26		resss 4635	. . . . . 6 ⊢ (𝐹 ↾ 𝐴) ⊆ 𝐹
27		dmss 4534	. . . . . 6 ⊢ ((𝐹 ↾ 𝐴) ⊆ 𝐹 → dom (𝐹 ↾ 𝐴) ⊆ dom 𝐹)
28	26, 27	ax-mp 7	. . . . 5 ⊢ dom (𝐹 ↾ 𝐴) ⊆ dom 𝐹
29	1	simp3bi 921	. . . . 5 ⊢ (Smo 𝐹 → ∀𝑥 ∈ dom 𝐹∀𝑦 ∈ 𝑥 (𝐹‘𝑦) ∈ (𝐹‘𝑥))
30		ssralv 3004	. . . . 5 ⊢ (dom (𝐹 ↾ 𝐴) ⊆ dom 𝐹 → (∀𝑥 ∈ dom 𝐹∀𝑦 ∈ 𝑥 (𝐹‘𝑦) ∈ (𝐹‘𝑥) → ∀𝑥 ∈ dom (𝐹 ↾ 𝐴)∀𝑦 ∈ 𝑥 (𝐹‘𝑦) ∈ (𝐹‘𝑥)))
31	28, 29, 30	mpsyl 59	. . . 4 ⊢ (Smo 𝐹 → ∀𝑥 ∈ dom (𝐹 ↾ 𝐴)∀𝑦 ∈ 𝑥 (𝐹‘𝑦) ∈ (𝐹‘𝑥))
32	31	adantr 261	. . 3 ⊢ ((Smo 𝐹 ∧ Ord 𝐴) → ∀𝑥 ∈ dom (𝐹 ↾ 𝐴)∀𝑦 ∈ 𝑥 (𝐹‘𝑦) ∈ (𝐹‘𝑥))
33		ordtr1 4125	. . . . . . . . . . 11 ⊢ (Ord dom (𝐹 ↾ 𝐴) → ((𝑦 ∈ 𝑥 ∧ 𝑥 ∈ dom (𝐹 ↾ 𝐴)) → 𝑦 ∈ dom (𝐹 ↾ 𝐴)))
34	25, 33	syl 14	. . . . . . . . . 10 ⊢ ((Smo 𝐹 ∧ Ord 𝐴) → ((𝑦 ∈ 𝑥 ∧ 𝑥 ∈ dom (𝐹 ↾ 𝐴)) → 𝑦 ∈ dom (𝐹 ↾ 𝐴)))
35		inss1 3157	. . . . . . . . . . . 12 ⊢ (𝐴 ∩ dom 𝐹) ⊆ 𝐴
36	20, 35	eqsstri 2975	. . . . . . . . . . 11 ⊢ dom (𝐹 ↾ 𝐴) ⊆ 𝐴
37	36	sseli 2941	. . . . . . . . . 10 ⊢ (𝑦 ∈ dom (𝐹 ↾ 𝐴) → 𝑦 ∈ 𝐴)
38	34, 37	syl6 29	. . . . . . . . 9 ⊢ ((Smo 𝐹 ∧ Ord 𝐴) → ((𝑦 ∈ 𝑥 ∧ 𝑥 ∈ dom (𝐹 ↾ 𝐴)) → 𝑦 ∈ 𝐴))
39	38	expcomd 1330	. . . . . . . 8 ⊢ ((Smo 𝐹 ∧ Ord 𝐴) → (𝑥 ∈ dom (𝐹 ↾ 𝐴) → (𝑦 ∈ 𝑥 → 𝑦 ∈ 𝐴)))
40	39	imp31 243	. . . . . . 7 ⊢ ((((Smo 𝐹 ∧ Ord 𝐴) ∧ 𝑥 ∈ dom (𝐹 ↾ 𝐴)) ∧ 𝑦 ∈ 𝑥) → 𝑦 ∈ 𝐴)
41		fvres 5198	. . . . . . 7 ⊢ (𝑦 ∈ 𝐴 → ((𝐹 ↾ 𝐴)‘𝑦) = (𝐹‘𝑦))
42	40, 41	syl 14	. . . . . 6 ⊢ ((((Smo 𝐹 ∧ Ord 𝐴) ∧ 𝑥 ∈ dom (𝐹 ↾ 𝐴)) ∧ 𝑦 ∈ 𝑥) → ((𝐹 ↾ 𝐴)‘𝑦) = (𝐹‘𝑦))
43	36	sseli 2941	. . . . . . . 8 ⊢ (𝑥 ∈ dom (𝐹 ↾ 𝐴) → 𝑥 ∈ 𝐴)
44		fvres 5198	. . . . . . . 8 ⊢ (𝑥 ∈ 𝐴 → ((𝐹 ↾ 𝐴)‘𝑥) = (𝐹‘𝑥))
45	43, 44	syl 14	. . . . . . 7 ⊢ (𝑥 ∈ dom (𝐹 ↾ 𝐴) → ((𝐹 ↾ 𝐴)‘𝑥) = (𝐹‘𝑥))
46	45	ad2antlr 458	. . . . . 6 ⊢ ((((Smo 𝐹 ∧ Ord 𝐴) ∧ 𝑥 ∈ dom (𝐹 ↾ 𝐴)) ∧ 𝑦 ∈ 𝑥) → ((𝐹 ↾ 𝐴)‘𝑥) = (𝐹‘𝑥))
47	42, 46	eleq12d 2108	. . . . 5 ⊢ ((((Smo 𝐹 ∧ Ord 𝐴) ∧ 𝑥 ∈ dom (𝐹 ↾ 𝐴)) ∧ 𝑦 ∈ 𝑥) → (((𝐹 ↾ 𝐴)‘𝑦) ∈ ((𝐹 ↾ 𝐴)‘𝑥) ↔ (𝐹‘𝑦) ∈ (𝐹‘𝑥)))
48	47	ralbidva 2322	. . . 4 ⊢ (((Smo 𝐹 ∧ Ord 𝐴) ∧ 𝑥 ∈ dom (𝐹 ↾ 𝐴)) → (∀𝑦 ∈ 𝑥 ((𝐹 ↾ 𝐴)‘𝑦) ∈ ((𝐹 ↾ 𝐴)‘𝑥) ↔ ∀𝑦 ∈ 𝑥 (𝐹‘𝑦) ∈ (𝐹‘𝑥)))
49	48	ralbidva 2322	. . 3 ⊢ ((Smo 𝐹 ∧ Ord 𝐴) → (∀𝑥 ∈ dom (𝐹 ↾ 𝐴)∀𝑦 ∈ 𝑥 ((𝐹 ↾ 𝐴)‘𝑦) ∈ ((𝐹 ↾ 𝐴)‘𝑥) ↔ ∀𝑥 ∈ dom (𝐹 ↾ 𝐴)∀𝑦 ∈ 𝑥 (𝐹‘𝑦) ∈ (𝐹‘𝑥)))
50	32, 49	mpbird 156	. 2 ⊢ ((Smo 𝐹 ∧ Ord 𝐴) → ∀𝑥 ∈ dom (𝐹 ↾ 𝐴)∀𝑦 ∈ 𝑥 ((𝐹 ↾ 𝐴)‘𝑦) ∈ ((𝐹 ↾ 𝐴)‘𝑥))
51		dfsmo2 5902	. 2 ⊢ (Smo (𝐹 ↾ 𝐴) ↔ ((𝐹 ↾ 𝐴):dom (𝐹 ↾ 𝐴)⟶On ∧ Ord dom (𝐹 ↾ 𝐴) ∧ ∀𝑥 ∈ dom (𝐹 ↾ 𝐴)∀𝑦 ∈ 𝑥 ((𝐹 ↾ 𝐴)‘𝑦) ∈ ((𝐹 ↾ 𝐴)‘𝑥)))
52	17, 25, 50, 51	syl3anbrc 1088	1 ⊢ ((Smo 𝐹 ∧ Ord 𝐴) → Smo (𝐹 ↾ 𝐴))

Syntax hints:   → wi 4   ∧ wa 97   ↔ wb 98   = wceq 1243   ∈ wcel 1393  ∀wral 2306   ∩ cin 2916   ⊆ wss 2917  Ord word 4099  Oncon0 4100  dom cdm 4345  ran crn 4346   ↾ cres 4347   “ cima 4348  Fun wfun 4896   Fn wfn 4897  ⟶wf 4898  ‘cfv 4902  Smo wsmo 5900

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-14 1405  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022  ax-sep 3875  ax-pow 3927  ax-pr 3944

This theorem depends on definitions:  df-bi 110  df-3an 887  df-tru 1246  df-nf 1350  df-sb 1646  df-eu 1903  df-mo 1904  df-clab 2027  df-cleq 2033  df-clel 2036  df-nfc 2167  df-ral 2311  df-rex 2312  df-v 2559  df-un 2922  df-in 2924  df-ss 2931  df-pw 3361  df-sn 3381  df-pr 3382  df-op 3384  df-uni 3581  df-br 3765  df-opab 3819  df-tr 3855  df-iord 4103  df-xp 4351  df-rel 4352  df-cnv 4353  df-co 4354  df-dm 4355  df-rn 4356  df-res 4357  df-ima 4358  df-iota 4867  df-fun 4904  df-fn 4905  df-f 4906  df-fv 4910  df-smo 5901

This theorem is referenced by: (None)