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

Theorem dfwe2 7719
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 5579 . 2 (𝑅 We 𝐴 ↔ (𝑅 Fr 𝐴𝑅 Or 𝐴))
2 df-so 5533 . . . 4 (𝑅 Or 𝐴 ↔ (𝑅 Po 𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥𝑅𝑦𝑥 = 𝑦𝑦𝑅𝑥)))
3 simpr 484 . . . . 5 ((𝑅 Po 𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥𝑅𝑦𝑥 = 𝑦𝑦𝑅𝑥)) → ∀𝑥𝐴𝑦𝐴 (𝑥𝑅𝑦𝑥 = 𝑦𝑦𝑅𝑥))
4 ax-1 6 . . . . . . . . . . . . . . 15 (𝑥𝑅𝑧 → ((𝑥𝑅𝑦𝑦𝑅𝑧) → 𝑥𝑅𝑧))
54a1i 11 . . . . . . . . . . . . . 14 ((𝑅 Fr 𝐴 ∧ (𝑥𝐴𝑦𝐴𝑧𝐴)) → (𝑥𝑅𝑧 → ((𝑥𝑅𝑦𝑦𝑅𝑧) → 𝑥𝑅𝑧)))
6 fr2nr 5601 . . . . . . . . . . . . . . . . 17 ((𝑅 Fr 𝐴 ∧ (𝑥𝐴𝑦𝐴)) → ¬ (𝑥𝑅𝑦𝑦𝑅𝑥))
763adantr3 1172 . . . . . . . . . . . . . . . 16 ((𝑅 Fr 𝐴 ∧ (𝑥𝐴𝑦𝐴𝑧𝐴)) → ¬ (𝑥𝑅𝑦𝑦𝑅𝑥))
8 breq2 5102 . . . . . . . . . . . . . . . . . 18 (𝑥 = 𝑧 → (𝑦𝑅𝑥𝑦𝑅𝑧))
98anbi2d 630 . . . . . . . . . . . . . . . . 17 (𝑥 = 𝑧 → ((𝑥𝑅𝑦𝑦𝑅𝑥) ↔ (𝑥𝑅𝑦𝑦𝑅𝑧)))
109notbid 318 . . . . . . . . . . . . . . . 16 (𝑥 = 𝑧 → (¬ (𝑥𝑅𝑦𝑦𝑅𝑥) ↔ ¬ (𝑥𝑅𝑦𝑦𝑅𝑧)))
117, 10syl5ibcom 245 . . . . . . . . . . . . . . 15 ((𝑅 Fr 𝐴 ∧ (𝑥𝐴𝑦𝐴𝑧𝐴)) → (𝑥 = 𝑧 → ¬ (𝑥𝑅𝑦𝑦𝑅𝑧)))
12 pm2.21 123 . . . . . . . . . . . . . . 15 (¬ (𝑥𝑅𝑦𝑦𝑅𝑧) → ((𝑥𝑅𝑦𝑦𝑅𝑧) → 𝑥𝑅𝑧))
1311, 12syl6 35 . . . . . . . . . . . . . 14 ((𝑅 Fr 𝐴 ∧ (𝑥𝐴𝑦𝐴𝑧𝐴)) → (𝑥 = 𝑧 → ((𝑥𝑅𝑦𝑦𝑅𝑧) → 𝑥𝑅𝑧)))
14 fr3nr 7717 . . . . . . . . . . . . . . . . 17 ((𝑅 Fr 𝐴 ∧ (𝑥𝐴𝑦𝐴𝑧𝐴)) → ¬ (𝑥𝑅𝑦𝑦𝑅𝑧𝑧𝑅𝑥))
15 df-3an 1088 . . . . . . . . . . . . . . . . . . 19 ((𝑥𝑅𝑦𝑦𝑅𝑧𝑧𝑅𝑥) ↔ ((𝑥𝑅𝑦𝑦𝑅𝑧) ∧ 𝑧𝑅𝑥))
1615biimpri 228 . . . . . . . . . . . . . . . . . 18 (((𝑥𝑅𝑦𝑦𝑅𝑧) ∧ 𝑧𝑅𝑥) → (𝑥𝑅𝑦𝑦𝑅𝑧𝑧𝑅𝑥))
1716ancoms 458 . . . . . . . . . . . . . . . . 17 ((𝑧𝑅𝑥 ∧ (𝑥𝑅𝑦𝑦𝑅𝑧)) → (𝑥𝑅𝑦𝑦𝑅𝑧𝑧𝑅𝑥))
1814, 17nsyl 140 . . . . . . . . . . . . . . . 16 ((𝑅 Fr 𝐴 ∧ (𝑥𝐴𝑦𝐴𝑧𝐴)) → ¬ (𝑧𝑅𝑥 ∧ (𝑥𝑅𝑦𝑦𝑅𝑧)))
1918pm2.21d 121 . . . . . . . . . . . . . . 15 ((𝑅 Fr 𝐴 ∧ (𝑥𝐴𝑦𝐴𝑧𝐴)) → ((𝑧𝑅𝑥 ∧ (𝑥𝑅𝑦𝑦𝑅𝑧)) → 𝑥𝑅𝑧))
2019expd 415 . . . . . . . . . . . . . 14 ((𝑅 Fr 𝐴 ∧ (𝑥𝐴𝑦𝐴𝑧𝐴)) → (𝑧𝑅𝑥 → ((𝑥𝑅𝑦𝑦𝑅𝑧) → 𝑥𝑅𝑧)))
215, 13, 203jaod 1431 . . . . . . . . . . . . 13 ((𝑅 Fr 𝐴 ∧ (𝑥𝐴𝑦𝐴𝑧𝐴)) → ((𝑥𝑅𝑧𝑥 = 𝑧𝑧𝑅𝑥) → ((𝑥𝑅𝑦𝑦𝑅𝑧) → 𝑥𝑅𝑧)))
22 frirr 5600 . . . . . . . . . . . . . 14 ((𝑅 Fr 𝐴𝑥𝐴) → ¬ 𝑥𝑅𝑥)
23223ad2antr1 1189 . . . . . . . . . . . . 13 ((𝑅 Fr 𝐴 ∧ (𝑥𝐴𝑦𝐴𝑧𝐴)) → ¬ 𝑥𝑅𝑥)
2421, 23jctild 525 . . . . . . . . . . . 12 ((𝑅 Fr 𝐴 ∧ (𝑥𝐴𝑦𝐴𝑧𝐴)) → ((𝑥𝑅𝑧𝑥 = 𝑧𝑧𝑅𝑥) → (¬ 𝑥𝑅𝑥 ∧ ((𝑥𝑅𝑦𝑦𝑅𝑧) → 𝑥𝑅𝑧))))
2524ex 412 . . . . . . . . . . 11 (𝑅 Fr 𝐴 → ((𝑥𝐴𝑦𝐴𝑧𝐴) → ((𝑥𝑅𝑧𝑥 = 𝑧𝑧𝑅𝑥) → (¬ 𝑥𝑅𝑥 ∧ ((𝑥𝑅𝑦𝑦𝑅𝑧) → 𝑥𝑅𝑧)))))
2625a2d 29 . . . . . . . . . 10 (𝑅 Fr 𝐴 → (((𝑥𝐴𝑦𝐴𝑧𝐴) → (𝑥𝑅𝑧𝑥 = 𝑧𝑧𝑅𝑥)) → ((𝑥𝐴𝑦𝐴𝑧𝐴) → (¬ 𝑥𝑅𝑥 ∧ ((𝑥𝑅𝑦𝑦𝑅𝑧) → 𝑥𝑅𝑧)))))
2726alimdv 1917 . . . . . . . . 9 (𝑅 Fr 𝐴 → (∀𝑧((𝑥𝐴𝑦𝐴𝑧𝐴) → (𝑥𝑅𝑧𝑥 = 𝑧𝑧𝑅𝑥)) → ∀𝑧((𝑥𝐴𝑦𝐴𝑧𝐴) → (¬ 𝑥𝑅𝑥 ∧ ((𝑥𝑅𝑦𝑦𝑅𝑧) → 𝑥𝑅𝑧)))))
28272alimdv 1919 . . . . . . . 8 (𝑅 Fr 𝐴 → (∀𝑥𝑦𝑧((𝑥𝐴𝑦𝐴𝑧𝐴) → (𝑥𝑅𝑧𝑥 = 𝑧𝑧𝑅𝑥)) → ∀𝑥𝑦𝑧((𝑥𝐴𝑦𝐴𝑧𝐴) → (¬ 𝑥𝑅𝑥 ∧ ((𝑥𝑅𝑦𝑦𝑅𝑧) → 𝑥𝑅𝑧)))))
29 r3al 3174 . . . . . . . 8 (∀𝑥𝐴𝑦𝐴𝑧𝐴 (𝑥𝑅𝑧𝑥 = 𝑧𝑧𝑅𝑥) ↔ ∀𝑥𝑦𝑧((𝑥𝐴𝑦𝐴𝑧𝐴) → (𝑥𝑅𝑧𝑥 = 𝑧𝑧𝑅𝑥)))
30 r3al 3174 . . . . . . . 8 (∀𝑥𝐴𝑦𝐴𝑧𝐴𝑥𝑅𝑥 ∧ ((𝑥𝑅𝑦𝑦𝑅𝑧) → 𝑥𝑅𝑧)) ↔ ∀𝑥𝑦𝑧((𝑥𝐴𝑦𝐴𝑧𝐴) → (¬ 𝑥𝑅𝑥 ∧ ((𝑥𝑅𝑦𝑦𝑅𝑧) → 𝑥𝑅𝑧))))
3128, 29, 303imtr4g 296 . . . . . . 7 (𝑅 Fr 𝐴 → (∀𝑥𝐴𝑦𝐴𝑧𝐴 (𝑥𝑅𝑧𝑥 = 𝑧𝑧𝑅𝑥) → ∀𝑥𝐴𝑦𝐴𝑧𝐴𝑥𝑅𝑥 ∧ ((𝑥𝑅𝑦𝑦𝑅𝑧) → 𝑥𝑅𝑧))))
32 breq2 5102 . . . . . . . . . . 11 (𝑦 = 𝑧 → (𝑥𝑅𝑦𝑥𝑅𝑧))
33 equequ2 2027 . . . . . . . . . . 11 (𝑦 = 𝑧 → (𝑥 = 𝑦𝑥 = 𝑧))
34 breq1 5101 . . . . . . . . . . 11 (𝑦 = 𝑧 → (𝑦𝑅𝑥𝑧𝑅𝑥))
3532, 33, 343orbi123d 1437 . . . . . . . . . 10 (𝑦 = 𝑧 → ((𝑥𝑅𝑦𝑥 = 𝑦𝑦𝑅𝑥) ↔ (𝑥𝑅𝑧𝑥 = 𝑧𝑧𝑅𝑥)))
3635ralidmw 4469 . . . . . . . . 9 (∀𝑦𝐴𝑦𝐴 (𝑥𝑅𝑦𝑥 = 𝑦𝑦𝑅𝑥) ↔ ∀𝑦𝐴 (𝑥𝑅𝑦𝑥 = 𝑦𝑦𝑅𝑥))
3735cbvralvw 3214 . . . . . . . . . 10 (∀𝑦𝐴 (𝑥𝑅𝑦𝑥 = 𝑦𝑦𝑅𝑥) ↔ ∀𝑧𝐴 (𝑥𝑅𝑧𝑥 = 𝑧𝑧𝑅𝑥))
3837ralbii 3082 . . . . . . . . 9 (∀𝑦𝐴𝑦𝐴 (𝑥𝑅𝑦𝑥 = 𝑦𝑦𝑅𝑥) ↔ ∀𝑦𝐴𝑧𝐴 (𝑥𝑅𝑧𝑥 = 𝑧𝑧𝑅𝑥))
3936, 38bitr3i 277 . . . . . . . 8 (∀𝑦𝐴 (𝑥𝑅𝑦𝑥 = 𝑦𝑦𝑅𝑥) ↔ ∀𝑦𝐴𝑧𝐴 (𝑥𝑅𝑧𝑥 = 𝑧𝑧𝑅𝑥))
4039ralbii 3082 . . . . . . 7 (∀𝑥𝐴𝑦𝐴 (𝑥𝑅𝑦𝑥 = 𝑦𝑦𝑅𝑥) ↔ ∀𝑥𝐴𝑦𝐴𝑧𝐴 (𝑥𝑅𝑧𝑥 = 𝑧𝑧𝑅𝑥))
41 df-po 5532 . . . . . . 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 1085  w3a 1086  wal 1539  wcel 2113  wral 3051   class class class wbr 5098   Po wpo 5530   Or wor 5531   Fr wfr 5574   We wwe 5576
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-ext 2708  ax-sep 5241  ax-nul 5251  ax-pr 5377  ax-un 7680
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-sb 2068  df-clab 2715  df-cleq 2728  df-clel 2811  df-ne 2933  df-ral 3052  df-rex 3061  df-rab 3400  df-v 3442  df-dif 3904  df-un 3906  df-ss 3918  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4581  df-pr 4583  df-tp 4585  df-op 4587  df-uni 4864  df-br 5099  df-po 5532  df-so 5533  df-fr 5577  df-we 5579
This theorem is referenced by:  epweonALT  7721  f1oweALT  7916  dford2  9529  fpwwe2lem11  10552  fpwwe2lem12  10553  vonf1owev  35302  dfon2  35984  fnwe2  43295
  Copyright terms: Public domain W3C validator