Users' Mathboxes Mathbox for Scott Fenton < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  nodenselem5 Structured version   Visualization version   GIF version

Theorem nodenselem5 33818
Description: Lemma for nodense 33822. If the birthdays of two distinct surreals are equal, then the ordinal from nodenselem4 33817 is an element of that birthday. (Contributed by Scott Fenton, 16-Jun-2011.)
Assertion
Ref Expression
nodenselem5 (((𝐴 No 𝐵 No ) ∧ (( bday 𝐴) = ( bday 𝐵) ∧ 𝐴 <s 𝐵)) → {𝑎 ∈ On ∣ (𝐴𝑎) ≠ (𝐵𝑎)} ∈ ( bday 𝐴))
Distinct variable groups:   𝐴,𝑎   𝐵,𝑎

Proof of Theorem nodenselem5
StepHypRef Expression
1 simpll 763 . . . 4 (((𝐴 No 𝐵 No ) ∧ (( bday 𝐴) = ( bday 𝐵) ∧ 𝐴 <s 𝐵)) → 𝐴 No )
2 simplr 765 . . . 4 (((𝐴 No 𝐵 No ) ∧ (( bday 𝐴) = ( bday 𝐵) ∧ 𝐴 <s 𝐵)) → 𝐵 No )
3 sltso 33806 . . . . . . . . . 10 <s Or No
4 sonr 5517 . . . . . . . . . 10 (( <s Or No 𝐴 No ) → ¬ 𝐴 <s 𝐴)
53, 4mpan 686 . . . . . . . . 9 (𝐴 No → ¬ 𝐴 <s 𝐴)
6 breq2 5074 . . . . . . . . . 10 (𝐴 = 𝐵 → (𝐴 <s 𝐴𝐴 <s 𝐵))
76notbid 317 . . . . . . . . 9 (𝐴 = 𝐵 → (¬ 𝐴 <s 𝐴 ↔ ¬ 𝐴 <s 𝐵))
85, 7syl5ibcom 244 . . . . . . . 8 (𝐴 No → (𝐴 = 𝐵 → ¬ 𝐴 <s 𝐵))
98necon2ad 2957 . . . . . . 7 (𝐴 No → (𝐴 <s 𝐵𝐴𝐵))
109adantr 480 . . . . . 6 ((𝐴 No 𝐵 No ) → (𝐴 <s 𝐵𝐴𝐵))
1110imp 406 . . . . 5 (((𝐴 No 𝐵 No ) ∧ 𝐴 <s 𝐵) → 𝐴𝐵)
1211adantrl 712 . . . 4 (((𝐴 No 𝐵 No ) ∧ (( bday 𝐴) = ( bday 𝐵) ∧ 𝐴 <s 𝐵)) → 𝐴𝐵)
13 nosepdm 33814 . . . 4 ((𝐴 No 𝐵 No 𝐴𝐵) → {𝑎 ∈ On ∣ (𝐴𝑎) ≠ (𝐵𝑎)} ∈ (dom 𝐴 ∪ dom 𝐵))
141, 2, 12, 13syl3anc 1369 . . 3 (((𝐴 No 𝐵 No ) ∧ (( bday 𝐴) = ( bday 𝐵) ∧ 𝐴 <s 𝐵)) → {𝑎 ∈ On ∣ (𝐴𝑎) ≠ (𝐵𝑎)} ∈ (dom 𝐴 ∪ dom 𝐵))
15 simprl 767 . . . . . 6 (((𝐴 No 𝐵 No ) ∧ (( bday 𝐴) = ( bday 𝐵) ∧ 𝐴 <s 𝐵)) → ( bday 𝐴) = ( bday 𝐵))
1615uneq2d 4093 . . . . 5 (((𝐴 No 𝐵 No ) ∧ (( bday 𝐴) = ( bday 𝐵) ∧ 𝐴 <s 𝐵)) → (( bday 𝐴) ∪ ( bday 𝐴)) = (( bday 𝐴) ∪ ( bday 𝐵)))
17 unidm 4082 . . . . 5 (( bday 𝐴) ∪ ( bday 𝐴)) = ( bday 𝐴)
1816, 17eqtr3di 2794 . . . 4 (((𝐴 No 𝐵 No ) ∧ (( bday 𝐴) = ( bday 𝐵) ∧ 𝐴 <s 𝐵)) → (( bday 𝐴) ∪ ( bday 𝐵)) = ( bday 𝐴))
19 bdayval 33778 . . . . . 6 (𝐴 No → ( bday 𝐴) = dom 𝐴)
201, 19syl 17 . . . . 5 (((𝐴 No 𝐵 No ) ∧ (( bday 𝐴) = ( bday 𝐵) ∧ 𝐴 <s 𝐵)) → ( bday 𝐴) = dom 𝐴)
21 bdayval 33778 . . . . . 6 (𝐵 No → ( bday 𝐵) = dom 𝐵)
222, 21syl 17 . . . . 5 (((𝐴 No 𝐵 No ) ∧ (( bday 𝐴) = ( bday 𝐵) ∧ 𝐴 <s 𝐵)) → ( bday 𝐵) = dom 𝐵)
2320, 22uneq12d 4094 . . . 4 (((𝐴 No 𝐵 No ) ∧ (( bday 𝐴) = ( bday 𝐵) ∧ 𝐴 <s 𝐵)) → (( bday 𝐴) ∪ ( bday 𝐵)) = (dom 𝐴 ∪ dom 𝐵))
2418, 23, 203eqtr3d 2786 . . 3 (((𝐴 No 𝐵 No ) ∧ (( bday 𝐴) = ( bday 𝐵) ∧ 𝐴 <s 𝐵)) → (dom 𝐴 ∪ dom 𝐵) = dom 𝐴)
2514, 24eleqtrd 2841 . 2 (((𝐴 No 𝐵 No ) ∧ (( bday 𝐴) = ( bday 𝐵) ∧ 𝐴 <s 𝐵)) → {𝑎 ∈ On ∣ (𝐴𝑎) ≠ (𝐵𝑎)} ∈ dom 𝐴)
2625, 20eleqtrrd 2842 1 (((𝐴 No 𝐵 No ) ∧ (( bday 𝐴) = ( bday 𝐵) ∧ 𝐴 <s 𝐵)) → {𝑎 ∈ On ∣ (𝐴𝑎) ≠ (𝐵𝑎)} ∈ ( bday 𝐴))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 395   = wceq 1539  wcel 2108  wne 2942  {crab 3067  cun 3881   cint 4876   class class class wbr 5070   Or wor 5493  dom cdm 5580  Oncon0 6251  cfv 6418   No csur 33770   <s cslt 33771   bday cbday 33772
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-sep 5218  ax-nul 5225  ax-pr 5347  ax-un 7566
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3or 1086  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-ral 3068  df-rex 3069  df-rab 3072  df-v 3424  df-sbc 3712  df-csb 3829  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-pss 3902  df-nul 4254  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-tp 4563  df-op 4565  df-uni 4837  df-int 4877  df-br 5071  df-opab 5133  df-mpt 5154  df-tr 5188  df-id 5480  df-eprel 5486  df-po 5494  df-so 5495  df-fr 5535  df-we 5537  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-res 5592  df-ima 5593  df-ord 6254  df-on 6255  df-suc 6257  df-iota 6376  df-fun 6420  df-fn 6421  df-f 6422  df-fv 6426  df-1o 8267  df-2o 8268  df-no 33773  df-slt 33774  df-bday 33775
This theorem is referenced by:  nodenselem8  33821  nodense  33822
  Copyright terms: Public domain W3C validator