Theorem smoeq 8366

Description: Equality theorem for strictly monotone functions. (Contributed by Andrew Salmon, 16-Nov-2011.)

Assertion

Ref	Expression
smoeq	⊢ (𝐴 = 𝐵 → (Smo 𝐴 ↔ Smo 𝐵))

Proof of Theorem smoeq

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		id 23	. . . 4 ⊢ (𝐴 = 𝐵 → 𝐴 = 𝐵)
2		dmeq 5886	. . . 4 ⊢ (𝐴 = 𝐵 → dom 𝐴 = dom 𝐵)
3	1, 2	feq12d 6702	. . 3 ⊢ (𝐴 = 𝐵 → (𝐴:dom 𝐴⟶On ↔ 𝐵:dom 𝐵⟶On))
4		ordeq 6372	. . . 4 ⊢ (dom 𝐴 = dom 𝐵 → (Ord dom 𝐴 ↔ Ord dom 𝐵))
5	2, 4	syl 18	. . 3 ⊢ (𝐴 = 𝐵 → (Ord dom 𝐴 ↔ Ord dom 𝐵))
6		fveq1 6889	. . . . . . 7 ⊢ (𝐴 = 𝐵 → (𝐴‘𝑥) = (𝐵‘𝑥))
7		fveq1 6889	. . . . . . 7 ⊢ (𝐴 = 𝐵 → (𝐴‘𝑦) = (𝐵‘𝑦))
8	6, 7	eleq12d 2854	. . . . . 6 ⊢ (𝐴 = 𝐵 → ((𝐴‘𝑥) ∈ (𝐴‘𝑦) ↔ (𝐵‘𝑥) ∈ (𝐵‘𝑦)))
9	8	imbi2d 343	. . . . 5 ⊢ (𝐴 = 𝐵 → ((𝑥 ∈ 𝑦 → (𝐴‘𝑥) ∈ (𝐴‘𝑦)) ↔ (𝑥 ∈ 𝑦 → (𝐵‘𝑥) ∈ (𝐵‘𝑦))))
10	9	2ralbidv 3226	. . . 4 ⊢ (𝐴 = 𝐵 → (∀𝑥 ∈ dom 𝐴∀𝑦 ∈ dom 𝐴(𝑥 ∈ 𝑦 → (𝐴‘𝑥) ∈ (𝐴‘𝑦)) ↔ ∀𝑥 ∈ dom 𝐴∀𝑦 ∈ dom 𝐴(𝑥 ∈ 𝑦 → (𝐵‘𝑥) ∈ (𝐵‘𝑦))))
11	2	raleqdv 3319	. . . . 5 ⊢ (𝐴 = 𝐵 → (∀𝑦 ∈ dom 𝐴(𝑥 ∈ 𝑦 → (𝐵‘𝑥) ∈ (𝐵‘𝑦)) ↔ ∀𝑦 ∈ dom 𝐵(𝑥 ∈ 𝑦 → (𝐵‘𝑥) ∈ (𝐵‘𝑦))))
12	11	ralbidv 3185	. . . 4 ⊢ (𝐴 = 𝐵 → (∀𝑥 ∈ dom 𝐴∀𝑦 ∈ dom 𝐴(𝑥 ∈ 𝑦 → (𝐵‘𝑥) ∈ (𝐵‘𝑦)) ↔ ∀𝑥 ∈ dom 𝐴∀𝑦 ∈ dom 𝐵(𝑥 ∈ 𝑦 → (𝐵‘𝑥) ∈ (𝐵‘𝑦))))
13	2	raleqdv 3319	. . . 4 ⊢ (𝐴 = 𝐵 → (∀𝑥 ∈ dom 𝐴∀𝑦 ∈ dom 𝐵(𝑥 ∈ 𝑦 → (𝐵‘𝑥) ∈ (𝐵‘𝑦)) ↔ ∀𝑥 ∈ dom 𝐵∀𝑦 ∈ dom 𝐵(𝑥 ∈ 𝑦 → (𝐵‘𝑥) ∈ (𝐵‘𝑦))))
14	10, 12, 13	3bitrd 308	. . 3 ⊢ (𝐴 = 𝐵 → (∀𝑥 ∈ dom 𝐴∀𝑦 ∈ dom 𝐴(𝑥 ∈ 𝑦 → (𝐴‘𝑥) ∈ (𝐴‘𝑦)) ↔ ∀𝑥 ∈ dom 𝐵∀𝑦 ∈ dom 𝐵(𝑥 ∈ 𝑦 → (𝐵‘𝑥) ∈ (𝐵‘𝑦))))
15	3, 5, 14	3anbi123d 1464	. 2 ⊢ (𝐴 = 𝐵 → ((𝐴:dom 𝐴⟶On ∧ Ord dom 𝐴 ∧ ∀𝑥 ∈ dom 𝐴∀𝑦 ∈ dom 𝐴(𝑥 ∈ 𝑦 → (𝐴‘𝑥) ∈ (𝐴‘𝑦))) ↔ (𝐵:dom 𝐵⟶On ∧ Ord dom 𝐵 ∧ ∀𝑥 ∈ dom 𝐵∀𝑦 ∈ dom 𝐵(𝑥 ∈ 𝑦 → (𝐵‘𝑥) ∈ (𝐵‘𝑦)))))
16		df-smo 8362	. 2 ⊢ (Smo 𝐴 ↔ (𝐴:dom 𝐴⟶On ∧ Ord dom 𝐴 ∧ ∀𝑥 ∈ dom 𝐴∀𝑦 ∈ dom 𝐴(𝑥 ∈ 𝑦 → (𝐴‘𝑥) ∈ (𝐴‘𝑦))))
17		df-smo 8362	. 2 ⊢ (Smo 𝐵 ↔ (𝐵:dom 𝐵⟶On ∧ Ord dom 𝐵 ∧ ∀𝑥 ∈ dom 𝐵∀𝑦 ∈ dom 𝐵(𝑥 ∈ 𝑦 → (𝐵‘𝑥) ∈ (𝐵‘𝑦))))
18	15, 16, 17	3bitr4g 317	1 ⊢ (𝐴 = 𝐵 → (Smo 𝐴 ↔ Smo 𝐵))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ w3a 1103   = wceq 1569   ∈ wcel 2144  ∀wral 3076  dom cdm 5651  Ord word 6364  Oncon0 6365  ⟶wf 6539  ‘cfv 6543  Smo wsmo 8361

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-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3897  df-dif 4046  df-un 4150  df-nul 4278  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-opab 5167  df-tr 5212  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-ord 6368  df-iota 6497  df-fun 6545  df-fn 6546  df-f 6547  df-fv 6551  df-smo 8362

This theorem is used by:  smores3  8369  smo0  8374  cofsmo  10354  cfsmolem  10355  alephsing  10361