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

Theorem nosepne 27650
Description: The value of two non-equal surreals at the first place they differ is different. (Contributed by Scott Fenton, 24-Nov-2021.)
Assertion
Ref Expression
nosepne ((𝐴 No 𝐵 No 𝐴𝐵) → (𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) ≠ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵

Proof of Theorem nosepne
StepHypRef Expression
1 sltso 27646 . . . 4 <s Or No
2 sotrine 5571 . . . 4 (( <s Or No ∧ (𝐴 No 𝐵 No )) → (𝐴𝐵 ↔ (𝐴 <s 𝐵𝐵 <s 𝐴)))
31, 2mpan 691 . . 3 ((𝐴 No 𝐵 No ) → (𝐴𝐵 ↔ (𝐴 <s 𝐵𝐵 <s 𝐴)))
4 nosepnelem 27649 . . . . 5 ((𝐴 No 𝐵 No 𝐴 <s 𝐵) → (𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) ≠ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}))
543expia 1122 . . . 4 ((𝐴 No 𝐵 No ) → (𝐴 <s 𝐵 → (𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) ≠ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)})))
6 nosepnelem 27649 . . . . . . 7 ((𝐵 No 𝐴 No 𝐵 <s 𝐴) → (𝐵 {𝑥 ∈ On ∣ (𝐵𝑥) ≠ (𝐴𝑥)}) ≠ (𝐴 {𝑥 ∈ On ∣ (𝐵𝑥) ≠ (𝐴𝑥)}))
7 necom 2984 . . . . . . . . . . . 12 ((𝐴𝑥) ≠ (𝐵𝑥) ↔ (𝐵𝑥) ≠ (𝐴𝑥))
87rabbii 3403 . . . . . . . . . . 11 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)} = {𝑥 ∈ On ∣ (𝐵𝑥) ≠ (𝐴𝑥)}
98inteqi 4905 . . . . . . . . . 10 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)} = {𝑥 ∈ On ∣ (𝐵𝑥) ≠ (𝐴𝑥)}
109fveq2i 6836 . . . . . . . . 9 (𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = (𝐴 {𝑥 ∈ On ∣ (𝐵𝑥) ≠ (𝐴𝑥)})
119fveq2i 6836 . . . . . . . . 9 (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = (𝐵 {𝑥 ∈ On ∣ (𝐵𝑥) ≠ (𝐴𝑥)})
1210, 11neeq12i 2997 . . . . . . . 8 ((𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) ≠ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) ↔ (𝐴 {𝑥 ∈ On ∣ (𝐵𝑥) ≠ (𝐴𝑥)}) ≠ (𝐵 {𝑥 ∈ On ∣ (𝐵𝑥) ≠ (𝐴𝑥)}))
13 necom 2984 . . . . . . . 8 ((𝐴 {𝑥 ∈ On ∣ (𝐵𝑥) ≠ (𝐴𝑥)}) ≠ (𝐵 {𝑥 ∈ On ∣ (𝐵𝑥) ≠ (𝐴𝑥)}) ↔ (𝐵 {𝑥 ∈ On ∣ (𝐵𝑥) ≠ (𝐴𝑥)}) ≠ (𝐴 {𝑥 ∈ On ∣ (𝐵𝑥) ≠ (𝐴𝑥)}))
1412, 13bitri 275 . . . . . . 7 ((𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) ≠ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) ↔ (𝐵 {𝑥 ∈ On ∣ (𝐵𝑥) ≠ (𝐴𝑥)}) ≠ (𝐴 {𝑥 ∈ On ∣ (𝐵𝑥) ≠ (𝐴𝑥)}))
156, 14sylibr 234 . . . . . 6 ((𝐵 No 𝐴 No 𝐵 <s 𝐴) → (𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) ≠ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}))
16153expia 1122 . . . . 5 ((𝐵 No 𝐴 No ) → (𝐵 <s 𝐴 → (𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) ≠ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)})))
1716ancoms 458 . . . 4 ((𝐴 No 𝐵 No ) → (𝐵 <s 𝐴 → (𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) ≠ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)})))
185, 17jaod 860 . . 3 ((𝐴 No 𝐵 No ) → ((𝐴 <s 𝐵𝐵 <s 𝐴) → (𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) ≠ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)})))
193, 18sylbid 240 . 2 ((𝐴 No 𝐵 No ) → (𝐴𝐵 → (𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) ≠ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)})))
20193impia 1118 1 ((𝐴 No 𝐵 No 𝐴𝐵) → (𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) ≠ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  wo 848  w3a 1087  wcel 2114  wne 2931  {crab 3398   cint 4901   class class class wbr 5097   Or wor 5530  Oncon0 6316  cfv 6491   No csur 27609   <s cslt 27610
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-10 2147  ax-11 2163  ax-12 2183  ax-ext 2707  ax-sep 5240  ax-nul 5250  ax-pr 5376
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-nf 1786  df-sb 2069  df-mo 2538  df-eu 2568  df-clab 2714  df-cleq 2727  df-clel 2810  df-nfc 2884  df-ne 2932  df-ral 3051  df-rex 3060  df-rab 3399  df-v 3441  df-sbc 3740  df-csb 3849  df-dif 3903  df-un 3905  df-in 3907  df-ss 3917  df-pss 3920  df-nul 4285  df-if 4479  df-pw 4555  df-sn 4580  df-pr 4582  df-tp 4584  df-op 4586  df-uni 4863  df-int 4902  df-br 5098  df-opab 5160  df-mpt 5179  df-tr 5205  df-id 5518  df-eprel 5523  df-po 5531  df-so 5532  df-fr 5576  df-we 5578  df-xp 5629  df-rel 5630  df-cnv 5631  df-co 5632  df-dm 5633  df-rn 5634  df-res 5635  df-ima 5636  df-ord 6319  df-on 6320  df-suc 6322  df-iota 6447  df-fun 6493  df-fn 6494  df-f 6495  df-fv 6499  df-1o 8397  df-2o 8398  df-no 27612  df-slt 27613
This theorem is referenced by:  nosep1o  27651  nosep2o  27652  nosepssdm  27656  noresle  27667  noetasuplem4  27706  noetainflem4  27710
  Copyright terms: Public domain W3C validator