Theorem smores2 6361

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 6354	. . . . . . 7 ⊢ (Smo 𝐹 ↔ (𝐹:dom 𝐹⟶On ∧ Ord dom 𝐹 ∧ ∀𝑥 ∈ dom 𝐹∀𝑦 ∈ 𝑥 (𝐹‘𝑦) ∈ (𝐹‘𝑥)))
2	1	simp1bi 1014	. . . . . 6 ⊢ (Smo 𝐹 → 𝐹:dom 𝐹⟶On)
3		ffun 5413	. . . . . 6 ⊢ (𝐹:dom 𝐹⟶On → Fun 𝐹)
4	2, 3	syl 14	. . . . 5 ⊢ (Smo 𝐹 → Fun 𝐹)
5		funres 5300	. . . . . 6 ⊢ (Fun 𝐹 → Fun (𝐹 ↾ 𝐴))
6		funfn 5289	. . . . . 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 4677	. . . . . 6 ⊢ (𝐹 “ 𝐴) = ran (𝐹 ↾ 𝐴)
10		imassrn 5021	. . . . . 6 ⊢ (𝐹 “ 𝐴) ⊆ ran 𝐹
11	9, 10	eqsstrri 3217	. . . . 5 ⊢ ran (𝐹 ↾ 𝐴) ⊆ ran 𝐹
12		frn 5419	. . . . . 6 ⊢ (𝐹:dom 𝐹⟶On → ran 𝐹 ⊆ On)
13	2, 12	syl 14	. . . . 5 ⊢ (Smo 𝐹 → ran 𝐹 ⊆ On)
14	11, 13	sstrid 3195	. . . 4 ⊢ (Smo 𝐹 → ran (𝐹 ↾ 𝐴) ⊆ On)
15		df-f 5263	. . . 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 6358	. . 3 ⊢ (Smo 𝐹 → Ord dom 𝐹)
19		ordin 4421	. . . . 5 ⊢ ((Ord 𝐴 ∧ Ord dom 𝐹) → Ord (𝐴 ∩ dom 𝐹))
20		dmres 4968	. . . . . 6 ⊢ dom (𝐹 ↾ 𝐴) = (𝐴 ∩ dom 𝐹)
21		ordeq 4408	. . . . . 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 4971	. . . . . 6 ⊢ (𝐹 ↾ 𝐴) ⊆ 𝐹
27		dmss 4866	. . . . . 6 ⊢ ((𝐹 ↾ 𝐴) ⊆ 𝐹 → dom (𝐹 ↾ 𝐴) ⊆ dom 𝐹)
28	26, 27	ax-mp 5	. . . . 5 ⊢ dom (𝐹 ↾ 𝐴) ⊆ dom 𝐹
29	1	simp3bi 1016	. . . . 5 ⊢ (Smo 𝐹 → ∀𝑥 ∈ dom 𝐹∀𝑦 ∈ 𝑥 (𝐹‘𝑦) ∈ (𝐹‘𝑥))
30		ssralv 3248	. . . . 5 ⊢ (dom (𝐹 ↾ 𝐴) ⊆ dom 𝐹 → (∀𝑥 ∈ dom 𝐹∀𝑦 ∈ 𝑥 (𝐹‘𝑦) ∈ (𝐹‘𝑥) → ∀𝑥 ∈ dom (𝐹 ↾ 𝐴)∀𝑦 ∈ 𝑥 (𝐹‘𝑦) ∈ (𝐹‘𝑥)))
31	28, 29, 30	mpsyl 65	. . . 4 ⊢ (Smo 𝐹 → ∀𝑥 ∈ dom (𝐹 ↾ 𝐴)∀𝑦 ∈ 𝑥 (𝐹‘𝑦) ∈ (𝐹‘𝑥))
32	31	adantr 276	. . 3 ⊢ ((Smo 𝐹 ∧ Ord 𝐴) → ∀𝑥 ∈ dom (𝐹 ↾ 𝐴)∀𝑦 ∈ 𝑥 (𝐹‘𝑦) ∈ (𝐹‘𝑥))
33		ordtr1 4424	. . . . . . . . . . 11 ⊢ (Ord dom (𝐹 ↾ 𝐴) → ((𝑦 ∈ 𝑥 ∧ 𝑥 ∈ dom (𝐹 ↾ 𝐴)) → 𝑦 ∈ dom (𝐹 ↾ 𝐴)))
34	25, 33	syl 14	. . . . . . . . . 10 ⊢ ((Smo 𝐹 ∧ Ord 𝐴) → ((𝑦 ∈ 𝑥 ∧ 𝑥 ∈ dom (𝐹 ↾ 𝐴)) → 𝑦 ∈ dom (𝐹 ↾ 𝐴)))
35		inss1 3384	. . . . . . . . . . . 12 ⊢ (𝐴 ∩ dom 𝐹) ⊆ 𝐴
36	20, 35	eqsstri 3216	. . . . . . . . . . 11 ⊢ dom (𝐹 ↾ 𝐴) ⊆ 𝐴
37	36	sseli 3180	. . . . . . . . . 10 ⊢ (𝑦 ∈ dom (𝐹 ↾ 𝐴) → 𝑦 ∈ 𝐴)
38	34, 37	syl6 33	. . . . . . . . 9 ⊢ ((Smo 𝐹 ∧ Ord 𝐴) → ((𝑦 ∈ 𝑥 ∧ 𝑥 ∈ dom (𝐹 ↾ 𝐴)) → 𝑦 ∈ 𝐴))
39	38	expcomd 1452	. . . . . . . 8 ⊢ ((Smo 𝐹 ∧ Ord 𝐴) → (𝑥 ∈ dom (𝐹 ↾ 𝐴) → (𝑦 ∈ 𝑥 → 𝑦 ∈ 𝐴)))
40	39	imp31 256	. . . . . . 7 ⊢ ((((Smo 𝐹 ∧ Ord 𝐴) ∧ 𝑥 ∈ dom (𝐹 ↾ 𝐴)) ∧ 𝑦 ∈ 𝑥) → 𝑦 ∈ 𝐴)
41		fvres 5585	. . . . . . 7 ⊢ (𝑦 ∈ 𝐴 → ((𝐹 ↾ 𝐴)‘𝑦) = (𝐹‘𝑦))
42	40, 41	syl 14	. . . . . 6 ⊢ ((((Smo 𝐹 ∧ Ord 𝐴) ∧ 𝑥 ∈ dom (𝐹 ↾ 𝐴)) ∧ 𝑦 ∈ 𝑥) → ((𝐹 ↾ 𝐴)‘𝑦) = (𝐹‘𝑦))
43	36	sseli 3180	. . . . . . . 8 ⊢ (𝑥 ∈ dom (𝐹 ↾ 𝐴) → 𝑥 ∈ 𝐴)
44		fvres 5585	. . . . . . . 8 ⊢ (𝑥 ∈ 𝐴 → ((𝐹 ↾ 𝐴)‘𝑥) = (𝐹‘𝑥))
45	43, 44	syl 14	. . . . . . 7 ⊢ (𝑥 ∈ dom (𝐹 ↾ 𝐴) → ((𝐹 ↾ 𝐴)‘𝑥) = (𝐹‘𝑥))
46	45	ad2antlr 489	. . . . . 6 ⊢ ((((Smo 𝐹 ∧ Ord 𝐴) ∧ 𝑥 ∈ dom (𝐹 ↾ 𝐴)) ∧ 𝑦 ∈ 𝑥) → ((𝐹 ↾ 𝐴)‘𝑥) = (𝐹‘𝑥))
47	42, 46	eleq12d 2267	. . . . 5 ⊢ ((((Smo 𝐹 ∧ Ord 𝐴) ∧ 𝑥 ∈ dom (𝐹 ↾ 𝐴)) ∧ 𝑦 ∈ 𝑥) → (((𝐹 ↾ 𝐴)‘𝑦) ∈ ((𝐹 ↾ 𝐴)‘𝑥) ↔ (𝐹‘𝑦) ∈ (𝐹‘𝑥)))
48	47	ralbidva 2493	. . . 4 ⊢ (((Smo 𝐹 ∧ Ord 𝐴) ∧ 𝑥 ∈ dom (𝐹 ↾ 𝐴)) → (∀𝑦 ∈ 𝑥 ((𝐹 ↾ 𝐴)‘𝑦) ∈ ((𝐹 ↾ 𝐴)‘𝑥) ↔ ∀𝑦 ∈ 𝑥 (𝐹‘𝑦) ∈ (𝐹‘𝑥)))
49	48	ralbidva 2493	. . 3 ⊢ ((Smo 𝐹 ∧ Ord 𝐴) → (∀𝑥 ∈ dom (𝐹 ↾ 𝐴)∀𝑦 ∈ 𝑥 ((𝐹 ↾ 𝐴)‘𝑦) ∈ ((𝐹 ↾ 𝐴)‘𝑥) ↔ ∀𝑥 ∈ dom (𝐹 ↾ 𝐴)∀𝑦 ∈ 𝑥 (𝐹‘𝑦) ∈ (𝐹‘𝑥)))
50	32, 49	mpbird 167	. 2 ⊢ ((Smo 𝐹 ∧ Ord 𝐴) → ∀𝑥 ∈ dom (𝐹 ↾ 𝐴)∀𝑦 ∈ 𝑥 ((𝐹 ↾ 𝐴)‘𝑦) ∈ ((𝐹 ↾ 𝐴)‘𝑥))
51		dfsmo2 6354	. 2 ⊢ (Smo (𝐹 ↾ 𝐴) ↔ ((𝐹 ↾ 𝐴):dom (𝐹 ↾ 𝐴)⟶On ∧ Ord dom (𝐹 ↾ 𝐴) ∧ ∀𝑥 ∈ dom (𝐹 ↾ 𝐴)∀𝑦 ∈ 𝑥 ((𝐹 ↾ 𝐴)‘𝑦) ∈ ((𝐹 ↾ 𝐴)‘𝑥)))
52	17, 25, 50, 51	syl3anbrc 1183	1 ⊢ ((Smo 𝐹 ∧ Ord 𝐴) → Smo (𝐹 ↾ 𝐴))

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1364   ∈ wcel 2167  ∀wral 2475   ∩ cin 3156   ⊆ wss 3157  Ord word 4398  Oncon0 4399  dom cdm 4664  ran crn 4665   ↾ cres 4666   “ cima 4667  Fun wfun 5253   Fn wfn 5254  ⟶wf 5255  ‘cfv 5259  Smo wsmo 6352

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 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-14 2170  ax-ext 2178  ax-sep 4152  ax-pow 4208  ax-pr 4243

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ral 2480  df-rex 2481  df-v 2765  df-un 3161  df-in 3163  df-ss 3170  df-pw 3608  df-sn 3629  df-pr 3630  df-op 3632  df-uni 3841  df-br 4035  df-opab 4096  df-tr 4133  df-iord 4402  df-xp 4670  df-rel 4671  df-cnv 4672  df-co 4673  df-dm 4674  df-rn 4675  df-res 4676  df-ima 4677  df-iota 5220  df-fun 5261  df-fn 5262  df-f 5263  df-fv 5267  df-smo 6353

This theorem is referenced by: (None)