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

Theorem noextenddif 27646
Description: Calculate the place where a surreal and its extension differ. (Contributed by Scott Fenton, 22-Nov-2021.)
Hypothesis
Ref Expression
noextend.1 𝑋 ∈ {1o, 2o}
Assertion
Ref Expression
noextenddif (𝐴 No {𝑥 ∈ On ∣ (𝐴𝑥) ≠ ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑥)} = dom 𝐴)
Distinct variable groups:   𝑥,𝐴   𝑥,𝑋

Proof of Theorem noextenddif
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 nodmon 27628 . . 3 (𝐴 No → dom 𝐴 ∈ On)
2 noextend.1 . . . . . 6 𝑋 ∈ {1o, 2o}
32nosgnn0i 27637 . . . . 5 ∅ ≠ 𝑋
43a1i 11 . . . 4 (𝐴 No → ∅ ≠ 𝑋)
5 nodmord 27631 . . . . . 6 (𝐴 No → Ord dom 𝐴)
6 ordirr 6335 . . . . . 6 (Ord dom 𝐴 → ¬ dom 𝐴 ∈ dom 𝐴)
75, 6syl 17 . . . . 5 (𝐴 No → ¬ dom 𝐴 ∈ dom 𝐴)
8 ndmfv 6866 . . . . 5 (¬ dom 𝐴 ∈ dom 𝐴 → (𝐴‘dom 𝐴) = ∅)
97, 8syl 17 . . . 4 (𝐴 No → (𝐴‘dom 𝐴) = ∅)
10 nofun 27627 . . . . . . 7 (𝐴 No → Fun 𝐴)
11 funfn 6522 . . . . . . 7 (Fun 𝐴𝐴 Fn dom 𝐴)
1210, 11sylib 218 . . . . . 6 (𝐴 No 𝐴 Fn dom 𝐴)
13 fnsng 6544 . . . . . . 7 ((dom 𝐴 ∈ On ∧ 𝑋 ∈ {1o, 2o}) → {⟨dom 𝐴, 𝑋⟩} Fn {dom 𝐴})
141, 2, 13sylancl 587 . . . . . 6 (𝐴 No → {⟨dom 𝐴, 𝑋⟩} Fn {dom 𝐴})
15 disjsn 4656 . . . . . . 7 ((dom 𝐴 ∩ {dom 𝐴}) = ∅ ↔ ¬ dom 𝐴 ∈ dom 𝐴)
167, 15sylibr 234 . . . . . 6 (𝐴 No → (dom 𝐴 ∩ {dom 𝐴}) = ∅)
17 snidg 4605 . . . . . . 7 (dom 𝐴 ∈ On → dom 𝐴 ∈ {dom 𝐴})
181, 17syl 17 . . . . . 6 (𝐴 No → dom 𝐴 ∈ {dom 𝐴})
19 fvun2 6926 . . . . . 6 ((𝐴 Fn dom 𝐴 ∧ {⟨dom 𝐴, 𝑋⟩} Fn {dom 𝐴} ∧ ((dom 𝐴 ∩ {dom 𝐴}) = ∅ ∧ dom 𝐴 ∈ {dom 𝐴})) → ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘dom 𝐴) = ({⟨dom 𝐴, 𝑋⟩}‘dom 𝐴))
2012, 14, 16, 18, 19syl112anc 1377 . . . . 5 (𝐴 No → ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘dom 𝐴) = ({⟨dom 𝐴, 𝑋⟩}‘dom 𝐴))
21 fvsng 7128 . . . . . 6 ((dom 𝐴 ∈ On ∧ 𝑋 ∈ {1o, 2o}) → ({⟨dom 𝐴, 𝑋⟩}‘dom 𝐴) = 𝑋)
221, 2, 21sylancl 587 . . . . 5 (𝐴 No → ({⟨dom 𝐴, 𝑋⟩}‘dom 𝐴) = 𝑋)
2320, 22eqtrd 2772 . . . 4 (𝐴 No → ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘dom 𝐴) = 𝑋)
244, 9, 233netr4d 3010 . . 3 (𝐴 No → (𝐴‘dom 𝐴) ≠ ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘dom 𝐴))
25 fveq2 6834 . . . . 5 (𝑥 = dom 𝐴 → (𝐴𝑥) = (𝐴‘dom 𝐴))
26 fveq2 6834 . . . . 5 (𝑥 = dom 𝐴 → ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑥) = ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘dom 𝐴))
2725, 26neeq12d 2994 . . . 4 (𝑥 = dom 𝐴 → ((𝐴𝑥) ≠ ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑥) ↔ (𝐴‘dom 𝐴) ≠ ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘dom 𝐴)))
2827onintss 6369 . . 3 (dom 𝐴 ∈ On → ((𝐴‘dom 𝐴) ≠ ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘dom 𝐴) → {𝑥 ∈ On ∣ (𝐴𝑥) ≠ ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑥)} ⊆ dom 𝐴))
291, 24, 28sylc 65 . 2 (𝐴 No {𝑥 ∈ On ∣ (𝐴𝑥) ≠ ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑥)} ⊆ dom 𝐴)
30 eloni 6327 . . . . . . . 8 (𝑦 ∈ On → Ord 𝑦)
31 ordtri2 6352 . . . . . . . . . 10 ((Ord 𝑦 ∧ Ord dom 𝐴) → (𝑦 ∈ dom 𝐴 ↔ ¬ (𝑦 = dom 𝐴 ∨ dom 𝐴𝑦)))
32 eqcom 2744 . . . . . . . . . . . . 13 (𝑦 = dom 𝐴 ↔ dom 𝐴 = 𝑦)
3332orbi1i 914 . . . . . . . . . . . 12 ((𝑦 = dom 𝐴 ∨ dom 𝐴𝑦) ↔ (dom 𝐴 = 𝑦 ∨ dom 𝐴𝑦))
34 orcom 871 . . . . . . . . . . . 12 ((dom 𝐴 = 𝑦 ∨ dom 𝐴𝑦) ↔ (dom 𝐴𝑦 ∨ dom 𝐴 = 𝑦))
3533, 34bitri 275 . . . . . . . . . . 11 ((𝑦 = dom 𝐴 ∨ dom 𝐴𝑦) ↔ (dom 𝐴𝑦 ∨ dom 𝐴 = 𝑦))
3635notbii 320 . . . . . . . . . 10 (¬ (𝑦 = dom 𝐴 ∨ dom 𝐴𝑦) ↔ ¬ (dom 𝐴𝑦 ∨ dom 𝐴 = 𝑦))
3731, 36bitrdi 287 . . . . . . . . 9 ((Ord 𝑦 ∧ Ord dom 𝐴) → (𝑦 ∈ dom 𝐴 ↔ ¬ (dom 𝐴𝑦 ∨ dom 𝐴 = 𝑦)))
38 ordsseleq 6346 . . . . . . . . . . 11 ((Ord dom 𝐴 ∧ Ord 𝑦) → (dom 𝐴𝑦 ↔ (dom 𝐴𝑦 ∨ dom 𝐴 = 𝑦)))
3938notbid 318 . . . . . . . . . 10 ((Ord dom 𝐴 ∧ Ord 𝑦) → (¬ dom 𝐴𝑦 ↔ ¬ (dom 𝐴𝑦 ∨ dom 𝐴 = 𝑦)))
4039ancoms 458 . . . . . . . . 9 ((Ord 𝑦 ∧ Ord dom 𝐴) → (¬ dom 𝐴𝑦 ↔ ¬ (dom 𝐴𝑦 ∨ dom 𝐴 = 𝑦)))
4137, 40bitr4d 282 . . . . . . . 8 ((Ord 𝑦 ∧ Ord dom 𝐴) → (𝑦 ∈ dom 𝐴 ↔ ¬ dom 𝐴𝑦))
4230, 5, 41syl2anr 598 . . . . . . 7 ((𝐴 No 𝑦 ∈ On) → (𝑦 ∈ dom 𝐴 ↔ ¬ dom 𝐴𝑦))
43123ad2ant1 1134 . . . . . . . . . 10 ((𝐴 No 𝑦 ∈ On ∧ 𝑦 ∈ dom 𝐴) → 𝐴 Fn dom 𝐴)
44143ad2ant1 1134 . . . . . . . . . 10 ((𝐴 No 𝑦 ∈ On ∧ 𝑦 ∈ dom 𝐴) → {⟨dom 𝐴, 𝑋⟩} Fn {dom 𝐴})
45163ad2ant1 1134 . . . . . . . . . 10 ((𝐴 No 𝑦 ∈ On ∧ 𝑦 ∈ dom 𝐴) → (dom 𝐴 ∩ {dom 𝐴}) = ∅)
46 simp3 1139 . . . . . . . . . 10 ((𝐴 No 𝑦 ∈ On ∧ 𝑦 ∈ dom 𝐴) → 𝑦 ∈ dom 𝐴)
47 fvun1 6925 . . . . . . . . . 10 ((𝐴 Fn dom 𝐴 ∧ {⟨dom 𝐴, 𝑋⟩} Fn {dom 𝐴} ∧ ((dom 𝐴 ∩ {dom 𝐴}) = ∅ ∧ 𝑦 ∈ dom 𝐴)) → ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑦) = (𝐴𝑦))
4843, 44, 45, 46, 47syl112anc 1377 . . . . . . . . 9 ((𝐴 No 𝑦 ∈ On ∧ 𝑦 ∈ dom 𝐴) → ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑦) = (𝐴𝑦))
4948eqcomd 2743 . . . . . . . 8 ((𝐴 No 𝑦 ∈ On ∧ 𝑦 ∈ dom 𝐴) → (𝐴𝑦) = ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑦))
50493expia 1122 . . . . . . 7 ((𝐴 No 𝑦 ∈ On) → (𝑦 ∈ dom 𝐴 → (𝐴𝑦) = ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑦)))
5142, 50sylbird 260 . . . . . 6 ((𝐴 No 𝑦 ∈ On) → (¬ dom 𝐴𝑦 → (𝐴𝑦) = ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑦)))
5251necon1ad 2950 . . . . 5 ((𝐴 No 𝑦 ∈ On) → ((𝐴𝑦) ≠ ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑦) → dom 𝐴𝑦))
5352ralrimiva 3130 . . . 4 (𝐴 No → ∀𝑦 ∈ On ((𝐴𝑦) ≠ ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑦) → dom 𝐴𝑦))
54 fveq2 6834 . . . . . 6 (𝑥 = 𝑦 → (𝐴𝑥) = (𝐴𝑦))
55 fveq2 6834 . . . . . 6 (𝑥 = 𝑦 → ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑥) = ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑦))
5654, 55neeq12d 2994 . . . . 5 (𝑥 = 𝑦 → ((𝐴𝑥) ≠ ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑥) ↔ (𝐴𝑦) ≠ ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑦)))
5756ralrab 3641 . . . 4 (∀𝑦 ∈ {𝑥 ∈ On ∣ (𝐴𝑥) ≠ ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑥)}dom 𝐴𝑦 ↔ ∀𝑦 ∈ On ((𝐴𝑦) ≠ ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑦) → dom 𝐴𝑦))
5853, 57sylibr 234 . . 3 (𝐴 No → ∀𝑦 ∈ {𝑥 ∈ On ∣ (𝐴𝑥) ≠ ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑥)}dom 𝐴𝑦)
59 ssint 4907 . . 3 (dom 𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑥)} ↔ ∀𝑦 ∈ {𝑥 ∈ On ∣ (𝐴𝑥) ≠ ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑥)}dom 𝐴𝑦)
6058, 59sylibr 234 . 2 (𝐴 No → dom 𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑥)})
6129, 60eqssd 3940 1 (𝐴 No {𝑥 ∈ On ∣ (𝐴𝑥) ≠ ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑥)} = dom 𝐴)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 206  wa 395  wo 848  w3a 1087   = wceq 1542  wcel 2114  wne 2933  wral 3052  {crab 3390  cun 3888  cin 3889  wss 3890  c0 4274  {csn 4568  {cpr 4570  cop 4574   cint 4890  dom cdm 5624  Ord word 6316  Oncon0 6317  Fun wfun 6486   Fn wfn 6487  cfv 6492  1oc1o 8391  2oc2o 8392   No csur 27617
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 2185  ax-ext 2709  ax-sep 5231  ax-nul 5241  ax-pow 5302  ax-pr 5370  ax-un 7682
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 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-ne 2934  df-ral 3053  df-rex 3063  df-rab 3391  df-v 3432  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-pss 3910  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-int 4891  df-br 5087  df-opab 5149  df-tr 5194  df-id 5519  df-eprel 5524  df-po 5532  df-so 5533  df-fr 5577  df-we 5579  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-ord 6320  df-on 6321  df-suc 6323  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-fv 6500  df-1o 8398  df-2o 8399  df-no 27620
This theorem is referenced by:  noextendlt  27647  noextendgt  27648
  Copyright terms: Public domain W3C validator