Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  smoeq Structured version   Visualization version   GIF version

Theorem smoeq 8002
 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.
StepHypRef Expression
1 id 22 . . . 4 (𝐴 = 𝐵𝐴 = 𝐵)
2 dmeq 5748 . . . 4 (𝐴 = 𝐵 → dom 𝐴 = dom 𝐵)
31, 2feq12d 6490 . . 3 (𝐴 = 𝐵 → (𝐴:dom 𝐴⟶On ↔ 𝐵:dom 𝐵⟶On))
4 ordeq 6180 . . . 4 (dom 𝐴 = dom 𝐵 → (Ord dom 𝐴 ↔ Ord dom 𝐵))
52, 4syl 17 . . 3 (𝐴 = 𝐵 → (Ord dom 𝐴 ↔ Ord dom 𝐵))
6 fveq1 6661 . . . . . . 7 (𝐴 = 𝐵 → (𝐴𝑥) = (𝐵𝑥))
7 fveq1 6661 . . . . . . 7 (𝐴 = 𝐵 → (𝐴𝑦) = (𝐵𝑦))
86, 7eleq12d 2846 . . . . . 6 (𝐴 = 𝐵 → ((𝐴𝑥) ∈ (𝐴𝑦) ↔ (𝐵𝑥) ∈ (𝐵𝑦)))
98imbi2d 344 . . . . 5 (𝐴 = 𝐵 → ((𝑥𝑦 → (𝐴𝑥) ∈ (𝐴𝑦)) ↔ (𝑥𝑦 → (𝐵𝑥) ∈ (𝐵𝑦))))
1092ralbidv 3128 . . . 4 (𝐴 = 𝐵 → (∀𝑥 ∈ dom 𝐴𝑦 ∈ dom 𝐴(𝑥𝑦 → (𝐴𝑥) ∈ (𝐴𝑦)) ↔ ∀𝑥 ∈ dom 𝐴𝑦 ∈ dom 𝐴(𝑥𝑦 → (𝐵𝑥) ∈ (𝐵𝑦))))
112raleqdv 3329 . . . . 5 (𝐴 = 𝐵 → (∀𝑦 ∈ dom 𝐴(𝑥𝑦 → (𝐵𝑥) ∈ (𝐵𝑦)) ↔ ∀𝑦 ∈ dom 𝐵(𝑥𝑦 → (𝐵𝑥) ∈ (𝐵𝑦))))
1211ralbidv 3126 . . . 4 (𝐴 = 𝐵 → (∀𝑥 ∈ dom 𝐴𝑦 ∈ dom 𝐴(𝑥𝑦 → (𝐵𝑥) ∈ (𝐵𝑦)) ↔ ∀𝑥 ∈ dom 𝐴𝑦 ∈ dom 𝐵(𝑥𝑦 → (𝐵𝑥) ∈ (𝐵𝑦))))
132raleqdv 3329 . . . 4 (𝐴 = 𝐵 → (∀𝑥 ∈ dom 𝐴𝑦 ∈ dom 𝐵(𝑥𝑦 → (𝐵𝑥) ∈ (𝐵𝑦)) ↔ ∀𝑥 ∈ dom 𝐵𝑦 ∈ dom 𝐵(𝑥𝑦 → (𝐵𝑥) ∈ (𝐵𝑦))))
1410, 12, 133bitrd 308 . . 3 (𝐴 = 𝐵 → (∀𝑥 ∈ dom 𝐴𝑦 ∈ dom 𝐴(𝑥𝑦 → (𝐴𝑥) ∈ (𝐴𝑦)) ↔ ∀𝑥 ∈ dom 𝐵𝑦 ∈ dom 𝐵(𝑥𝑦 → (𝐵𝑥) ∈ (𝐵𝑦))))
153, 5, 143anbi123d 1433 . 2 (𝐴 = 𝐵 → ((𝐴:dom 𝐴⟶On ∧ Ord dom 𝐴 ∧ ∀𝑥 ∈ dom 𝐴𝑦 ∈ dom 𝐴(𝑥𝑦 → (𝐴𝑥) ∈ (𝐴𝑦))) ↔ (𝐵:dom 𝐵⟶On ∧ Ord dom 𝐵 ∧ ∀𝑥 ∈ dom 𝐵𝑦 ∈ dom 𝐵(𝑥𝑦 → (𝐵𝑥) ∈ (𝐵𝑦)))))
16 df-smo 7998 . 2 (Smo 𝐴 ↔ (𝐴:dom 𝐴⟶On ∧ Ord dom 𝐴 ∧ ∀𝑥 ∈ dom 𝐴𝑦 ∈ dom 𝐴(𝑥𝑦 → (𝐴𝑥) ∈ (𝐴𝑦))))
17 df-smo 7998 . 2 (Smo 𝐵 ↔ (𝐵:dom 𝐵⟶On ∧ Ord dom 𝐵 ∧ ∀𝑥 ∈ dom 𝐵𝑦 ∈ dom 𝐵(𝑥𝑦 → (𝐵𝑥) ∈ (𝐵𝑦))))
1815, 16, 173bitr4g 317 1 (𝐴 = 𝐵 → (Smo 𝐴 ↔ Smo 𝐵))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 209   ∧ w3a 1084   = wceq 1538   ∈ wcel 2111  ∀wral 3070  dom cdm 5527  Ord word 6172  Oncon0 6173  ⟶wf 6335  ‘cfv 6339  Smo wsmo 7997 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-ext 2729 This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-sb 2070  df-clab 2736  df-cleq 2750  df-clel 2830  df-ral 3075  df-v 3411  df-un 3865  df-in 3867  df-ss 3877  df-sn 4526  df-pr 4528  df-op 4532  df-uni 4802  df-br 5036  df-opab 5098  df-tr 5142  df-po 5446  df-so 5447  df-fr 5486  df-we 5488  df-rel 5534  df-cnv 5535  df-co 5536  df-dm 5537  df-rn 5538  df-ord 6176  df-iota 6298  df-fun 6341  df-fn 6342  df-f 6343  df-fv 6347  df-smo 7998 This theorem is referenced by:  smores3  8005  smo0  8010  cofsmo  9734  cfsmolem  9735  alephsing  9741
 Copyright terms: Public domain W3C validator