Theorem nodenselem5 27627

Description: Lemma for nodense 27631. If the birthdays of two distinct surreals are equal, then the ordinal from nodenselem4 27626 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

Step	Hyp	Ref	Expression
1		simpll 766	. . . 4 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ (( bday ‘𝐴) = ( bday ‘𝐵) ∧ 𝐴 <s 𝐵)) → 𝐴 ∈ No )
2		simplr 768	. . . 4 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ (( bday ‘𝐴) = ( bday ‘𝐵) ∧ 𝐴 <s 𝐵)) → 𝐵 ∈ No )
3		sltso 27615	. . . . . . . . . 10 ⊢ <s Or No
4		sonr 5546	. . . . . . . . . 10 ⊢ (( <s Or No ∧ 𝐴 ∈ No ) → ¬ 𝐴 <s 𝐴)
5	3, 4	mpan 690	. . . . . . . . 9 ⊢ (𝐴 ∈ No → ¬ 𝐴 <s 𝐴)
6		breq2 5093	. . . . . . . . . 10 ⊢ (𝐴 = 𝐵 → (𝐴 <s 𝐴 ↔ 𝐴 <s 𝐵))
7	6	notbid 318	. . . . . . . . 9 ⊢ (𝐴 = 𝐵 → (¬ 𝐴 <s 𝐴 ↔ ¬ 𝐴 <s 𝐵))
8	5, 7	syl5ibcom 245	. . . . . . . 8 ⊢ (𝐴 ∈ No → (𝐴 = 𝐵 → ¬ 𝐴 <s 𝐵))
9	8	necon2ad 2943	. . . . . . 7 ⊢ (𝐴 ∈ No → (𝐴 <s 𝐵 → 𝐴 ≠ 𝐵))
10	9	adantr 480	. . . . . 6 ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ No ) → (𝐴 <s 𝐵 → 𝐴 ≠ 𝐵))
11	10	imp 406	. . . . 5 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ 𝐴 <s 𝐵) → 𝐴 ≠ 𝐵)
12	11	adantrl 716	. . . 4 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ (( bday ‘𝐴) = ( bday ‘𝐵) ∧ 𝐴 <s 𝐵)) → 𝐴 ≠ 𝐵)
13		nosepdm 27623	. . . 4 ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝐴 ≠ 𝐵) → ∩ {𝑎 ∈ On ∣ (𝐴‘𝑎) ≠ (𝐵‘𝑎)} ∈ (dom 𝐴 ∪ dom 𝐵))
14	1, 2, 12, 13	syl3anc 1373	. . 3 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ (( bday ‘𝐴) = ( bday ‘𝐵) ∧ 𝐴 <s 𝐵)) → ∩ {𝑎 ∈ On ∣ (𝐴‘𝑎) ≠ (𝐵‘𝑎)} ∈ (dom 𝐴 ∪ dom 𝐵))
15		simprl 770	. . . . . 6 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ (( bday ‘𝐴) = ( bday ‘𝐵) ∧ 𝐴 <s 𝐵)) → ( bday ‘𝐴) = ( bday ‘𝐵))
16	15	uneq2d 4115	. . . . 5 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ (( bday ‘𝐴) = ( bday ‘𝐵) ∧ 𝐴 <s 𝐵)) → (( bday ‘𝐴) ∪ ( bday ‘𝐴)) = (( bday ‘𝐴) ∪ ( bday ‘𝐵)))
17		unidm 4104	. . . . 5 ⊢ (( bday ‘𝐴) ∪ ( bday ‘𝐴)) = ( bday ‘𝐴)
18	16, 17	eqtr3di 2781	. . . 4 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ (( bday ‘𝐴) = ( bday ‘𝐵) ∧ 𝐴 <s 𝐵)) → (( bday ‘𝐴) ∪ ( bday ‘𝐵)) = ( bday ‘𝐴))
19		bdayval 27587	. . . . . 6 ⊢ (𝐴 ∈ No → ( bday ‘𝐴) = dom 𝐴)
20	1, 19	syl 17	. . . . 5 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ (( bday ‘𝐴) = ( bday ‘𝐵) ∧ 𝐴 <s 𝐵)) → ( bday ‘𝐴) = dom 𝐴)
21		bdayval 27587	. . . . . 6 ⊢ (𝐵 ∈ No → ( bday ‘𝐵) = dom 𝐵)
22	2, 21	syl 17	. . . . 5 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ (( bday ‘𝐴) = ( bday ‘𝐵) ∧ 𝐴 <s 𝐵)) → ( bday ‘𝐵) = dom 𝐵)
23	20, 22	uneq12d 4116	. . . 4 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ (( bday ‘𝐴) = ( bday ‘𝐵) ∧ 𝐴 <s 𝐵)) → (( bday ‘𝐴) ∪ ( bday ‘𝐵)) = (dom 𝐴 ∪ dom 𝐵))
24	18, 23, 20	3eqtr3d 2774	. . 3 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ (( bday ‘𝐴) = ( bday ‘𝐵) ∧ 𝐴 <s 𝐵)) → (dom 𝐴 ∪ dom 𝐵) = dom 𝐴)
25	14, 24	eleqtrd 2833	. 2 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ (( bday ‘𝐴) = ( bday ‘𝐵) ∧ 𝐴 <s 𝐵)) → ∩ {𝑎 ∈ On ∣ (𝐴‘𝑎) ≠ (𝐵‘𝑎)} ∈ dom 𝐴)
26	25, 20	eleqtrrd 2834	1 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ (( bday ‘𝐴) = ( bday ‘𝐵) ∧ 𝐴 <s 𝐵)) → ∩ {𝑎 ∈ On ∣ (𝐴‘𝑎) ≠ (𝐵‘𝑎)} ∈ ( bday ‘𝐴))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 395   = wceq 1541   ∈ wcel 2111   ≠ wne 2928  {crab 3395   ∪ cun 3895  ∩ cint 4895   class class class wbr 5089   Or wor 5521  dom cdm 5614  Oncon0 6306  ‘cfv 6481   No csur 27578   <s cslt 27579   bday cbday 27580

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-10 2144  ax-11 2160  ax-12 2180  ax-ext 2703  ax-sep 5232  ax-nul 5242  ax-pr 5368  ax-un 7668

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2535  df-eu 2564  df-clab 2710  df-cleq 2723  df-clel 2806  df-nfc 2881  df-ne 2929  df-ral 3048  df-rex 3057  df-rab 3396  df-v 3438  df-sbc 3737  df-csb 3846  df-dif 3900  df-un 3902  df-in 3904  df-ss 3914  df-pss 3917  df-nul 4281  df-if 4473  df-pw 4549  df-sn 4574  df-pr 4576  df-tp 4578  df-op 4580  df-uni 4857  df-int 4896  df-br 5090  df-opab 5152  df-mpt 5171  df-tr 5197  df-id 5509  df-eprel 5514  df-po 5522  df-so 5523  df-fr 5567  df-we 5569  df-xp 5620  df-rel 5621  df-cnv 5622  df-co 5623  df-dm 5624  df-rn 5625  df-res 5626  df-ima 5627  df-ord 6309  df-on 6310  df-suc 6312  df-iota 6437  df-fun 6483  df-fn 6484  df-f 6485  df-fv 6489  df-1o 8385  df-2o 8386  df-no 27581  df-slt 27582  df-bday 27583

This theorem is referenced by:  nodenselem8  27630  nodense  27631