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

Theorem onntri45 7308
Description: Double negated ordinal trichotomy. (Contributed by James E. Hanson and Jim Kingdon, 2-Aug-2024.)
Assertion
Ref Expression
onntri45 (∀𝑥 ∈ On ∀𝑦 ∈ On ¬ ¬ (𝑥𝑦𝑦𝑥) → ¬ ¬ EXMID)
Distinct variable group:   𝑥,𝑦

Proof of Theorem onntri45
StepHypRef Expression
1 pw1on 7293 . . . . 5 𝒫 1o ∈ On
21onsuci 4552 . . . 4 suc 𝒫 1o ∈ On
3 3on 6485 . . . 4 3o ∈ On
4 sseq1 3206 . . . . . . . 8 (𝑥 = suc 𝒫 1o → (𝑥𝑦 ↔ suc 𝒫 1o𝑦))
5 sseq2 3207 . . . . . . . 8 (𝑥 = suc 𝒫 1o → (𝑦𝑥𝑦 ⊆ suc 𝒫 1o))
64, 5orbi12d 794 . . . . . . 7 (𝑥 = suc 𝒫 1o → ((𝑥𝑦𝑦𝑥) ↔ (suc 𝒫 1o𝑦𝑦 ⊆ suc 𝒫 1o)))
76notbid 668 . . . . . 6 (𝑥 = suc 𝒫 1o → (¬ (𝑥𝑦𝑦𝑥) ↔ ¬ (suc 𝒫 1o𝑦𝑦 ⊆ suc 𝒫 1o)))
87notbid 668 . . . . 5 (𝑥 = suc 𝒫 1o → (¬ ¬ (𝑥𝑦𝑦𝑥) ↔ ¬ ¬ (suc 𝒫 1o𝑦𝑦 ⊆ suc 𝒫 1o)))
9 sseq2 3207 . . . . . . . 8 (𝑦 = 3o → (suc 𝒫 1o𝑦 ↔ suc 𝒫 1o ⊆ 3o))
10 sseq1 3206 . . . . . . . 8 (𝑦 = 3o → (𝑦 ⊆ suc 𝒫 1o ↔ 3o ⊆ suc 𝒫 1o))
119, 10orbi12d 794 . . . . . . 7 (𝑦 = 3o → ((suc 𝒫 1o𝑦𝑦 ⊆ suc 𝒫 1o) ↔ (suc 𝒫 1o ⊆ 3o ∨ 3o ⊆ suc 𝒫 1o)))
1211notbid 668 . . . . . 6 (𝑦 = 3o → (¬ (suc 𝒫 1o𝑦𝑦 ⊆ suc 𝒫 1o) ↔ ¬ (suc 𝒫 1o ⊆ 3o ∨ 3o ⊆ suc 𝒫 1o)))
1312notbid 668 . . . . 5 (𝑦 = 3o → (¬ ¬ (suc 𝒫 1o𝑦𝑦 ⊆ suc 𝒫 1o) ↔ ¬ ¬ (suc 𝒫 1o ⊆ 3o ∨ 3o ⊆ suc 𝒫 1o)))
148, 13rspc2v 2881 . . . 4 ((suc 𝒫 1o ∈ On ∧ 3o ∈ On) → (∀𝑥 ∈ On ∀𝑦 ∈ On ¬ ¬ (𝑥𝑦𝑦𝑥) → ¬ ¬ (suc 𝒫 1o ⊆ 3o ∨ 3o ⊆ suc 𝒫 1o)))
152, 3, 14mp2an 426 . . 3 (∀𝑥 ∈ On ∀𝑦 ∈ On ¬ ¬ (𝑥𝑦𝑦𝑥) → ¬ ¬ (suc 𝒫 1o ⊆ 3o ∨ 3o ⊆ suc 𝒫 1o))
16 ioran 753 . . 3 (¬ (suc 𝒫 1o ⊆ 3o ∨ 3o ⊆ suc 𝒫 1o) ↔ (¬ suc 𝒫 1o ⊆ 3o ∧ ¬ 3o ⊆ suc 𝒫 1o))
1715, 16sylnib 677 . 2 (∀𝑥 ∈ On ∀𝑦 ∈ On ¬ ¬ (𝑥𝑦𝑦𝑥) → ¬ (¬ suc 𝒫 1o ⊆ 3o ∧ ¬ 3o ⊆ suc 𝒫 1o))
18 sucpw1nss3 7302 . . 3 EXMID → ¬ suc 𝒫 1o ⊆ 3o)
19 3nsssucpw1 7303 . . 3 EXMID → ¬ 3o ⊆ suc 𝒫 1o)
2018, 19jca 306 . 2 EXMID → (¬ suc 𝒫 1o ⊆ 3o ∧ ¬ 3o ⊆ suc 𝒫 1o))
2117, 20nsyl 629 1 (∀𝑥 ∈ On ∀𝑦 ∈ On ¬ ¬ (𝑥𝑦𝑦𝑥) → ¬ ¬ EXMID)
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 104  wo 709   = wceq 1364  wcel 2167  wral 2475  wss 3157  𝒫 cpw 3605  EXMIDwem 4227  Oncon0 4398  suc csuc 4400  1oc1o 6467  3oc3o 6469
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 615  ax-in2 616  ax-io 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-sep 4151  ax-nul 4159  ax-pow 4207  ax-pr 4242  ax-un 4468  ax-setind 4573
This theorem depends on definitions:  df-bi 117  df-dc 836  df-3an 982  df-tru 1367  df-nf 1475  df-sb 1777  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ne 2368  df-ral 2480  df-rex 2481  df-v 2765  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-nul 3451  df-pw 3607  df-sn 3628  df-pr 3629  df-uni 3840  df-int 3875  df-tr 4132  df-exmid 4228  df-iord 4401  df-on 4403  df-suc 4406  df-iom 4627  df-1o 6474  df-2o 6475  df-3o 6476
This theorem is referenced by:  onntri2or  7313
  Copyright terms: Public domain W3C validator