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

Theorem nosepne 27590
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 27586 . . . 4 <s Or No
2 sotrine 5567 . . . 4 (( <s Or No ∧ (𝐴 No 𝐵 No )) → (𝐴𝐵 ↔ (𝐴 <s 𝐵𝐵 <s 𝐴)))
31, 2mpan 690 . . 3 ((𝐴 No 𝐵 No ) → (𝐴𝐵 ↔ (𝐴 <s 𝐵𝐵 <s 𝐴)))
4 nosepnelem 27589 . . . . 5 ((𝐴 No 𝐵 No 𝐴 <s 𝐵) → (𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) ≠ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}))
543expia 1121 . . . 4 ((𝐴 No 𝐵 No ) → (𝐴 <s 𝐵 → (𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) ≠ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)})))
6 nosepnelem 27589 . . . . . . 7 ((𝐵 No 𝐴 No 𝐵 <s 𝐴) → (𝐵 {𝑥 ∈ On ∣ (𝐵𝑥) ≠ (𝐴𝑥)}) ≠ (𝐴 {𝑥 ∈ On ∣ (𝐵𝑥) ≠ (𝐴𝑥)}))
7 necom 2978 . . . . . . . . . . . 12 ((𝐴𝑥) ≠ (𝐵𝑥) ↔ (𝐵𝑥) ≠ (𝐴𝑥))
87rabbii 3400 . . . . . . . . . . 11 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)} = {𝑥 ∈ On ∣ (𝐵𝑥) ≠ (𝐴𝑥)}
98inteqi 4900 . . . . . . . . . 10 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)} = {𝑥 ∈ On ∣ (𝐵𝑥) ≠ (𝐴𝑥)}
109fveq2i 6825 . . . . . . . . 9 (𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = (𝐴 {𝑥 ∈ On ∣ (𝐵𝑥) ≠ (𝐴𝑥)})
119fveq2i 6825 . . . . . . . . 9 (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = (𝐵 {𝑥 ∈ On ∣ (𝐵𝑥) ≠ (𝐴𝑥)})
1210, 11neeq12i 2991 . . . . . . . 8 ((𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) ≠ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) ↔ (𝐴 {𝑥 ∈ On ∣ (𝐵𝑥) ≠ (𝐴𝑥)}) ≠ (𝐵 {𝑥 ∈ On ∣ (𝐵𝑥) ≠ (𝐴𝑥)}))
13 necom 2978 . . . . . . . 8 ((𝐴 {𝑥 ∈ On ∣ (𝐵𝑥) ≠ (𝐴𝑥)}) ≠ (𝐵 {𝑥 ∈ On ∣ (𝐵𝑥) ≠ (𝐴𝑥)}) ↔ (𝐵 {𝑥 ∈ On ∣ (𝐵𝑥) ≠ (𝐴𝑥)}) ≠ (𝐴 {𝑥 ∈ On ∣ (𝐵𝑥) ≠ (𝐴𝑥)}))
1412, 13bitri 275 . . . . . . 7 ((𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) ≠ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) ↔ (𝐵 {𝑥 ∈ On ∣ (𝐵𝑥) ≠ (𝐴𝑥)}) ≠ (𝐴 {𝑥 ∈ On ∣ (𝐵𝑥) ≠ (𝐴𝑥)}))
156, 14sylibr 234 . . . . . 6 ((𝐵 No 𝐴 No 𝐵 <s 𝐴) → (𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) ≠ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}))
16153expia 1121 . . . . 5 ((𝐵 No 𝐴 No ) → (𝐵 <s 𝐴 → (𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) ≠ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)})))
1716ancoms 458 . . . 4 ((𝐴 No 𝐵 No ) → (𝐵 <s 𝐴 → (𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) ≠ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)})))
185, 17jaod 859 . . 3 ((𝐴 No 𝐵 No ) → ((𝐴 <s 𝐵𝐵 <s 𝐴) → (𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) ≠ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)})))
193, 18sylbid 240 . 2 ((𝐴 No 𝐵 No ) → (𝐴𝐵 → (𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) ≠ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)})))
20193impia 1117 1 ((𝐴 No 𝐵 No 𝐴𝐵) → (𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) ≠ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  wo 847  w3a 1086  wcel 2109  wne 2925  {crab 3394   cint 4896   class class class wbr 5092   Or wor 5526  Oncon0 6307  cfv 6482   No csur 27549   <s cslt 27550
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-sep 5235  ax-nul 5245  ax-pr 5371
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-rab 3395  df-v 3438  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4285  df-if 4477  df-pw 4553  df-sn 4578  df-pr 4580  df-tp 4582  df-op 4584  df-uni 4859  df-int 4897  df-br 5093  df-opab 5155  df-mpt 5174  df-tr 5200  df-id 5514  df-eprel 5519  df-po 5527  df-so 5528  df-fr 5572  df-we 5574  df-xp 5625  df-rel 5626  df-cnv 5627  df-co 5628  df-dm 5629  df-rn 5630  df-res 5631  df-ima 5632  df-ord 6310  df-on 6311  df-suc 6313  df-iota 6438  df-fun 6484  df-fn 6485  df-f 6486  df-fv 6490  df-1o 8388  df-2o 8389  df-no 27552  df-slt 27553
This theorem is referenced by:  nosep1o  27591  nosep2o  27592  nosepssdm  27596  noresle  27607  noetasuplem4  27646  noetainflem4  27650
  Copyright terms: Public domain W3C validator