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

Theorem dfwe2 7729
Description: Alternate definition of well-ordering. Definition 6.24(2) of [TakeutiZaring] p. 30. (Contributed by NM, 16-Mar-1997.) (Proof shortened by Andrew Salmon, 12-Aug-2011.)
Assertion
Ref Expression
dfwe2 (𝑅 We 𝐴 ↔ (𝑅 Fr 𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥𝑅𝑦𝑥 = 𝑦𝑦𝑅𝑥)))
Distinct variable groups:   𝑥,𝑦,𝑅   𝑥,𝐴,𝑦

Proof of Theorem dfwe2
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 df-we 5587 . 2 (𝑅 We 𝐴 ↔ (𝑅 Fr 𝐴𝑅 Or 𝐴))
2 df-so 5541 . . . 4 (𝑅 Or 𝐴 ↔ (𝑅 Po 𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥𝑅𝑦𝑥 = 𝑦𝑦𝑅𝑥)))
3 simpr 484 . . . . 5 ((𝑅 Po 𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥𝑅𝑦𝑥 = 𝑦𝑦𝑅𝑥)) → ∀𝑥𝐴𝑦𝐴 (𝑥𝑅𝑦𝑥 = 𝑦𝑦𝑅𝑥))
4 ax-1 6 . . . . . . . . . . . . . . 15 (𝑥𝑅𝑧 → ((𝑥𝑅𝑦𝑦𝑅𝑧) → 𝑥𝑅𝑧))
54a1i 11 . . . . . . . . . . . . . 14 ((𝑅 Fr 𝐴 ∧ (𝑥𝐴𝑦𝐴𝑧𝐴)) → (𝑥𝑅𝑧 → ((𝑥𝑅𝑦𝑦𝑅𝑧) → 𝑥𝑅𝑧)))
6 fr2nr 5609 . . . . . . . . . . . . . . . . 17 ((𝑅 Fr 𝐴 ∧ (𝑥𝐴𝑦𝐴)) → ¬ (𝑥𝑅𝑦𝑦𝑅𝑥))
763adantr3 1173 . . . . . . . . . . . . . . . 16 ((𝑅 Fr 𝐴 ∧ (𝑥𝐴𝑦𝐴𝑧𝐴)) → ¬ (𝑥𝑅𝑦𝑦𝑅𝑥))
8 breq2 5104 . . . . . . . . . . . . . . . . . 18 (𝑥 = 𝑧 → (𝑦𝑅𝑥𝑦𝑅𝑧))
98anbi2d 631 . . . . . . . . . . . . . . . . 17 (𝑥 = 𝑧 → ((𝑥𝑅𝑦𝑦𝑅𝑥) ↔ (𝑥𝑅𝑦𝑦𝑅𝑧)))
109notbid 318 . . . . . . . . . . . . . . . 16 (𝑥 = 𝑧 → (¬ (𝑥𝑅𝑦𝑦𝑅𝑥) ↔ ¬ (𝑥𝑅𝑦𝑦𝑅𝑧)))
117, 10syl5ibcom 245 . . . . . . . . . . . . . . 15 ((𝑅 Fr 𝐴 ∧ (𝑥𝐴𝑦𝐴𝑧𝐴)) → (𝑥 = 𝑧 → ¬ (𝑥𝑅𝑦𝑦𝑅𝑧)))
12 pm2.21 123 . . . . . . . . . . . . . . 15 (¬ (𝑥𝑅𝑦𝑦𝑅𝑧) → ((𝑥𝑅𝑦𝑦𝑅𝑧) → 𝑥𝑅𝑧))
1311, 12syl6 35 . . . . . . . . . . . . . 14 ((𝑅 Fr 𝐴 ∧ (𝑥𝐴𝑦𝐴𝑧𝐴)) → (𝑥 = 𝑧 → ((𝑥𝑅𝑦𝑦𝑅𝑧) → 𝑥𝑅𝑧)))
14 fr3nr 7727 . . . . . . . . . . . . . . . . 17 ((𝑅 Fr 𝐴 ∧ (𝑥𝐴𝑦𝐴𝑧𝐴)) → ¬ (𝑥𝑅𝑦𝑦𝑅𝑧𝑧𝑅𝑥))
15 df-3an 1089 . . . . . . . . . . . . . . . . . . 19 ((𝑥𝑅𝑦𝑦𝑅𝑧𝑧𝑅𝑥) ↔ ((𝑥𝑅𝑦𝑦𝑅𝑧) ∧ 𝑧𝑅𝑥))
1615biimpri 228 . . . . . . . . . . . . . . . . . 18 (((𝑥𝑅𝑦𝑦𝑅𝑧) ∧ 𝑧𝑅𝑥) → (𝑥𝑅𝑦𝑦𝑅𝑧𝑧𝑅𝑥))
1716ancoms 458 . . . . . . . . . . . . . . . . 17 ((𝑧𝑅𝑥 ∧ (𝑥𝑅𝑦𝑦𝑅𝑧)) → (𝑥𝑅𝑦𝑦𝑅𝑧𝑧𝑅𝑥))
1814, 17nsyl 140 . . . . . . . . . . . . . . . 16 ((𝑅 Fr 𝐴 ∧ (𝑥𝐴𝑦𝐴𝑧𝐴)) → ¬ (𝑧𝑅𝑥 ∧ (𝑥𝑅𝑦𝑦𝑅𝑧)))
1918pm2.21d 121 . . . . . . . . . . . . . . 15 ((𝑅 Fr 𝐴 ∧ (𝑥𝐴𝑦𝐴𝑧𝐴)) → ((𝑧𝑅𝑥 ∧ (𝑥𝑅𝑦𝑦𝑅𝑧)) → 𝑥𝑅𝑧))
2019expd 415 . . . . . . . . . . . . . 14 ((𝑅 Fr 𝐴 ∧ (𝑥𝐴𝑦𝐴𝑧𝐴)) → (𝑧𝑅𝑥 → ((𝑥𝑅𝑦𝑦𝑅𝑧) → 𝑥𝑅𝑧)))
215, 13, 203jaod 1432 . . . . . . . . . . . . 13 ((𝑅 Fr 𝐴 ∧ (𝑥𝐴𝑦𝐴𝑧𝐴)) → ((𝑥𝑅𝑧𝑥 = 𝑧𝑧𝑅𝑥) → ((𝑥𝑅𝑦𝑦𝑅𝑧) → 𝑥𝑅𝑧)))
22 frirr 5608 . . . . . . . . . . . . . 14 ((𝑅 Fr 𝐴𝑥𝐴) → ¬ 𝑥𝑅𝑥)
23223ad2antr1 1190 . . . . . . . . . . . . 13 ((𝑅 Fr 𝐴 ∧ (𝑥𝐴𝑦𝐴𝑧𝐴)) → ¬ 𝑥𝑅𝑥)
2421, 23jctild 525 . . . . . . . . . . . 12 ((𝑅 Fr 𝐴 ∧ (𝑥𝐴𝑦𝐴𝑧𝐴)) → ((𝑥𝑅𝑧𝑥 = 𝑧𝑧𝑅𝑥) → (¬ 𝑥𝑅𝑥 ∧ ((𝑥𝑅𝑦𝑦𝑅𝑧) → 𝑥𝑅𝑧))))
2524ex 412 . . . . . . . . . . 11 (𝑅 Fr 𝐴 → ((𝑥𝐴𝑦𝐴𝑧𝐴) → ((𝑥𝑅𝑧𝑥 = 𝑧𝑧𝑅𝑥) → (¬ 𝑥𝑅𝑥 ∧ ((𝑥𝑅𝑦𝑦𝑅𝑧) → 𝑥𝑅𝑧)))))
2625a2d 29 . . . . . . . . . 10 (𝑅 Fr 𝐴 → (((𝑥𝐴𝑦𝐴𝑧𝐴) → (𝑥𝑅𝑧𝑥 = 𝑧𝑧𝑅𝑥)) → ((𝑥𝐴𝑦𝐴𝑧𝐴) → (¬ 𝑥𝑅𝑥 ∧ ((𝑥𝑅𝑦𝑦𝑅𝑧) → 𝑥𝑅𝑧)))))
2726alimdv 1918 . . . . . . . . 9 (𝑅 Fr 𝐴 → (∀𝑧((𝑥𝐴𝑦𝐴𝑧𝐴) → (𝑥𝑅𝑧𝑥 = 𝑧𝑧𝑅𝑥)) → ∀𝑧((𝑥𝐴𝑦𝐴𝑧𝐴) → (¬ 𝑥𝑅𝑥 ∧ ((𝑥𝑅𝑦𝑦𝑅𝑧) → 𝑥𝑅𝑧)))))
28272alimdv 1920 . . . . . . . 8 (𝑅 Fr 𝐴 → (∀𝑥𝑦𝑧((𝑥𝐴𝑦𝐴𝑧𝐴) → (𝑥𝑅𝑧𝑥 = 𝑧𝑧𝑅𝑥)) → ∀𝑥𝑦𝑧((𝑥𝐴𝑦𝐴𝑧𝐴) → (¬ 𝑥𝑅𝑥 ∧ ((𝑥𝑅𝑦𝑦𝑅𝑧) → 𝑥𝑅𝑧)))))
29 r3al 3176 . . . . . . . 8 (∀𝑥𝐴𝑦𝐴𝑧𝐴 (𝑥𝑅𝑧𝑥 = 𝑧𝑧𝑅𝑥) ↔ ∀𝑥𝑦𝑧((𝑥𝐴𝑦𝐴𝑧𝐴) → (𝑥𝑅𝑧𝑥 = 𝑧𝑧𝑅𝑥)))
30 r3al 3176 . . . . . . . 8 (∀𝑥𝐴𝑦𝐴𝑧𝐴𝑥𝑅𝑥 ∧ ((𝑥𝑅𝑦𝑦𝑅𝑧) → 𝑥𝑅𝑧)) ↔ ∀𝑥𝑦𝑧((𝑥𝐴𝑦𝐴𝑧𝐴) → (¬ 𝑥𝑅𝑥 ∧ ((𝑥𝑅𝑦𝑦𝑅𝑧) → 𝑥𝑅𝑧))))
3128, 29, 303imtr4g 296 . . . . . . 7 (𝑅 Fr 𝐴 → (∀𝑥𝐴𝑦𝐴𝑧𝐴 (𝑥𝑅𝑧𝑥 = 𝑧𝑧𝑅𝑥) → ∀𝑥𝐴𝑦𝐴𝑧𝐴𝑥𝑅𝑥 ∧ ((𝑥𝑅𝑦𝑦𝑅𝑧) → 𝑥𝑅𝑧))))
32 breq2 5104 . . . . . . . . . . 11 (𝑦 = 𝑧 → (𝑥𝑅𝑦𝑥𝑅𝑧))
33 equequ2 2028 . . . . . . . . . . 11 (𝑦 = 𝑧 → (𝑥 = 𝑦𝑥 = 𝑧))
34 breq1 5103 . . . . . . . . . . 11 (𝑦 = 𝑧 → (𝑦𝑅𝑥𝑧𝑅𝑥))
3532, 33, 343orbi123d 1438 . . . . . . . . . 10 (𝑦 = 𝑧 → ((𝑥𝑅𝑦𝑥 = 𝑦𝑦𝑅𝑥) ↔ (𝑥𝑅𝑧𝑥 = 𝑧𝑧𝑅𝑥)))
3635ralidmw 4471 . . . . . . . . 9 (∀𝑦𝐴𝑦𝐴 (𝑥𝑅𝑦𝑥 = 𝑦𝑦𝑅𝑥) ↔ ∀𝑦𝐴 (𝑥𝑅𝑦𝑥 = 𝑦𝑦𝑅𝑥))
3735cbvralvw 3216 . . . . . . . . . 10 (∀𝑦𝐴 (𝑥𝑅𝑦𝑥 = 𝑦𝑦𝑅𝑥) ↔ ∀𝑧𝐴 (𝑥𝑅𝑧𝑥 = 𝑧𝑧𝑅𝑥))
3837ralbii 3084 . . . . . . . . 9 (∀𝑦𝐴𝑦𝐴 (𝑥𝑅𝑦𝑥 = 𝑦𝑦𝑅𝑥) ↔ ∀𝑦𝐴𝑧𝐴 (𝑥𝑅𝑧𝑥 = 𝑧𝑧𝑅𝑥))
3936, 38bitr3i 277 . . . . . . . 8 (∀𝑦𝐴 (𝑥𝑅𝑦𝑥 = 𝑦𝑦𝑅𝑥) ↔ ∀𝑦𝐴𝑧𝐴 (𝑥𝑅𝑧𝑥 = 𝑧𝑧𝑅𝑥))
4039ralbii 3084 . . . . . . 7 (∀𝑥𝐴𝑦𝐴 (𝑥𝑅𝑦𝑥 = 𝑦𝑦𝑅𝑥) ↔ ∀𝑥𝐴𝑦𝐴𝑧𝐴 (𝑥𝑅𝑧𝑥 = 𝑧𝑧𝑅𝑥))
41 df-po 5540 . . . . . . 7 (𝑅 Po 𝐴 ↔ ∀𝑥𝐴𝑦𝐴𝑧𝐴𝑥𝑅𝑥 ∧ ((𝑥𝑅𝑦𝑦𝑅𝑧) → 𝑥𝑅𝑧)))
4231, 40, 413imtr4g 296 . . . . . 6 (𝑅 Fr 𝐴 → (∀𝑥𝐴𝑦𝐴 (𝑥𝑅𝑦𝑥 = 𝑦𝑦𝑅𝑥) → 𝑅 Po 𝐴))
4342ancrd 551 . . . . 5 (𝑅 Fr 𝐴 → (∀𝑥𝐴𝑦𝐴 (𝑥𝑅𝑦𝑥 = 𝑦𝑦𝑅𝑥) → (𝑅 Po 𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥𝑅𝑦𝑥 = 𝑦𝑦𝑅𝑥))))
443, 43impbid2 226 . . . 4 (𝑅 Fr 𝐴 → ((𝑅 Po 𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥𝑅𝑦𝑥 = 𝑦𝑦𝑅𝑥)) ↔ ∀𝑥𝐴𝑦𝐴 (𝑥𝑅𝑦𝑥 = 𝑦𝑦𝑅𝑥)))
452, 44bitrid 283 . . 3 (𝑅 Fr 𝐴 → (𝑅 Or 𝐴 ↔ ∀𝑥𝐴𝑦𝐴 (𝑥𝑅𝑦𝑥 = 𝑦𝑦𝑅𝑥)))
4645pm5.32i 574 . 2 ((𝑅 Fr 𝐴𝑅 Or 𝐴) ↔ (𝑅 Fr 𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥𝑅𝑦𝑥 = 𝑦𝑦𝑅𝑥)))
471, 46bitri 275 1 (𝑅 We 𝐴 ↔ (𝑅 Fr 𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥𝑅𝑦𝑥 = 𝑦𝑦𝑅𝑥)))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 206  wa 395  w3o 1086  w3a 1087  wal 1540  wcel 2114  wral 3052   class class class wbr 5100   Po wpo 5538   Or wor 5539   Fr wfr 5582   We wwe 5584
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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-ext 2709  ax-sep 5243  ax-pr 5379  ax-un 7690
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-ne 2934  df-ral 3053  df-rex 3063  df-rab 3402  df-v 3444  df-dif 3906  df-un 3908  df-ss 3920  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-tp 4587  df-op 4589  df-uni 4866  df-br 5101  df-po 5540  df-so 5541  df-fr 5585  df-we 5587
This theorem is referenced by:  epweonALT  7731  f1oweALT  7926  dford2  9541  fpwwe2lem11  10564  fpwwe2lem12  10565  vonf1owev  35324  dfon2  36006  fnwe2  43410
  Copyright terms: Public domain W3C validator