Theorem smores2 6297

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 6290	. . . . . . 7 ⊢ (Smo 𝐹 ↔ (𝐹:dom 𝐹⟶On ∧ Ord dom 𝐹 ∧ ∀𝑥 ∈ dom 𝐹∀𝑦 ∈ 𝑥 (𝐹‘𝑦) ∈ (𝐹‘𝑥)))
2	1	simp1bi 1012	. . . . . 6 ⊢ (Smo 𝐹 → 𝐹:dom 𝐹⟶On)
3		ffun 5370	. . . . . 6 ⊢ (𝐹:dom 𝐹⟶On → Fun 𝐹)
4	2, 3	syl 14	. . . . 5 ⊢ (Smo 𝐹 → Fun 𝐹)
5		funres 5259	. . . . . 6 ⊢ (Fun 𝐹 → Fun (𝐹 ↾ 𝐴))
6		funfn 5248	. . . . . 6 ⊢ (Fun (𝐹 ↾ 𝐴) ↔ (𝐹 ↾ 𝐴) Fn dom (𝐹 ↾ 𝐴))
7	5, 6	sylib 122	. . . . 5 ⊢ (Fun 𝐹 → (𝐹 ↾ 𝐴) Fn dom (𝐹 ↾ 𝐴))
8	4, 7	syl 14	. . . 4 ⊢ (Smo 𝐹 → (𝐹 ↾ 𝐴) Fn dom (𝐹 ↾ 𝐴))
9		df-ima 4641	. . . . . 6 ⊢ (𝐹 “ 𝐴) = ran (𝐹 ↾ 𝐴)
10		imassrn 4983	. . . . . 6 ⊢ (𝐹 “ 𝐴) ⊆ ran 𝐹
11	9, 10	eqsstrri 3190	. . . . 5 ⊢ ran (𝐹 ↾ 𝐴) ⊆ ran 𝐹
12		frn 5376	. . . . . 6 ⊢ (𝐹:dom 𝐹⟶On → ran 𝐹 ⊆ On)
13	2, 12	syl 14	. . . . 5 ⊢ (Smo 𝐹 → ran 𝐹 ⊆ On)
14	11, 13	sstrid 3168	. . . 4 ⊢ (Smo 𝐹 → ran (𝐹 ↾ 𝐴) ⊆ On)
15		df-f 5222	. . . 4 ⊢ ((𝐹 ↾ 𝐴):dom (𝐹 ↾ 𝐴)⟶On ↔ ((𝐹 ↾ 𝐴) Fn dom (𝐹 ↾ 𝐴) ∧ ran (𝐹 ↾ 𝐴) ⊆ On))
16	8, 14, 15	sylanbrc 417	. . 3 ⊢ (Smo 𝐹 → (𝐹 ↾ 𝐴):dom (𝐹 ↾ 𝐴)⟶On)
17	16	adantr 276	. 2 ⊢ ((Smo 𝐹 ∧ Ord 𝐴) → (𝐹 ↾ 𝐴):dom (𝐹 ↾ 𝐴)⟶On)
18		smodm 6294	. . 3 ⊢ (Smo 𝐹 → Ord dom 𝐹)
19		ordin 4387	. . . . 5 ⊢ ((Ord 𝐴 ∧ Ord dom 𝐹) → Ord (𝐴 ∩ dom 𝐹))
20		dmres 4930	. . . . . 6 ⊢ dom (𝐹 ↾ 𝐴) = (𝐴 ∩ dom 𝐹)
21		ordeq 4374	. . . . . 6 ⊢ (dom (𝐹 ↾ 𝐴) = (𝐴 ∩ dom 𝐹) → (Ord dom (𝐹 ↾ 𝐴) ↔ Ord (𝐴 ∩ dom 𝐹)))
22	20, 21	ax-mp 5	. . . . 5 ⊢ (Ord dom (𝐹 ↾ 𝐴) ↔ Ord (𝐴 ∩ dom 𝐹))
23	19, 22	sylibr 134	. . . 4 ⊢ ((Ord 𝐴 ∧ Ord dom 𝐹) → Ord dom (𝐹 ↾ 𝐴))
24	23	ancoms 268	. . 3 ⊢ ((Ord dom 𝐹 ∧ Ord 𝐴) → Ord dom (𝐹 ↾ 𝐴))
25	18, 24	sylan 283	. 2 ⊢ ((Smo 𝐹 ∧ Ord 𝐴) → Ord dom (𝐹 ↾ 𝐴))
26		resss 4933	. . . . . 6 ⊢ (𝐹 ↾ 𝐴) ⊆ 𝐹
27		dmss 4828	. . . . . 6 ⊢ ((𝐹 ↾ 𝐴) ⊆ 𝐹 → dom (𝐹 ↾ 𝐴) ⊆ dom 𝐹)
28	26, 27	ax-mp 5	. . . . 5 ⊢ dom (𝐹 ↾ 𝐴) ⊆ dom 𝐹
29	1	simp3bi 1014	. . . . 5 ⊢ (Smo 𝐹 → ∀𝑥 ∈ dom 𝐹∀𝑦 ∈ 𝑥 (𝐹‘𝑦) ∈ (𝐹‘𝑥))
30		ssralv 3221	. . . . 5 ⊢ (dom (𝐹 ↾ 𝐴) ⊆ dom 𝐹 → (∀𝑥 ∈ dom 𝐹∀𝑦 ∈ 𝑥 (𝐹‘𝑦) ∈ (𝐹‘𝑥) → ∀𝑥 ∈ dom (𝐹 ↾ 𝐴)∀𝑦 ∈ 𝑥 (𝐹‘𝑦) ∈ (𝐹‘𝑥)))
31	28, 29, 30	mpsyl 65	. . . 4 ⊢ (Smo 𝐹 → ∀𝑥 ∈ dom (𝐹 ↾ 𝐴)∀𝑦 ∈ 𝑥 (𝐹‘𝑦) ∈ (𝐹‘𝑥))
32	31	adantr 276	. . 3 ⊢ ((Smo 𝐹 ∧ Ord 𝐴) → ∀𝑥 ∈ dom (𝐹 ↾ 𝐴)∀𝑦 ∈ 𝑥 (𝐹‘𝑦) ∈ (𝐹‘𝑥))
33		ordtr1 4390	. . . . . . . . . . 11 ⊢ (Ord dom (𝐹 ↾ 𝐴) → ((𝑦 ∈ 𝑥 ∧ 𝑥 ∈ dom (𝐹 ↾ 𝐴)) → 𝑦 ∈ dom (𝐹 ↾ 𝐴)))
34	25, 33	syl 14	. . . . . . . . . 10 ⊢ ((Smo 𝐹 ∧ Ord 𝐴) → ((𝑦 ∈ 𝑥 ∧ 𝑥 ∈ dom (𝐹 ↾ 𝐴)) → 𝑦 ∈ dom (𝐹 ↾ 𝐴)))
35		inss1 3357	. . . . . . . . . . . 12 ⊢ (𝐴 ∩ dom 𝐹) ⊆ 𝐴
36	20, 35	eqsstri 3189	. . . . . . . . . . 11 ⊢ dom (𝐹 ↾ 𝐴) ⊆ 𝐴
37	36	sseli 3153	. . . . . . . . . 10 ⊢ (𝑦 ∈ dom (𝐹 ↾ 𝐴) → 𝑦 ∈ 𝐴)
38	34, 37	syl6 33	. . . . . . . . 9 ⊢ ((Smo 𝐹 ∧ Ord 𝐴) → ((𝑦 ∈ 𝑥 ∧ 𝑥 ∈ dom (𝐹 ↾ 𝐴)) → 𝑦 ∈ 𝐴))
39	38	expcomd 1441	. . . . . . . 8 ⊢ ((Smo 𝐹 ∧ Ord 𝐴) → (𝑥 ∈ dom (𝐹 ↾ 𝐴) → (𝑦 ∈ 𝑥 → 𝑦 ∈ 𝐴)))
40	39	imp31 256	. . . . . . 7 ⊢ ((((Smo 𝐹 ∧ Ord 𝐴) ∧ 𝑥 ∈ dom (𝐹 ↾ 𝐴)) ∧ 𝑦 ∈ 𝑥) → 𝑦 ∈ 𝐴)
41		fvres 5541	. . . . . . 7 ⊢ (𝑦 ∈ 𝐴 → ((𝐹 ↾ 𝐴)‘𝑦) = (𝐹‘𝑦))
42	40, 41	syl 14	. . . . . 6 ⊢ ((((Smo 𝐹 ∧ Ord 𝐴) ∧ 𝑥 ∈ dom (𝐹 ↾ 𝐴)) ∧ 𝑦 ∈ 𝑥) → ((𝐹 ↾ 𝐴)‘𝑦) = (𝐹‘𝑦))
43	36	sseli 3153	. . . . . . . 8 ⊢ (𝑥 ∈ dom (𝐹 ↾ 𝐴) → 𝑥 ∈ 𝐴)
44		fvres 5541	. . . . . . . 8 ⊢ (𝑥 ∈ 𝐴 → ((𝐹 ↾ 𝐴)‘𝑥) = (𝐹‘𝑥))
45	43, 44	syl 14	. . . . . . 7 ⊢ (𝑥 ∈ dom (𝐹 ↾ 𝐴) → ((𝐹 ↾ 𝐴)‘𝑥) = (𝐹‘𝑥))
46	45	ad2antlr 489	. . . . . 6 ⊢ ((((Smo 𝐹 ∧ Ord 𝐴) ∧ 𝑥 ∈ dom (𝐹 ↾ 𝐴)) ∧ 𝑦 ∈ 𝑥) → ((𝐹 ↾ 𝐴)‘𝑥) = (𝐹‘𝑥))
47	42, 46	eleq12d 2248	. . . . 5 ⊢ ((((Smo 𝐹 ∧ Ord 𝐴) ∧ 𝑥 ∈ dom (𝐹 ↾ 𝐴)) ∧ 𝑦 ∈ 𝑥) → (((𝐹 ↾ 𝐴)‘𝑦) ∈ ((𝐹 ↾ 𝐴)‘𝑥) ↔ (𝐹‘𝑦) ∈ (𝐹‘𝑥)))
48	47	ralbidva 2473	. . . 4 ⊢ (((Smo 𝐹 ∧ Ord 𝐴) ∧ 𝑥 ∈ dom (𝐹 ↾ 𝐴)) → (∀𝑦 ∈ 𝑥 ((𝐹 ↾ 𝐴)‘𝑦) ∈ ((𝐹 ↾ 𝐴)‘𝑥) ↔ ∀𝑦 ∈ 𝑥 (𝐹‘𝑦) ∈ (𝐹‘𝑥)))
49	48	ralbidva 2473	. . 3 ⊢ ((Smo 𝐹 ∧ Ord 𝐴) → (∀𝑥 ∈ dom (𝐹 ↾ 𝐴)∀𝑦 ∈ 𝑥 ((𝐹 ↾ 𝐴)‘𝑦) ∈ ((𝐹 ↾ 𝐴)‘𝑥) ↔ ∀𝑥 ∈ dom (𝐹 ↾ 𝐴)∀𝑦 ∈ 𝑥 (𝐹‘𝑦) ∈ (𝐹‘𝑥)))
50	32, 49	mpbird 167	. 2 ⊢ ((Smo 𝐹 ∧ Ord 𝐴) → ∀𝑥 ∈ dom (𝐹 ↾ 𝐴)∀𝑦 ∈ 𝑥 ((𝐹 ↾ 𝐴)‘𝑦) ∈ ((𝐹 ↾ 𝐴)‘𝑥))
51		dfsmo2 6290	. 2 ⊢ (Smo (𝐹 ↾ 𝐴) ↔ ((𝐹 ↾ 𝐴):dom (𝐹 ↾ 𝐴)⟶On ∧ Ord dom (𝐹 ↾ 𝐴) ∧ ∀𝑥 ∈ dom (𝐹 ↾ 𝐴)∀𝑦 ∈ 𝑥 ((𝐹 ↾ 𝐴)‘𝑦) ∈ ((𝐹 ↾ 𝐴)‘𝑥)))
52	17, 25, 50, 51	syl3anbrc 1181	1 ⊢ ((Smo 𝐹 ∧ Ord 𝐴) → Smo (𝐹 ↾ 𝐴))

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1353   ∈ wcel 2148  ∀wral 2455   ∩ cin 3130   ⊆ wss 3131  Ord word 4364  Oncon0 4365  dom cdm 4628  ran crn 4629   ↾ cres 4630   “ cima 4631  Fun wfun 5212   Fn wfn 5213  ⟶wf 5214  ‘cfv 5218  Smo wsmo 6288

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-14 2151  ax-ext 2159  ax-sep 4123  ax-pow 4176  ax-pr 4211

This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ral 2460  df-rex 2461  df-v 2741  df-un 3135  df-in 3137  df-ss 3144  df-pw 3579  df-sn 3600  df-pr 3601  df-op 3603  df-uni 3812  df-br 4006  df-opab 4067  df-tr 4104  df-iord 4368  df-xp 4634  df-rel 4635  df-cnv 4636  df-co 4637  df-dm 4638  df-rn 4639  df-res 4640  df-ima 4641  df-iota 5180  df-fun 5220  df-fn 5221  df-f 5222  df-fv 5226  df-smo 6289

This theorem is referenced by: (None)