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

Theorem onntri35 7560
Description: Double negated ordinal trichotomy.

There are five equivalent statements: (1) ¬ ¬ ∀𝑥 ∈ On∀𝑦 ∈ On(𝑥𝑦𝑥 = 𝑦𝑦𝑥), (2) ¬ ¬ ∀𝑥 ∈ On∀𝑦 ∈ On(𝑥𝑦𝑦𝑥), (3) 𝑥 ∈ On∀𝑦 ∈ On¬ ¬ (𝑥𝑦𝑥 = 𝑦𝑦𝑥), (4) 𝑥 ∈ On∀𝑦 ∈ On¬ ¬ (𝑥𝑦𝑦𝑥), and (5) ¬ ¬ EXMID. That these are all equivalent is expressed by (1) implies (3) (onntri13 7561), (3) implies (5) (onntri35 7560), (5) implies (1) (onntri51 7563), (2) implies (4) (onntri24 7565), (4) implies (5) (onntri45 7564), and (5) implies (2) (onntri52 7567).

Another way of stating this is that EXMID is equivalent to trichotomy, either the 𝑥𝑦𝑥 = 𝑦𝑦𝑥 or the 𝑥𝑦𝑦𝑥 form, as shown in exmidontri 7562 and exmidontri2or 7566, respectively. Thus ¬ ¬ EXMID is equivalent to (1) or (2). In addition, ¬ ¬ EXMID is equivalent to (3) by onntri3or 7568 and (4) by onntri2or 7569.

(Contributed by James E. Hanson and Jim Kingdon, 2-Aug-2024.)

Assertion
Ref Expression
onntri35 (∀𝑥 ∈ On ∀𝑦 ∈ On ¬ ¬ (𝑥𝑦𝑥 = 𝑦𝑦𝑥) → ¬ ¬ EXMID)
Distinct variable group:   𝑥,𝑦

Proof of Theorem onntri35
StepHypRef Expression
1 pw1on 7549 . . . . 5 𝒫 1o ∈ On
21onsuci 4643 . . . 4 suc 𝒫 1o ∈ On
3 3on 6671 . . . 4 3o ∈ On
4 eleq1 2297 . . . . . . . 8 (𝑥 = suc 𝒫 1o → (𝑥𝑦 ↔ suc 𝒫 1o𝑦))
5 eqeq1 2241 . . . . . . . 8 (𝑥 = suc 𝒫 1o → (𝑥 = 𝑦 ↔ suc 𝒫 1o = 𝑦))
6 eleq2 2298 . . . . . . . 8 (𝑥 = suc 𝒫 1o → (𝑦𝑥𝑦 ∈ suc 𝒫 1o))
74, 5, 63orbi123d 1348 . . . . . . 7 (𝑥 = suc 𝒫 1o → ((𝑥𝑦𝑥 = 𝑦𝑦𝑥) ↔ (suc 𝒫 1o𝑦 ∨ suc 𝒫 1o = 𝑦𝑦 ∈ suc 𝒫 1o)))
87notbid 673 . . . . . 6 (𝑥 = suc 𝒫 1o → (¬ (𝑥𝑦𝑥 = 𝑦𝑦𝑥) ↔ ¬ (suc 𝒫 1o𝑦 ∨ suc 𝒫 1o = 𝑦𝑦 ∈ suc 𝒫 1o)))
98notbid 673 . . . . 5 (𝑥 = suc 𝒫 1o → (¬ ¬ (𝑥𝑦𝑥 = 𝑦𝑦𝑥) ↔ ¬ ¬ (suc 𝒫 1o𝑦 ∨ suc 𝒫 1o = 𝑦𝑦 ∈ suc 𝒫 1o)))
10 eleq2 2298 . . . . . . . 8 (𝑦 = 3o → (suc 𝒫 1o𝑦 ↔ suc 𝒫 1o ∈ 3o))
11 eqeq2 2244 . . . . . . . 8 (𝑦 = 3o → (suc 𝒫 1o = 𝑦 ↔ suc 𝒫 1o = 3o))
12 eleq1 2297 . . . . . . . 8 (𝑦 = 3o → (𝑦 ∈ suc 𝒫 1o ↔ 3o ∈ suc 𝒫 1o))
1310, 11, 123orbi123d 1348 . . . . . . 7 (𝑦 = 3o → ((suc 𝒫 1o𝑦 ∨ suc 𝒫 1o = 𝑦𝑦 ∈ suc 𝒫 1o) ↔ (suc 𝒫 1o ∈ 3o ∨ suc 𝒫 1o = 3o ∨ 3o ∈ suc 𝒫 1o)))
1413notbid 673 . . . . . 6 (𝑦 = 3o → (¬ (suc 𝒫 1o𝑦 ∨ suc 𝒫 1o = 𝑦𝑦 ∈ suc 𝒫 1o) ↔ ¬ (suc 𝒫 1o ∈ 3o ∨ suc 𝒫 1o = 3o ∨ 3o ∈ suc 𝒫 1o)))
1514notbid 673 . . . . 5 (𝑦 = 3o → (¬ ¬ (suc 𝒫 1o𝑦 ∨ suc 𝒫 1o = 𝑦𝑦 ∈ suc 𝒫 1o) ↔ ¬ ¬ (suc 𝒫 1o ∈ 3o ∨ suc 𝒫 1o = 3o ∨ 3o ∈ suc 𝒫 1o)))
169, 15rspc2v 2937 . . . 4 ((suc 𝒫 1o ∈ On ∧ 3o ∈ On) → (∀𝑥 ∈ On ∀𝑦 ∈ On ¬ ¬ (𝑥𝑦𝑥 = 𝑦𝑦𝑥) → ¬ ¬ (suc 𝒫 1o ∈ 3o ∨ suc 𝒫 1o = 3o ∨ 3o ∈ suc 𝒫 1o)))
172, 3, 16mp2an 426 . . 3 (∀𝑥 ∈ On ∀𝑦 ∈ On ¬ ¬ (𝑥𝑦𝑥 = 𝑦𝑦𝑥) → ¬ ¬ (suc 𝒫 1o ∈ 3o ∨ suc 𝒫 1o = 3o ∨ 3o ∈ suc 𝒫 1o))
18 3ioran 1020 . . 3 (¬ (suc 𝒫 1o ∈ 3o ∨ suc 𝒫 1o = 3o ∨ 3o ∈ suc 𝒫 1o) ↔ (¬ suc 𝒫 1o ∈ 3o ∧ ¬ suc 𝒫 1o = 3o ∧ ¬ 3o ∈ suc 𝒫 1o))
1917, 18sylnib 683 . 2 (∀𝑥 ∈ On ∀𝑦 ∈ On ¬ ¬ (𝑥𝑦𝑥 = 𝑦𝑦𝑥) → ¬ (¬ suc 𝒫 1o ∈ 3o ∧ ¬ suc 𝒫 1o = 3o ∧ ¬ 3o ∈ suc 𝒫 1o))
20 sucpw1nel3 7556 . . . 4 ¬ suc 𝒫 1o ∈ 3o
2120a1i 9 . . 3 EXMID → ¬ suc 𝒫 1o ∈ 3o)
22 2on 6669 . . . . . . 7 2o ∈ On
23 suc11 4685 . . . . . . 7 ((𝒫 1o ∈ On ∧ 2o ∈ On) → (suc 𝒫 1o = suc 2o ↔ 𝒫 1o = 2o))
241, 22, 23mp2an 426 . . . . . 6 (suc 𝒫 1o = suc 2o ↔ 𝒫 1o = 2o)
25 df-3o 6662 . . . . . . 7 3o = suc 2o
2625eqeq2i 2245 . . . . . 6 (suc 𝒫 1o = 3o ↔ suc 𝒫 1o = suc 2o)
27 exmidpweq 7182 . . . . . 6 (EXMID ↔ 𝒫 1o = 2o)
2824, 26, 273bitr4ri 213 . . . . 5 (EXMID ↔ suc 𝒫 1o = 3o)
2928notbii 674 . . . 4 EXMID ↔ ¬ suc 𝒫 1o = 3o)
3029biimpi 120 . . 3 EXMID → ¬ suc 𝒫 1o = 3o)
31 3nelsucpw1 7557 . . . 4 ¬ 3o ∈ suc 𝒫 1o
3231a1i 9 . . 3 EXMID → ¬ 3o ∈ suc 𝒫 1o)
3321, 30, 323jca 1204 . 2 EXMID → (¬ suc 𝒫 1o ∈ 3o ∧ ¬ suc 𝒫 1o = 3o ∧ ¬ 3o ∈ suc 𝒫 1o))
3419, 33nsyl 633 1 (∀𝑥 ∈ On ∀𝑦 ∈ On ¬ ¬ (𝑥𝑦𝑥 = 𝑦𝑦𝑥) → ¬ ¬ EXMID)
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wb 105  w3o 1004  w3a 1005   = wceq 1398  wcel 2205  wral 2522  𝒫 cpw 3674  EXMIDwem 4312  Oncon0 4489  suc csuc 4491  1oc1o 6653  2oc2o 6654  3oc3o 6655
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-sep 4233  ax-nul 4241  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-setind 4664
This theorem depends on definitions:  df-bi 117  df-dc 843  df-3or 1006  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-ral 2527  df-rex 2528  df-v 2817  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-nul 3513  df-pw 3676  df-sn 3700  df-pr 3701  df-uni 3920  df-int 3955  df-tr 4214  df-exmid 4313  df-iord 4492  df-on 4494  df-suc 4497  df-iom 4718  df-1o 6660  df-2o 6661  df-3o 6662
This theorem is referenced by:  onntri3or  7568
  Copyright terms: Public domain W3C validator