Intuitionistic Logic Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  ILE Home  >  Th. List  >  dfsmo2 GIF version

Theorem dfsmo2 6193
 Description: Alternate definition of a strictly monotone ordinal function. (Contributed by Mario Carneiro, 4-Mar-2013.)
Assertion
Ref Expression
dfsmo2 (Smo 𝐹 ↔ (𝐹:dom 𝐹⟶On ∧ Ord dom 𝐹 ∧ ∀𝑥 ∈ dom 𝐹𝑦𝑥 (𝐹𝑦) ∈ (𝐹𝑥)))
Distinct variable group:   𝑥,𝐹,𝑦

Proof of Theorem dfsmo2
StepHypRef Expression
1 df-smo 6192 . 2 (Smo 𝐹 ↔ (𝐹:dom 𝐹⟶On ∧ Ord dom 𝐹 ∧ ∀𝑦 ∈ dom 𝐹𝑥 ∈ dom 𝐹(𝑦𝑥 → (𝐹𝑦) ∈ (𝐹𝑥))))
2 ralcom 2598 . . . . . 6 (∀𝑦 ∈ dom 𝐹𝑥 ∈ dom 𝐹(𝑦𝑥 → (𝐹𝑦) ∈ (𝐹𝑥)) ↔ ∀𝑥 ∈ dom 𝐹𝑦 ∈ dom 𝐹(𝑦𝑥 → (𝐹𝑦) ∈ (𝐹𝑥)))
3 impexp 261 . . . . . . . . 9 (((𝑦 ∈ dom 𝐹𝑦𝑥) → (𝐹𝑦) ∈ (𝐹𝑥)) ↔ (𝑦 ∈ dom 𝐹 → (𝑦𝑥 → (𝐹𝑦) ∈ (𝐹𝑥))))
4 simpr 109 . . . . . . . . . . 11 ((𝑦 ∈ dom 𝐹𝑦𝑥) → 𝑦𝑥)
5 ordtr1 4319 . . . . . . . . . . . . . . 15 (Ord dom 𝐹 → ((𝑦𝑥𝑥 ∈ dom 𝐹) → 𝑦 ∈ dom 𝐹))
653impib 1180 . . . . . . . . . . . . . 14 ((Ord dom 𝐹𝑦𝑥𝑥 ∈ dom 𝐹) → 𝑦 ∈ dom 𝐹)
763com23 1188 . . . . . . . . . . . . 13 ((Ord dom 𝐹𝑥 ∈ dom 𝐹𝑦𝑥) → 𝑦 ∈ dom 𝐹)
8 simp3 984 . . . . . . . . . . . . 13 ((Ord dom 𝐹𝑥 ∈ dom 𝐹𝑦𝑥) → 𝑦𝑥)
97, 8jca 304 . . . . . . . . . . . 12 ((Ord dom 𝐹𝑥 ∈ dom 𝐹𝑦𝑥) → (𝑦 ∈ dom 𝐹𝑦𝑥))
1093expia 1184 . . . . . . . . . . 11 ((Ord dom 𝐹𝑥 ∈ dom 𝐹) → (𝑦𝑥 → (𝑦 ∈ dom 𝐹𝑦𝑥)))
114, 10impbid2 142 . . . . . . . . . 10 ((Ord dom 𝐹𝑥 ∈ dom 𝐹) → ((𝑦 ∈ dom 𝐹𝑦𝑥) ↔ 𝑦𝑥))
1211imbi1d 230 . . . . . . . . 9 ((Ord dom 𝐹𝑥 ∈ dom 𝐹) → (((𝑦 ∈ dom 𝐹𝑦𝑥) → (𝐹𝑦) ∈ (𝐹𝑥)) ↔ (𝑦𝑥 → (𝐹𝑦) ∈ (𝐹𝑥))))
133, 12bitr3id 193 . . . . . . . 8 ((Ord dom 𝐹𝑥 ∈ dom 𝐹) → ((𝑦 ∈ dom 𝐹 → (𝑦𝑥 → (𝐹𝑦) ∈ (𝐹𝑥))) ↔ (𝑦𝑥 → (𝐹𝑦) ∈ (𝐹𝑥))))
1413ralbidv2 2441 . . . . . . 7 ((Ord dom 𝐹𝑥 ∈ dom 𝐹) → (∀𝑦 ∈ dom 𝐹(𝑦𝑥 → (𝐹𝑦) ∈ (𝐹𝑥)) ↔ ∀𝑦𝑥 (𝐹𝑦) ∈ (𝐹𝑥)))
1514ralbidva 2435 . . . . . 6 (Ord dom 𝐹 → (∀𝑥 ∈ dom 𝐹𝑦 ∈ dom 𝐹(𝑦𝑥 → (𝐹𝑦) ∈ (𝐹𝑥)) ↔ ∀𝑥 ∈ dom 𝐹𝑦𝑥 (𝐹𝑦) ∈ (𝐹𝑥)))
162, 15syl5bb 191 . . . . 5 (Ord dom 𝐹 → (∀𝑦 ∈ dom 𝐹𝑥 ∈ dom 𝐹(𝑦𝑥 → (𝐹𝑦) ∈ (𝐹𝑥)) ↔ ∀𝑥 ∈ dom 𝐹𝑦𝑥 (𝐹𝑦) ∈ (𝐹𝑥)))
1716pm5.32i 450 . . . 4 ((Ord dom 𝐹 ∧ ∀𝑦 ∈ dom 𝐹𝑥 ∈ dom 𝐹(𝑦𝑥 → (𝐹𝑦) ∈ (𝐹𝑥))) ↔ (Ord dom 𝐹 ∧ ∀𝑥 ∈ dom 𝐹𝑦𝑥 (𝐹𝑦) ∈ (𝐹𝑥)))
1817anbi2i 453 . . 3 ((𝐹:dom 𝐹⟶On ∧ (Ord dom 𝐹 ∧ ∀𝑦 ∈ dom 𝐹𝑥 ∈ dom 𝐹(𝑦𝑥 → (𝐹𝑦) ∈ (𝐹𝑥)))) ↔ (𝐹:dom 𝐹⟶On ∧ (Ord dom 𝐹 ∧ ∀𝑥 ∈ dom 𝐹𝑦𝑥 (𝐹𝑦) ∈ (𝐹𝑥))))
19 3anass 967 . . 3 ((𝐹:dom 𝐹⟶On ∧ Ord dom 𝐹 ∧ ∀𝑦 ∈ dom 𝐹𝑥 ∈ dom 𝐹(𝑦𝑥 → (𝐹𝑦) ∈ (𝐹𝑥))) ↔ (𝐹:dom 𝐹⟶On ∧ (Ord dom 𝐹 ∧ ∀𝑦 ∈ dom 𝐹𝑥 ∈ dom 𝐹(𝑦𝑥 → (𝐹𝑦) ∈ (𝐹𝑥)))))
20 3anass 967 . . 3 ((𝐹:dom 𝐹⟶On ∧ Ord dom 𝐹 ∧ ∀𝑥 ∈ dom 𝐹𝑦𝑥 (𝐹𝑦) ∈ (𝐹𝑥)) ↔ (𝐹:dom 𝐹⟶On ∧ (Ord dom 𝐹 ∧ ∀𝑥 ∈ dom 𝐹𝑦𝑥 (𝐹𝑦) ∈ (𝐹𝑥))))
2118, 19, 203bitr4i 211 . 2 ((𝐹:dom 𝐹⟶On ∧ Ord dom 𝐹 ∧ ∀𝑦 ∈ dom 𝐹𝑥 ∈ dom 𝐹(𝑦𝑥 → (𝐹𝑦) ∈ (𝐹𝑥))) ↔ (𝐹:dom 𝐹⟶On ∧ Ord dom 𝐹 ∧ ∀𝑥 ∈ dom 𝐹𝑦𝑥 (𝐹𝑦) ∈ (𝐹𝑥)))
221, 21bitri 183 1 (Smo 𝐹 ↔ (𝐹:dom 𝐹⟶On ∧ Ord dom 𝐹 ∧ ∀𝑥 ∈ dom 𝐹𝑦𝑥 (𝐹𝑦) ∈ (𝐹𝑥)))
 Colors of variables: wff set class Syntax hints:   → wi 4   ∧ wa 103   ↔ wb 104   ∧ w3a 963   ∈ wcel 1481  ∀wral 2417  Ord word 4293  Oncon0 4294  dom cdm 4548  ⟶wf 5128  ‘cfv 5132  Smo wsmo 6191 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 699  ax-5 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-10 1484  ax-11 1485  ax-i12 1486  ax-bndl 1487  ax-4 1488  ax-17 1507  ax-i9 1511  ax-ial 1515  ax-i5r 1516  ax-ext 2122 This theorem depends on definitions:  df-bi 116  df-3an 965  df-tru 1335  df-nf 1438  df-sb 1737  df-clab 2127  df-cleq 2133  df-clel 2136  df-nfc 2271  df-ral 2422  df-v 2692  df-in 3083  df-ss 3090  df-uni 3746  df-tr 4036  df-iord 4297  df-smo 6192 This theorem is referenced by:  issmo2  6195  smores2  6200  smofvon2dm  6202
 Copyright terms: Public domain W3C validator