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

Theorem negsproplem2 28474
Description: Lemma for surreal negation. Show that the cut that defines negation is legitimate. (Contributed by Scott Fenton, 2-Feb-2025.)
Hypotheses
Ref Expression
negsproplem.1 (𝜑 → ∀𝑥 ∈ No ∀𝑦 ∈ No (((bday‘𝑥) ∪ (bday‘𝑦)) ∈ ((bday‘𝐴) ∪ (bday‘𝐵)) → (( -s‘𝑥) ∈ No ∧ (𝑥 <s 𝑦 → ( -s‘𝑦) <s ( -s‘𝑥)))))
negsproplem2.1 (𝜑 → 𝐴 ∈ No)
Assertion
Ref Expression
negsproplem2 (𝜑 → ( -s “ (R‘𝐴)) <<s ( -s “ (L‘𝐴)))
Distinct variable groups:   𝑥,𝐴,𝑦   𝑥,𝐵,𝑦
Allowed substitution hints:   𝜑(𝑥, 𝑦)

Proof of Theorem negsproplem2
Dummy variables 𝑎 𝑏 𝑥𝐿 𝑥𝑅 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 negsfn 28468 . . . 4 -s Fn No
2 fnfun 6668 . . . 4 ( -s Fn No → Fun -s)
31, 2ax-mp 5 . . 3 Fun -s
4 fvex 6928 . . . 4 (R‘𝐴) ∈ V
54funimaex 6656 . . 3 (Fun -s → ( -s “ (R‘𝐴)) ∈ V)
63, 5mp1i 14 . 2 (𝜑 → ( -s “ (R‘𝐴)) ∈ V)
7 fvex 6928 . . . 4 (L‘𝐴) ∈ V
87funimaex 6656 . . 3 (Fun -s → ( -s “ (L‘𝐴)) ∈ V)
93, 8mp1i 14 . 2 (𝜑 → ( -s “ (L‘𝐴)) ∈ V)
10 rightssold 28317 . . . 4 (R‘𝐴) ⊆ (O‘(bday‘𝐴))
11 imass2 6072 . . . 4 ((R‘𝐴) ⊆ (O‘(bday‘𝐴)) → ( -s “ (R‘𝐴)) ⊆ ( -s “ (O‘(bday‘𝐴))))
1210, 11ax-mp 5 . . 3 ( -s “ (R‘𝐴)) ⊆ ( -s “ (O‘(bday‘𝐴)))
13 negsproplem.1 . . . . . . . 8 (𝜑 → ∀𝑥 ∈ No ∀𝑦 ∈ No (((bday‘𝑥) ∪ (bday‘𝑦)) ∈ ((bday‘𝐴) ∪ (bday‘𝐵)) → (( -s‘𝑥) ∈ No ∧ (𝑥 <s 𝑦 → ( -s‘𝑦) <s ( -s‘𝑥)))))
1413adantr 486 . . . . . . 7 ((𝜑 ∧ 𝑎 ∈ (O‘(bday‘𝐴))) → ∀𝑥 ∈ No ∀𝑦 ∈ No (((bday‘𝑥) ∪ (bday‘𝑦)) ∈ ((bday‘𝐴) ∪ (bday‘𝐵)) → (( -s‘𝑥) ∈ No ∧ (𝑥 <s 𝑦 → ( -s‘𝑦) <s ( -s‘𝑥)))))
15 oldssno 28286 . . . . . . . . 9 (O‘(bday‘𝐴)) ⊆ No
1615sseli 3908 . . . . . . . 8 (𝑎 ∈ (O‘(bday‘𝐴)) → 𝑎 ∈ No)
1716adantl 487 . . . . . . 7 ((𝜑 ∧ 𝑎 ∈ (O‘(bday‘𝐴))) → 𝑎 ∈ No)
18 0no 28254 . . . . . . . 8 0s ∈ No
1918a1i 11 . . . . . . 7 ((𝜑 ∧ 𝑎 ∈ (O‘(bday‘𝐴))) → 0s ∈ No)
20 bday0 28256 . . . . . . . . . 10 (bday‘ 0s ) = ∅
2120uneq2i 4166 . . . . . . . . 9 ((bday‘𝑎) ∪ (bday‘ 0s )) = ((bday‘𝑎) ∪ ∅)
22 un0 4346 . . . . . . . . 9 ((bday‘𝑎) ∪ ∅) = (bday‘𝑎)
2321, 22eqtri 2789 . . . . . . . 8 ((bday‘𝑎) ∪ (bday‘ 0s )) = (bday‘𝑎)
24 oldbdayim 28334 . . . . . . . . . 10 (𝑎 ∈ (O‘(bday‘𝐴)) → (bday‘𝑎) ∈ (bday‘𝐴))
2524adantl 487 . . . . . . . . 9 ((𝜑 ∧ 𝑎 ∈ (O‘(bday‘𝐴))) → (bday‘𝑎) ∈ (bday‘𝐴))
26 elun1 4182 . . . . . . . . 9 ((bday‘𝑎) ∈ (bday‘𝐴) → (bday‘𝑎) ∈ ((bday‘𝐴) ∪ (bday‘𝐵)))
2725, 26syl 18 . . . . . . . 8 ((𝜑 ∧ 𝑎 ∈ (O‘(bday‘𝐴))) → (bday‘𝑎) ∈ ((bday‘𝐴) ∪ (bday‘𝐵)))
2823, 27eqeltrid 2871 . . . . . . 7 ((𝜑 ∧ 𝑎 ∈ (O‘(bday‘𝐴))) → ((bday‘𝑎) ∪ (bday‘ 0s )) ∈ ((bday‘𝐴) ∪ (bday‘𝐵)))
2914, 17, 19, 28negsproplem1 28473 . . . . . 6 ((𝜑 ∧ 𝑎 ∈ (O‘(bday‘𝐴))) → (( -s‘𝑎) ∈ No ∧ (𝑎 <s 0s → ( -s‘ 0s ) <s ( -s‘𝑎))))
3029simpld 500 . . . . 5 ((𝜑 ∧ 𝑎 ∈ (O‘(bday‘𝐴))) → ( -s‘𝑎) ∈ No)
3130ralrimiva 3161 . . . 4 (𝜑 → ∀𝑎 ∈ (O‘(bday‘𝐴))( -s‘𝑎) ∈ No)
321fndmi 6672 . . . . . 6 dom -s = No
3315, 32sseqtrri 3961 . . . . 5 (O‘(bday‘𝐴)) ⊆ dom -s
34 funimass4 6979 . . . . 5 ((Fun -s ∧ (O‘(bday‘𝐴)) ⊆ dom -s) → (( -s “ (O‘(bday‘𝐴))) ⊆ No ↔ ∀𝑎 ∈ (O‘(bday‘𝐴))( -s‘𝑎) ∈ No))
353, 33, 34mp2an 705 . . . 4 (( -s “ (O‘(bday‘𝐴))) ⊆ No ↔ ∀𝑎 ∈ (O‘(bday‘𝐴))( -s‘𝑎) ∈ No)
3631, 35sylibr 237 . . 3 (𝜑 → ( -s “ (O‘(bday‘𝐴))) ⊆ No)
3712, 36sstrid 3923 . 2 (𝜑 → ( -s “ (R‘𝐴)) ⊆ No)
38 leftssold 28316 . . . 4 (L‘𝐴) ⊆ (O‘(bday‘𝐴))
39 imass2 6072 . . . 4 ((L‘𝐴) ⊆ (O‘(bday‘𝐴)) → ( -s “ (L‘𝐴)) ⊆ ( -s “ (O‘(bday‘𝐴))))
4038, 39ax-mp 5 . . 3 ( -s “ (L‘𝐴)) ⊆ ( -s “ (O‘(bday‘𝐴)))
4140, 36sstrid 3923 . 2 (𝜑 → ( -s “ (L‘𝐴)) ⊆ No)
42 rightssno 28319 . . . . . . 7 (R‘𝐴) ⊆ No
43 fvelimab 6987 . . . . . . 7 (( -s Fn No ∧ (R‘𝐴) ⊆ No) → (𝑎 ∈ ( -s “ (R‘𝐴)) ↔ ∃𝑥𝑅 ∈ (R‘𝐴)( -s‘𝑥𝑅) = 𝑎))
441, 42, 43mp2an 705 . . . . . 6 (𝑎 ∈ ( -s “ (R‘𝐴)) ↔ ∃𝑥𝑅 ∈ (R‘𝐴)( -s‘𝑥𝑅) = 𝑎)
45 leftssno 28318 . . . . . . 7 (L‘𝐴) ⊆ No
46 fvelimab 6987 . . . . . . 7 (( -s Fn No ∧ (L‘𝐴) ⊆ No) → (𝑏 ∈ ( -s “ (L‘𝐴)) ↔ ∃𝑥𝐿 ∈ (L‘𝐴)( -s‘𝑥𝐿) = 𝑏))
471, 45, 46mp2an 705 . . . . . 6 (𝑏 ∈ ( -s “ (L‘𝐴)) ↔ ∃𝑥𝐿 ∈ (L‘𝐴)( -s‘𝑥𝐿) = 𝑏)
4844, 47anbi12i 640 . . . . 5 ((𝑎 ∈ ( -s “ (R‘𝐴)) ∧ 𝑏 ∈ ( -s “ (L‘𝐴))) ↔ (∃𝑥𝑅 ∈ (R‘𝐴)( -s‘𝑥𝑅) = 𝑎 ∧ ∃𝑥𝐿 ∈ (L‘𝐴)( -s‘𝑥𝐿) = 𝑏))
49 reeanv 3238 . . . . 5 (∃𝑥𝑅 ∈ (R‘𝐴)∃𝑥𝐿 ∈ (L‘𝐴)(( -s‘𝑥𝑅) = 𝑎 ∧ ( -s‘𝑥𝐿) = 𝑏) ↔ (∃𝑥𝑅 ∈ (R‘𝐴)( -s‘𝑥𝑅) = 𝑎 ∧ ∃𝑥𝐿 ∈ (L‘𝐴)( -s‘𝑥𝐿) = 𝑏))
5048, 49bitr4i 281 . . . 4 ((𝑎 ∈ ( -s “ (R‘𝐴)) ∧ 𝑏 ∈ ( -s “ (L‘𝐴))) ↔ ∃𝑥𝑅 ∈ (R‘𝐴)∃𝑥𝐿 ∈ (L‘𝐴)(( -s‘𝑥𝑅) = 𝑎 ∧ ( -s‘𝑥𝐿) = 𝑏))
51 lltr 28307 . . . . . . . . 9 (L‘𝐴) <<s (R‘𝐴)
5251a1i 11 . . . . . . . 8 ((𝜑 ∧ (𝑥𝑅 ∈ (R‘𝐴) ∧ 𝑥𝐿 ∈ (L‘𝐴))) → (L‘𝐴) <<s (R‘𝐴))
53 simprr 785 . . . . . . . 8 ((𝜑 ∧ (𝑥𝑅 ∈ (R‘𝐴) ∧ 𝑥𝐿 ∈ (L‘𝐴))) → 𝑥𝐿 ∈ (L‘𝐴))
54 simprl 783 . . . . . . . 8 ((𝜑 ∧ (𝑥𝑅 ∈ (R‘𝐴) ∧ 𝑥𝐿 ∈ (L‘𝐴))) → 𝑥𝑅 ∈ (R‘𝐴))
5552, 53, 54sltssepcd 28217 . . . . . . 7 ((𝜑 ∧ (𝑥𝑅 ∈ (R‘𝐴) ∧ 𝑥𝐿 ∈ (L‘𝐴))) → 𝑥𝐿 <s 𝑥𝑅)
5613adantr 486 . . . . . . . . 9 ((𝜑 ∧ (𝑥𝑅 ∈ (R‘𝐴) ∧ 𝑥𝐿 ∈ (L‘𝐴))) → ∀𝑥 ∈ No ∀𝑦 ∈ No (((bday‘𝑥) ∪ (bday‘𝑦)) ∈ ((bday‘𝐴) ∪ (bday‘𝐵)) → (( -s‘𝑥) ∈ No ∧ (𝑥 <s 𝑦 → ( -s‘𝑦) <s ( -s‘𝑥)))))
5745sseli 3908 . . . . . . . . . 10 (𝑥𝐿 ∈ (L‘𝐴) → 𝑥𝐿 ∈ No)
5857ad2antll 742 . . . . . . . . 9 ((𝜑 ∧ (𝑥𝑅 ∈ (R‘𝐴) ∧ 𝑥𝐿 ∈ (L‘𝐴))) → 𝑥𝐿 ∈ No)
5942sseli 3908 . . . . . . . . . . 11 (𝑥𝑅 ∈ (R‘𝐴) → 𝑥𝑅 ∈ No)
6059adantr 486 . . . . . . . . . 10 ((𝑥𝑅 ∈ (R‘𝐴) ∧ 𝑥𝐿 ∈ (L‘𝐴)) → 𝑥𝑅 ∈ No)
6160adantl 487 . . . . . . . . 9 ((𝜑 ∧ (𝑥𝑅 ∈ (R‘𝐴) ∧ 𝑥𝐿 ∈ (L‘𝐴))) → 𝑥𝑅 ∈ No)
6238sseli 3908 . . . . . . . . . . . . 13 (𝑥𝐿 ∈ (L‘𝐴) → 𝑥𝐿 ∈ (O‘(bday‘𝐴)))
6362ad2antll 742 . . . . . . . . . . . 12 ((𝜑 ∧ (𝑥𝑅 ∈ (R‘𝐴) ∧ 𝑥𝐿 ∈ (L‘𝐴))) → 𝑥𝐿 ∈ (O‘(bday‘𝐴)))
64 oldbdayim 28334 . . . . . . . . . . . 12 (𝑥𝐿 ∈ (O‘(bday‘𝐴)) → (bday‘𝑥𝐿) ∈ (bday‘𝐴))
6563, 64syl 18 . . . . . . . . . . 11 ((𝜑 ∧ (𝑥𝑅 ∈ (R‘𝐴) ∧ 𝑥𝐿 ∈ (L‘𝐴))) → (bday‘𝑥𝐿) ∈ (bday‘𝐴))
6610a1i 11 . . . . . . . . . . . . . 14 (𝜑 → (R‘𝐴) ⊆ (O‘(bday‘𝐴)))
6766sselda 3912 . . . . . . . . . . . . 13 ((𝜑 ∧ 𝑥𝑅 ∈ (R‘𝐴)) → 𝑥𝑅 ∈ (O‘(bday‘𝐴)))
6867adantrr 730 . . . . . . . . . . . 12 ((𝜑 ∧ (𝑥𝑅 ∈ (R‘𝐴) ∧ 𝑥𝐿 ∈ (L‘𝐴))) → 𝑥𝑅 ∈ (O‘(bday‘𝐴)))
69 oldbdayim 28334 . . . . . . . . . . . 12 (𝑥𝑅 ∈ (O‘(bday‘𝐴)) → (bday‘𝑥𝑅) ∈ (bday‘𝐴))
7068, 69syl 18 . . . . . . . . . . 11 ((𝜑 ∧ (𝑥𝑅 ∈ (R‘𝐴) ∧ 𝑥𝐿 ∈ (L‘𝐴))) → (bday‘𝑥𝑅) ∈ (bday‘𝐴))
71 bdayon 28197 . . . . . . . . . . . 12 (bday‘𝑥𝐿) ∈ On
72 bdayon 28197 . . . . . . . . . . . 12 (bday‘𝑥𝑅) ∈ On
73 bdayon 28197 . . . . . . . . . . . 12 (bday‘𝐴) ∈ On
74 onunel 6495 . . . . . . . . . . . 12 (((bday‘𝑥𝐿) ∈ On ∧ (bday‘𝑥𝑅) ∈ On ∧ (bday‘𝐴) ∈ On) → (((bday‘𝑥𝐿) ∪ (bday‘𝑥𝑅)) ∈ (bday‘𝐴) ↔ ((bday‘𝑥𝐿) ∈ (bday‘𝐴) ∧ (bday‘𝑥𝑅) ∈ (bday‘𝐴))))
7571, 72, 73, 74mp3an 1493 . . . . . . . . . . 11 (((bday‘𝑥𝐿) ∪ (bday‘𝑥𝑅)) ∈ (bday‘𝐴) ↔ ((bday‘𝑥𝐿) ∈ (bday‘𝐴) ∧ (bday‘𝑥𝑅) ∈ (bday‘𝐴)))
7665, 70, 75sylanbrc 595 . . . . . . . . . 10 ((𝜑 ∧ (𝑥𝑅 ∈ (R‘𝐴) ∧ 𝑥𝐿 ∈ (L‘𝐴))) → ((bday‘𝑥𝐿) ∪ (bday‘𝑥𝑅)) ∈ (bday‘𝐴))
77 elun1 4182 . . . . . . . . . 10 (((bday‘𝑥𝐿) ∪ (bday‘𝑥𝑅)) ∈ (bday‘𝐴) → ((bday‘𝑥𝐿) ∪ (bday‘𝑥𝑅)) ∈ ((bday‘𝐴) ∪ (bday‘𝐵)))
7876, 77syl 18 . . . . . . . . 9 ((𝜑 ∧ (𝑥𝑅 ∈ (R‘𝐴) ∧ 𝑥𝐿 ∈ (L‘𝐴))) → ((bday‘𝑥𝐿) ∪ (bday‘𝑥𝑅)) ∈ ((bday‘𝐴) ∪ (bday‘𝐵)))
7956, 58, 61, 78negsproplem1 28473 . . . . . . . 8 ((𝜑 ∧ (𝑥𝑅 ∈ (R‘𝐴) ∧ 𝑥𝐿 ∈ (L‘𝐴))) → (( -s‘𝑥𝐿) ∈ No ∧ (𝑥𝐿 <s 𝑥𝑅 → ( -s‘𝑥𝑅) <s ( -s‘𝑥𝐿))))
8079simprd 501 . . . . . . 7 ((𝜑 ∧ (𝑥𝑅 ∈ (R‘𝐴) ∧ 𝑥𝐿 ∈ (L‘𝐴))) → (𝑥𝐿 <s 𝑥𝑅 → ( -s‘𝑥𝑅) <s ( -s‘𝑥𝐿)))
8155, 80mpd 16 . . . . . 6 ((𝜑 ∧ (𝑥𝑅 ∈ (R‘𝐴) ∧ 𝑥𝐿 ∈ (L‘𝐴))) → ( -s‘𝑥𝑅) <s ( -s‘𝑥𝐿))
82 breq12 5112 . . . . . 6 ((( -s‘𝑥𝑅) = 𝑎 ∧ ( -s‘𝑥𝐿) = 𝑏) → (( -s‘𝑥𝑅) <s ( -s‘𝑥𝐿) ↔ 𝑎 <s 𝑏))
8381, 82syl5ibcom 248 . . . . 5 ((𝜑 ∧ (𝑥𝑅 ∈ (R‘𝐴) ∧ 𝑥𝐿 ∈ (L‘𝐴))) → ((( -s‘𝑥𝑅) = 𝑎 ∧ ( -s‘𝑥𝐿) = 𝑏) → 𝑎 <s 𝑏))
8483rexlimdvva 3223 . . . 4 (𝜑 → (∃𝑥𝑅 ∈ (R‘𝐴)∃𝑥𝐿 ∈ (L‘𝐴)(( -s‘𝑥𝑅) = 𝑎 ∧ ( -s‘𝑥𝐿) = 𝑏) → 𝑎 <s 𝑏))
8550, 84biimtrid 245 . . 3 (𝜑 → ((𝑎 ∈ ( -s “ (R‘𝐴)) ∧ 𝑏 ∈ ( -s “ (L‘𝐴))) → 𝑎 <s 𝑏))
86853impib 1135 . 2 ((𝜑 ∧ 𝑎 ∈ ( -s “ (R‘𝐴)) ∧ 𝑏 ∈ ( -s “ (L‘𝐴))) → 𝑎 <s 𝑏)
876, 9, 37, 41, 86sltsd 28213 1 (𝜑 → ( -s “ (R‘𝐴)) <<s ( -s “ (L‘𝐴)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1572   ∈ wcel 2150  ∀wral 3083  ∃wrex 3093  Vcvv 3453   ⊆ wss 3899   ∪ cun 4151  ∅c0 4280   class class class wbr 5107  dom cdm 5657   “ cima 5660  Oncon0 6387  Fun wfun 6559   Fn wfn 6560  ‘cfv 6565  Nocsur 28056   <s clts 28057  bdaycbday 28058   <<s cslts 28202   0s c0s 28250  Ocold 28268  Lcleft 28270  Rcright 28271   -scnegs 28464
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-10 2183  ax-11 2200  ax-12 2219  ax-ext 2738  ax-rep 5237  ax-sep 5254  ax-nul 5265  ax-pow 5333  ax-pr 5397  ax-un 7782
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1105  df-3an 1106  df-tru 1575  df-fal 1585  df-ex 1815  df-nf 1819  df-sb 2104  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2842  df-nfc 2916  df-ne 2963  df-ral 3084  df-rex 3094  df-rmo 3368  df-reu 3369  df-rab 3416  df-v 3455  df-sbc 3742  df-csb 3851  df-ss 3900  df-pss 4016  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-tp 4592  df-op 4840  df-uni 4872  df-int 4912  df-iun 4957  df-br 5108  df-opab 5173  df-mpt 5192  df-tr 5218  df-id 5552  df-eprel 5557  df-po 5565  df-so 5566  df-fr 5610  df-se 5611  df-we 5612  df-xp 5663  df-rel 5664  df-cnv 5665  df-co 5666  df-dm 5667  df-rn 5668  df-res 5669  df-ima 5670  df-pred 6329  df-ord 6390  df-on 6391  df-suc 6393  df-iota 6519  df-fun 6567  df-fn 6568  df-f 6569  df-f1 6570  df-fo 6571  df-f1o 6572  df-fv 6573  df-riota 7407  df-ov 7453  df-oprab 7454  df-mpo 7455  df-2nd 8035  df-frecs 8336  df-wrecs 8367  df-recs 8416  df-1o 8513  df-2o 8514  df-no 28059  df-lts 28060  df-bday 28061  df-slts 28203  df-cuts 28205  df-0s 28252  df-made 28272  df-old 28273  df-left 28275  df-right 28276  df-norec 28383  df-negs 28466
This theorem is used by:  negsproplem3  28475
  Copyright terms: Public domain W3C validator