Theorem smoeq 6561

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 19	. . . 4 ⊢ (𝐴 = 𝐵 → 𝐴 = 𝐵)
2		dmeq 4981	. . . 4 ⊢ (𝐴 = 𝐵 → dom 𝐴 = dom 𝐵)
3	1, 2	feq12d 5523	. . 3 ⊢ (𝐴 = 𝐵 → (𝐴:dom 𝐴⟶On ↔ 𝐵:dom 𝐵⟶On))
4		ordeq 4517	. . . 4 ⊢ (dom 𝐴 = dom 𝐵 → (Ord dom 𝐴 ↔ Ord dom 𝐵))
5	2, 4	syl 14	. . 3 ⊢ (𝐴 = 𝐵 → (Ord dom 𝐴 ↔ Ord dom 𝐵))
6		fveq1 5694	. . . . . . 7 ⊢ (𝐴 = 𝐵 → (𝐴‘𝑥) = (𝐵‘𝑥))
7		fveq1 5694	. . . . . . 7 ⊢ (𝐴 = 𝐵 → (𝐴‘𝑦) = (𝐵‘𝑦))
8	6, 7	eleq12d 2309	. . . . . 6 ⊢ (𝐴 = 𝐵 → ((𝐴‘𝑥) ∈ (𝐴‘𝑦) ↔ (𝐵‘𝑥) ∈ (𝐵‘𝑦)))
9	8	imbi2d 230	. . . . 5 ⊢ (𝐴 = 𝐵 → ((𝑥 ∈ 𝑦 → (𝐴‘𝑥) ∈ (𝐴‘𝑦)) ↔ (𝑥 ∈ 𝑦 → (𝐵‘𝑥) ∈ (𝐵‘𝑦))))
10	9	2ralbidv 2574	. . . 4 ⊢ (𝐴 = 𝐵 → (∀𝑥 ∈ dom 𝐴∀𝑦 ∈ dom 𝐴(𝑥 ∈ 𝑦 → (𝐴‘𝑥) ∈ (𝐴‘𝑦)) ↔ ∀𝑥 ∈ dom 𝐴∀𝑦 ∈ dom 𝐴(𝑥 ∈ 𝑦 → (𝐵‘𝑥) ∈ (𝐵‘𝑦))))
11	2	raleqdv 2755	. . . . 5 ⊢ (𝐴 = 𝐵 → (∀𝑦 ∈ dom 𝐴(𝑥 ∈ 𝑦 → (𝐵‘𝑥) ∈ (𝐵‘𝑦)) ↔ ∀𝑦 ∈ dom 𝐵(𝑥 ∈ 𝑦 → (𝐵‘𝑥) ∈ (𝐵‘𝑦))))
12	11	ralbidv 2550	. . . 4 ⊢ (𝐴 = 𝐵 → (∀𝑥 ∈ dom 𝐴∀𝑦 ∈ dom 𝐴(𝑥 ∈ 𝑦 → (𝐵‘𝑥) ∈ (𝐵‘𝑦)) ↔ ∀𝑥 ∈ dom 𝐴∀𝑦 ∈ dom 𝐵(𝑥 ∈ 𝑦 → (𝐵‘𝑥) ∈ (𝐵‘𝑦))))
13	2	raleqdv 2755	. . . 4 ⊢ (𝐴 = 𝐵 → (∀𝑥 ∈ dom 𝐴∀𝑦 ∈ dom 𝐵(𝑥 ∈ 𝑦 → (𝐵‘𝑥) ∈ (𝐵‘𝑦)) ↔ ∀𝑥 ∈ dom 𝐵∀𝑦 ∈ dom 𝐵(𝑥 ∈ 𝑦 → (𝐵‘𝑥) ∈ (𝐵‘𝑦))))
14	10, 12, 13	3bitrd 214	. . 3 ⊢ (𝐴 = 𝐵 → (∀𝑥 ∈ dom 𝐴∀𝑦 ∈ dom 𝐴(𝑥 ∈ 𝑦 → (𝐴‘𝑥) ∈ (𝐴‘𝑦)) ↔ ∀𝑥 ∈ dom 𝐵∀𝑦 ∈ dom 𝐵(𝑥 ∈ 𝑦 → (𝐵‘𝑥) ∈ (𝐵‘𝑦))))
15	3, 5, 14	3anbi123d 1353	. 2 ⊢ (𝐴 = 𝐵 → ((𝐴:dom 𝐴⟶On ∧ Ord dom 𝐴 ∧ ∀𝑥 ∈ dom 𝐴∀𝑦 ∈ dom 𝐴(𝑥 ∈ 𝑦 → (𝐴‘𝑥) ∈ (𝐴‘𝑦))) ↔ (𝐵:dom 𝐵⟶On ∧ Ord dom 𝐵 ∧ ∀𝑥 ∈ dom 𝐵∀𝑦 ∈ dom 𝐵(𝑥 ∈ 𝑦 → (𝐵‘𝑥) ∈ (𝐵‘𝑦)))))
16		df-smo 6557	. 2 ⊢ (Smo 𝐴 ↔ (𝐴:dom 𝐴⟶On ∧ Ord dom 𝐴 ∧ ∀𝑥 ∈ dom 𝐴∀𝑦 ∈ dom 𝐴(𝑥 ∈ 𝑦 → (𝐴‘𝑥) ∈ (𝐴‘𝑦))))
17		df-smo 6557	. 2 ⊢ (Smo 𝐵 ↔ (𝐵:dom 𝐵⟶On ∧ Ord dom 𝐵 ∧ ∀𝑥 ∈ dom 𝐵∀𝑦 ∈ dom 𝐵(𝑥 ∈ 𝑦 → (𝐵‘𝑥) ∈ (𝐵‘𝑦))))
18	15, 16, 17	3bitr4g 223	1 ⊢ (𝐴 = 𝐵 → (Smo 𝐴 ↔ Smo 𝐵))

This proof depends on syntax axioms:   → wi 4   ↔ wb 105   ∧ w3a 1009   = wceq 1402   ∈ wcel 2209  ∀wral 2528  Ord word 4507  Oncon0 4508  dom cdm 4774  ⟶wf 5373  ‘cfv 5377  Smo wsmo 6556

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-ext 2220

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-un 3224  df-in 3226  df-ss 3233  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4131  df-opab 4193  df-tr 4230  df-iord 4511  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-fv 5385  df-smo 6557

This theorem is used by:  smores3  6564  smo0  6569