Theorem issmo 8359

Description: Conditions for which 𝐴 is a strictly monotone ordinal function. (Contributed by Andrew Salmon, 15-Nov-2011.) Avoid ax-13 2401. (Revised by GG, 19-May-2023.)

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 6701	. . 3 ⊢ (𝐴:dom 𝐴⟶On ↔ 𝐴:𝐵⟶On)
4	1, 3	mpbir 234	. 2 ⊢ 𝐴:dom 𝐴⟶On
5		issmo.2	. . 3 ⊢ Ord 𝐵
6		ordeq 6369	. . . 4 ⊢ (dom 𝐴 = 𝐵 → (Ord dom 𝐴 ↔ Ord 𝐵))
7	2, 6	ax-mp 5	. . 3 ⊢ (Ord dom 𝐴 ↔ Ord 𝐵)
8	5, 7	mpbir 234	. 2 ⊢ Ord dom 𝐴
9	2	eleq2i 2852	. . . 4 ⊢ (𝑥 ∈ dom 𝐴 ↔ 𝑥 ∈ 𝐵)
10	2	eleq2i 2852	. . . 4 ⊢ (𝑦 ∈ dom 𝐴 ↔ 𝑦 ∈ 𝐵)
11		issmo.3	. . . 4 ⊢ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → (𝑥 ∈ 𝑦 → (𝐴‘𝑥) ∈ (𝐴‘𝑦)))
12	9, 10, 11	syl2anb 610	. . 3 ⊢ ((𝑥 ∈ dom 𝐴 ∧ 𝑦 ∈ dom 𝐴) → (𝑥 ∈ 𝑦 → (𝐴‘𝑥) ∈ (𝐴‘𝑦)))
13	12	rgen2 3202	. 2 ⊢ ∀𝑥 ∈ dom 𝐴∀𝑦 ∈ dom 𝐴(𝑥 ∈ 𝑦 → (𝐴‘𝑥) ∈ (𝐴‘𝑦))
14		df-smo 8357	. 2 ⊢ (Smo 𝐴 ↔ (𝐴:dom 𝐴⟶On ∧ Ord dom 𝐴 ∧ ∀𝑥 ∈ dom 𝐴∀𝑦 ∈ dom 𝐴(𝑥 ∈ 𝑦 → (𝐴‘𝑥) ∈ (𝐴‘𝑦))))
15	4, 8, 13, 14	mpbir3an 1360	1 ⊢ Smo 𝐴

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1569   ∈ wcel 2144  ∀wral 3076  dom cdm 5650  Ord word 6361  Oncon0 6362  ⟶wf 6534  ‘cfv 6538  Smo wsmo 8356

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732

This proof depends on definitions:  df-bi 210  df-an 402  df-3an 1105  df-tru 1572  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-v 3452  df-ss 3896  df-uni 4867  df-tr 5212  df-po 5558  df-so 5559  df-fr 5603  df-we 5605  df-ord 6365  df-fn 6541  df-f 6542  df-smo 8357

This theorem is used by:  iordsmo  8368  smobeth  10674  j00smo  35944