Theorem issmo 8367

Description: Conditions for which 𝐴 is a strictly monotone ordinal function. (Contributed by Andrew Salmon, 15-Nov-2011.) Avoid ax-13 2377. (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 6703	. . 3 ⊢ (𝐴:dom 𝐴⟶On ↔ 𝐴:𝐵⟶On)
4	1, 3	mpbir 231	. 2 ⊢ 𝐴:dom 𝐴⟶On
5		issmo.2	. . 3 ⊢ Ord 𝐵
6		ordeq 6364	. . . 4 ⊢ (dom 𝐴 = 𝐵 → (Ord dom 𝐴 ↔ Ord 𝐵))
7	2, 6	ax-mp 5	. . 3 ⊢ (Ord dom 𝐴 ↔ Ord 𝐵)
8	5, 7	mpbir 231	. 2 ⊢ Ord dom 𝐴
9	2	eleq2i 2827	. . . 4 ⊢ (𝑥 ∈ dom 𝐴 ↔ 𝑥 ∈ 𝐵)
10	2	eleq2i 2827	. . . 4 ⊢ (𝑦 ∈ dom 𝐴 ↔ 𝑦 ∈ 𝐵)
11		issmo.3	. . . 4 ⊢ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → (𝑥 ∈ 𝑦 → (𝐴‘𝑥) ∈ (𝐴‘𝑦)))
12	9, 10, 11	syl2anb 598	. . 3 ⊢ ((𝑥 ∈ dom 𝐴 ∧ 𝑦 ∈ dom 𝐴) → (𝑥 ∈ 𝑦 → (𝐴‘𝑥) ∈ (𝐴‘𝑦)))
13	12	rgen2 3185	. 2 ⊢ ∀𝑥 ∈ dom 𝐴∀𝑦 ∈ dom 𝐴(𝑥 ∈ 𝑦 → (𝐴‘𝑥) ∈ (𝐴‘𝑦))
14		df-smo 8365	. 2 ⊢ (Smo 𝐴 ↔ (𝐴:dom 𝐴⟶On ∧ Ord dom 𝐴 ∧ ∀𝑥 ∈ dom 𝐴∀𝑦 ∈ dom 𝐴(𝑥 ∈ 𝑦 → (𝐴‘𝑥) ∈ (𝐴‘𝑦))))
15	4, 8, 13, 14	mpbir3an 1342	1 ⊢ Smo 𝐴

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1540   ∈ wcel 2109  ∀wral 3052  dom cdm 5659  Ord word 6356  Oncon0 6357  ⟶wf 6532  ‘cfv 6536  Smo wsmo 8364

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-ext 2708

This theorem depends on definitions:  df-bi 207  df-an 396  df-3an 1088  df-tru 1543  df-ex 1780  df-sb 2066  df-clab 2715  df-cleq 2728  df-clel 2810  df-ral 3053  df-v 3466  df-ss 3948  df-uni 4889  df-tr 5235  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  df-ord 6360  df-fn 6539  df-f 6540  df-smo 8365

This theorem is referenced by:  iordsmo  8376  smobeth  10605