Theorem issmo 6267

Description: Conditions for which 𝐴 is a strictly monotone ordinal function. (Contributed by Andrew Salmon, 15-Nov-2011.)

Hypotheses

Ref	Expression
issmo.1	⊢ 𝐴:𝐵⟶On
issmo.2	⊢ Ord 𝐵
issmo.3	⊢ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → (𝑥 ∈ 𝑦 → (𝐴‘𝑥) ∈ (𝐴‘𝑦)))
issmo.4	⊢ dom 𝐴 = 𝐵

Assertion

Ref	Expression
issmo	⊢ Smo 𝐴

Distinct variable group:   𝑥,𝑦,𝐴

Allowed substitution hints:   𝐵(𝑥,𝑦)

Proof of Theorem issmo

Step	Hyp	Ref	Expression
1		issmo.1	. . 3 ⊢ 𝐴:𝐵⟶On
2		issmo.4	. . . 4 ⊢ dom 𝐴 = 𝐵
3	2	feq2i 5341	. . 3 ⊢ (𝐴:dom 𝐴⟶On ↔ 𝐴:𝐵⟶On)
4	1, 3	mpbir 145	. 2 ⊢ 𝐴:dom 𝐴⟶On
5		issmo.2	. . 3 ⊢ Ord 𝐵
6		ordeq 4357	. . . 4 ⊢ (dom 𝐴 = 𝐵 → (Ord dom 𝐴 ↔ Ord 𝐵))
7	2, 6	ax-mp 5	. . 3 ⊢ (Ord dom 𝐴 ↔ Ord 𝐵)
8	5, 7	mpbir 145	. 2 ⊢ Ord dom 𝐴
9	2	eleq2i 2237	. . . 4 ⊢ (𝑥 ∈ dom 𝐴 ↔ 𝑥 ∈ 𝐵)
10	2	eleq2i 2237	. . . 4 ⊢ (𝑦 ∈ dom 𝐴 ↔ 𝑦 ∈ 𝐵)
11		issmo.3	. . . 4 ⊢ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → (𝑥 ∈ 𝑦 → (𝐴‘𝑥) ∈ (𝐴‘𝑦)))
12	9, 10, 11	syl2anb 289	. . 3 ⊢ ((𝑥 ∈ dom 𝐴 ∧ 𝑦 ∈ dom 𝐴) → (𝑥 ∈ 𝑦 → (𝐴‘𝑥) ∈ (𝐴‘𝑦)))
13	12	rgen2a 2524	. 2 ⊢ ∀𝑥 ∈ dom 𝐴∀𝑦 ∈ dom 𝐴(𝑥 ∈ 𝑦 → (𝐴‘𝑥) ∈ (𝐴‘𝑦))
14		df-smo 6265	. 2 ⊢ (Smo 𝐴 ↔ (𝐴:dom 𝐴⟶On ∧ Ord dom 𝐴 ∧ ∀𝑥 ∈ dom 𝐴∀𝑦 ∈ dom 𝐴(𝑥 ∈ 𝑦 → (𝐴‘𝑥) ∈ (𝐴‘𝑦))))
15	4, 8, 13, 14	mpbir3an 1174	1 ⊢ Smo 𝐴

Syntax hints:   → wi 4   ∧ wa 103   ↔ wb 104   = wceq 1348   ∈ wcel 2141  ∀wral 2448  Ord word 4347  Oncon0 4348  dom cdm 4611  ⟶wf 5194  ‘cfv 5198  Smo wsmo 6264

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-ext 2152

This theorem depends on definitions:  df-bi 116  df-3an 975  df-tru 1351  df-nf 1454  df-sb 1756  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ral 2453  df-rex 2454  df-in 3127  df-ss 3134  df-uni 3797  df-tr 4088  df-iord 4351  df-fn 5201  df-f 5202  df-smo 6265

This theorem is referenced by:  iordsmo  6276