Theorem dfsmo2 8370

Description: Alternate definition of a strictly monotone ordinal function. (Contributed by Mario Carneiro, 4-Mar-2013.)

Assertion

Ref	Expression
dfsmo2	⊢ (Smo 𝐹 ↔ (𝐹:dom 𝐹⟶On ∧ Ord dom 𝐹 ∧ ∀𝑥 ∈ dom 𝐹∀𝑦 ∈ 𝑥 (𝐹‘𝑦) ∈ (𝐹‘𝑥)))

Distinct variable group:   𝑥,𝐹,𝑦

Proof of Theorem dfsmo2

Step	Hyp	Ref	Expression
1		df-smo 8369	. 2 ⊢ (Smo 𝐹 ↔ (𝐹:dom 𝐹⟶On ∧ Ord dom 𝐹 ∧ ∀𝑦 ∈ dom 𝐹∀𝑥 ∈ dom 𝐹(𝑦 ∈ 𝑥 → (𝐹‘𝑦) ∈ (𝐹‘𝑥))))
2		ralcom 3274	. . . . . 6 ⊢ (∀𝑦 ∈ dom 𝐹∀𝑥 ∈ dom 𝐹(𝑦 ∈ 𝑥 → (𝐹‘𝑦) ∈ (𝐹‘𝑥)) ↔ ∀𝑥 ∈ dom 𝐹∀𝑦 ∈ dom 𝐹(𝑦 ∈ 𝑥 → (𝐹‘𝑦) ∈ (𝐹‘𝑥)))
3		impexp 450	. . . . . . . . 9 ⊢ (((𝑦 ∈ dom 𝐹 ∧ 𝑦 ∈ 𝑥) → (𝐹‘𝑦) ∈ (𝐹‘𝑥)) ↔ (𝑦 ∈ dom 𝐹 → (𝑦 ∈ 𝑥 → (𝐹‘𝑦) ∈ (𝐹‘𝑥))))
4		simpr 484	. . . . . . . . . . 11 ⊢ ((𝑦 ∈ dom 𝐹 ∧ 𝑦 ∈ 𝑥) → 𝑦 ∈ 𝑥)
5		ordtr1 6408	. . . . . . . . . . . . . . 15 ⊢ (Ord dom 𝐹 → ((𝑦 ∈ 𝑥 ∧ 𝑥 ∈ dom 𝐹) → 𝑦 ∈ dom 𝐹))
6	5	3impib 1116	. . . . . . . . . . . . . 14 ⊢ ((Ord dom 𝐹 ∧ 𝑦 ∈ 𝑥 ∧ 𝑥 ∈ dom 𝐹) → 𝑦 ∈ dom 𝐹)
7	6	3com23 1126	. . . . . . . . . . . . 13 ⊢ ((Ord dom 𝐹 ∧ 𝑥 ∈ dom 𝐹 ∧ 𝑦 ∈ 𝑥) → 𝑦 ∈ dom 𝐹)
8		simp3 1138	. . . . . . . . . . . . 13 ⊢ ((Ord dom 𝐹 ∧ 𝑥 ∈ dom 𝐹 ∧ 𝑦 ∈ 𝑥) → 𝑦 ∈ 𝑥)
9	7, 8	jca 511	. . . . . . . . . . . 12 ⊢ ((Ord dom 𝐹 ∧ 𝑥 ∈ dom 𝐹 ∧ 𝑦 ∈ 𝑥) → (𝑦 ∈ dom 𝐹 ∧ 𝑦 ∈ 𝑥))
10	9	3expia 1121	. . . . . . . . . . 11 ⊢ ((Ord dom 𝐹 ∧ 𝑥 ∈ dom 𝐹) → (𝑦 ∈ 𝑥 → (𝑦 ∈ dom 𝐹 ∧ 𝑦 ∈ 𝑥)))
11	4, 10	impbid2 226	. . . . . . . . . 10 ⊢ ((Ord dom 𝐹 ∧ 𝑥 ∈ dom 𝐹) → ((𝑦 ∈ dom 𝐹 ∧ 𝑦 ∈ 𝑥) ↔ 𝑦 ∈ 𝑥))
12	11	imbi1d 341	. . . . . . . . 9 ⊢ ((Ord dom 𝐹 ∧ 𝑥 ∈ dom 𝐹) → (((𝑦 ∈ dom 𝐹 ∧ 𝑦 ∈ 𝑥) → (𝐹‘𝑦) ∈ (𝐹‘𝑥)) ↔ (𝑦 ∈ 𝑥 → (𝐹‘𝑦) ∈ (𝐹‘𝑥))))
13	3, 12	bitr3id 285	. . . . . . . 8 ⊢ ((Ord dom 𝐹 ∧ 𝑥 ∈ dom 𝐹) → ((𝑦 ∈ dom 𝐹 → (𝑦 ∈ 𝑥 → (𝐹‘𝑦) ∈ (𝐹‘𝑥))) ↔ (𝑦 ∈ 𝑥 → (𝐹‘𝑦) ∈ (𝐹‘𝑥))))
14	13	ralbidv2 3161	. . . . . . 7 ⊢ ((Ord dom 𝐹 ∧ 𝑥 ∈ dom 𝐹) → (∀𝑦 ∈ dom 𝐹(𝑦 ∈ 𝑥 → (𝐹‘𝑦) ∈ (𝐹‘𝑥)) ↔ ∀𝑦 ∈ 𝑥 (𝐹‘𝑦) ∈ (𝐹‘𝑥)))
15	14	ralbidva 3163	. . . . . 6 ⊢ (Ord dom 𝐹 → (∀𝑥 ∈ dom 𝐹∀𝑦 ∈ dom 𝐹(𝑦 ∈ 𝑥 → (𝐹‘𝑦) ∈ (𝐹‘𝑥)) ↔ ∀𝑥 ∈ dom 𝐹∀𝑦 ∈ 𝑥 (𝐹‘𝑦) ∈ (𝐹‘𝑥)))
16	2, 15	bitrid 283	. . . . 5 ⊢ (Ord dom 𝐹 → (∀𝑦 ∈ dom 𝐹∀𝑥 ∈ dom 𝐹(𝑦 ∈ 𝑥 → (𝐹‘𝑦) ∈ (𝐹‘𝑥)) ↔ ∀𝑥 ∈ dom 𝐹∀𝑦 ∈ 𝑥 (𝐹‘𝑦) ∈ (𝐹‘𝑥)))
17	16	pm5.32i 574	. . . 4 ⊢ ((Ord dom 𝐹 ∧ ∀𝑦 ∈ dom 𝐹∀𝑥 ∈ dom 𝐹(𝑦 ∈ 𝑥 → (𝐹‘𝑦) ∈ (𝐹‘𝑥))) ↔ (Ord dom 𝐹 ∧ ∀𝑥 ∈ dom 𝐹∀𝑦 ∈ 𝑥 (𝐹‘𝑦) ∈ (𝐹‘𝑥)))
18	17	anbi2i 623	. . 3 ⊢ ((𝐹:dom 𝐹⟶On ∧ (Ord dom 𝐹 ∧ ∀𝑦 ∈ dom 𝐹∀𝑥 ∈ dom 𝐹(𝑦 ∈ 𝑥 → (𝐹‘𝑦) ∈ (𝐹‘𝑥)))) ↔ (𝐹:dom 𝐹⟶On ∧ (Ord dom 𝐹 ∧ ∀𝑥 ∈ dom 𝐹∀𝑦 ∈ 𝑥 (𝐹‘𝑦) ∈ (𝐹‘𝑥))))
19		3anass 1094	. . 3 ⊢ ((𝐹:dom 𝐹⟶On ∧ Ord dom 𝐹 ∧ ∀𝑦 ∈ dom 𝐹∀𝑥 ∈ dom 𝐹(𝑦 ∈ 𝑥 → (𝐹‘𝑦) ∈ (𝐹‘𝑥))) ↔ (𝐹:dom 𝐹⟶On ∧ (Ord dom 𝐹 ∧ ∀𝑦 ∈ dom 𝐹∀𝑥 ∈ dom 𝐹(𝑦 ∈ 𝑥 → (𝐹‘𝑦) ∈ (𝐹‘𝑥)))))
20		3anass 1094	. . 3 ⊢ ((𝐹:dom 𝐹⟶On ∧ Ord dom 𝐹 ∧ ∀𝑥 ∈ dom 𝐹∀𝑦 ∈ 𝑥 (𝐹‘𝑦) ∈ (𝐹‘𝑥)) ↔ (𝐹:dom 𝐹⟶On ∧ (Ord dom 𝐹 ∧ ∀𝑥 ∈ dom 𝐹∀𝑦 ∈ 𝑥 (𝐹‘𝑦) ∈ (𝐹‘𝑥))))
21	18, 19, 20	3bitr4i 303	. 2 ⊢ ((𝐹:dom 𝐹⟶On ∧ Ord dom 𝐹 ∧ ∀𝑦 ∈ dom 𝐹∀𝑥 ∈ dom 𝐹(𝑦 ∈ 𝑥 → (𝐹‘𝑦) ∈ (𝐹‘𝑥))) ↔ (𝐹:dom 𝐹⟶On ∧ Ord dom 𝐹 ∧ ∀𝑥 ∈ dom 𝐹∀𝑦 ∈ 𝑥 (𝐹‘𝑦) ∈ (𝐹‘𝑥)))
22	1, 21	bitri 275	1 ⊢ (Smo 𝐹 ↔ (𝐹:dom 𝐹⟶On ∧ Ord dom 𝐹 ∧ ∀𝑥 ∈ dom 𝐹∀𝑦 ∈ 𝑥 (𝐹‘𝑦) ∈ (𝐹‘𝑥)))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1086   ∈ wcel 2107  ∀wral 3050  dom cdm 5667  Ord word 6364  Oncon0 6365  ⟶wf 6538  ‘cfv 6542  Smo wsmo 8368

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1794  ax-4 1808  ax-5 1909  ax-6 1966  ax-7 2006  ax-8 2109  ax-9 2117  ax-11 2156  ax-ext 2706

This theorem depends on definitions:  df-bi 207  df-an 396  df-3an 1088  df-tru 1542  df-ex 1779  df-sb 2064  df-clab 2713  df-cleq 2726  df-clel 2808  df-ral 3051  df-v 3466  df-ss 3950  df-uni 4890  df-tr 5242  df-ord 6368  df-smo 8369

This theorem is referenced by:  issmo2  8372  smores2  8377  smofvon2  8379