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

Theorem noextenddif 27657
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 27639 . . 3 (𝐴 No → dom 𝐴 ∈ On)
2 noextend.1 . . . . . 6 𝑋 ∈ {1o, 2o}
32nosgnn0i 27648 . . . . 5 ∅ ≠ 𝑋
43a1i 11 . . . 4 (𝐴 No → ∅ ≠ 𝑋)
5 nodmord 27642 . . . . . 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 27638 . . . . . . 7 (𝐴 No → Fun 𝐴)
11 funfn 6522 . . . . . . 7 (Fun 𝐴𝐴 Fn dom 𝐴)
1210, 11sylib 219 . . . . . 6 (𝐴 No 𝐴 Fn dom 𝐴)
13 fnsng 6544 . . . . . . 7 ((dom 𝐴 ∈ On ∧ 𝑋 ∈ {1o, 2o}) → {⟨dom 𝐴, 𝑋⟩} Fn {dom 𝐴})
141, 2, 13sylancl 592 . . . . . 6 (𝐴 No → {⟨dom 𝐴, 𝑋⟩} Fn {dom 𝐴})
15 disjsn 4650 . . . . . . 7 ((dom 𝐴 ∩ {dom 𝐴}) = ∅ ↔ ¬ dom 𝐴 ∈ dom 𝐴)
167, 15sylibr 235 . . . . . 6 (𝐴 No → (dom 𝐴 ∩ {dom 𝐴}) = ∅)
17 snidg 4599 . . . . . . 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 1382 . . . . 5 (𝐴 No → ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘dom 𝐴) = ({⟨dom 𝐴, 𝑋⟩}‘dom 𝐴))
21 fvsng 7131 . . . . . 6 ((dom 𝐴 ∈ On ∧ 𝑋 ∈ {1o, 2o}) → ({⟨dom 𝐴, 𝑋⟩}‘dom 𝐴) = 𝑋)
221, 2, 21sylancl 592 . . . . 5 (𝐴 No → ({⟨dom 𝐴, 𝑋⟩}‘dom 𝐴) = 𝑋)
2320, 22eqtrd 2775 . . . 4 (𝐴 No → ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘dom 𝐴) = 𝑋)
244, 9, 233netr4d 3012 . . 3 (𝐴 No → (𝐴‘dom 𝐴) ≠ ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘dom 𝐴))
25 fveq2 6834 . . . . 5 (𝑥 = dom 𝐴 → (𝐴𝑥) = (𝐴‘dom 𝐴))
26 fveq2 6834 . . . . 5 (𝑥 = dom 𝐴 → ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑥) = ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘dom 𝐴))
2725, 26neeq12d 2996 . . . 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 2747 . . . . . . . . . . . . 13 (𝑦 = dom 𝐴 ↔ dom 𝐴 = 𝑦)
3332orbi1i 919 . . . . . . . . . . . 12 ((𝑦 = dom 𝐴 ∨ dom 𝐴𝑦) ↔ (dom 𝐴 = 𝑦 ∨ dom 𝐴𝑦))
34 orcom 876 . . . . . . . . . . . 12 ((dom 𝐴 = 𝑦 ∨ dom 𝐴𝑦) ↔ (dom 𝐴𝑦 ∨ dom 𝐴 = 𝑦))
3533, 34bitri 276 . . . . . . . . . . 11 ((𝑦 = dom 𝐴 ∨ dom 𝐴𝑦) ↔ (dom 𝐴𝑦 ∨ dom 𝐴 = 𝑦))
3635notbii 321 . . . . . . . . . 10 (¬ (𝑦 = dom 𝐴 ∨ dom 𝐴𝑦) ↔ ¬ (dom 𝐴𝑦 ∨ dom 𝐴 = 𝑦))
3731, 36bitrdi 288 . . . . . . . . 9 ((Ord 𝑦 ∧ Ord dom 𝐴) → (𝑦 ∈ dom 𝐴 ↔ ¬ (dom 𝐴𝑦 ∨ dom 𝐴 = 𝑦)))
38 ordsseleq 6346 . . . . . . . . . . 11 ((Ord dom 𝐴 ∧ Ord 𝑦) → (dom 𝐴𝑦 ↔ (dom 𝐴𝑦 ∨ dom 𝐴 = 𝑦)))
3938notbid 319 . . . . . . . . . 10 ((Ord dom 𝐴 ∧ Ord 𝑦) → (¬ dom 𝐴𝑦 ↔ ¬ (dom 𝐴𝑦 ∨ dom 𝐴 = 𝑦)))
4039ancoms 459 . . . . . . . . 9 ((Ord 𝑦 ∧ Ord dom 𝐴) → (¬ dom 𝐴𝑦 ↔ ¬ (dom 𝐴𝑦 ∨ dom 𝐴 = 𝑦)))
4137, 40bitr4d 283 . . . . . . . 8 ((Ord 𝑦 ∧ Ord dom 𝐴) → (𝑦 ∈ dom 𝐴 ↔ ¬ dom 𝐴𝑦))
4230, 5, 41syl2anr 603 . . . . . . 7 ((𝐴 No 𝑦 ∈ On) → (𝑦 ∈ dom 𝐴 ↔ ¬ dom 𝐴𝑦))
43123ad2ant1 1139 . . . . . . . . . 10 ((𝐴 No 𝑦 ∈ On ∧ 𝑦 ∈ dom 𝐴) → 𝐴 Fn dom 𝐴)
44143ad2ant1 1139 . . . . . . . . . 10 ((𝐴 No 𝑦 ∈ On ∧ 𝑦 ∈ dom 𝐴) → {⟨dom 𝐴, 𝑋⟩} Fn {dom 𝐴})
45163ad2ant1 1139 . . . . . . . . . 10 ((𝐴 No 𝑦 ∈ On ∧ 𝑦 ∈ dom 𝐴) → (dom 𝐴 ∩ {dom 𝐴}) = ∅)
46 simp3 1144 . . . . . . . . . 10 ((𝐴 No 𝑦 ∈ On ∧ 𝑦 ∈ dom 𝐴) → 𝑦 ∈ dom 𝐴)
47 fvun1 6925 . . . . . . . . . 10 ((𝐴 Fn dom 𝐴 ∧ {⟨dom 𝐴, 𝑋⟩} Fn {dom 𝐴} ∧ ((dom 𝐴 ∩ {dom 𝐴}) = ∅ ∧ 𝑦 ∈ dom 𝐴)) → ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑦) = (𝐴𝑦))
4843, 44, 45, 46, 47syl112anc 1382 . . . . . . . . 9 ((𝐴 No 𝑦 ∈ On ∧ 𝑦 ∈ dom 𝐴) → ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑦) = (𝐴𝑦))
4948eqcomd 2746 . . . . . . . 8 ((𝐴 No 𝑦 ∈ On ∧ 𝑦 ∈ dom 𝐴) → (𝐴𝑦) = ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑦))
50493expia 1127 . . . . . . 7 ((𝐴 No 𝑦 ∈ On) → (𝑦 ∈ dom 𝐴 → (𝐴𝑦) = ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑦)))
5142, 50sylbird 261 . . . . . 6 ((𝐴 No 𝑦 ∈ On) → (¬ dom 𝐴𝑦 → (𝐴𝑦) = ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑦)))
5251necon1ad 2952 . . . . 5 ((𝐴 No 𝑦 ∈ On) → ((𝐴𝑦) ≠ ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑦) → dom 𝐴𝑦))
5352ralrimiva 3132 . . . 4 (𝐴 No → ∀𝑦 ∈ On ((𝐴𝑦) ≠ ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑦) → dom 𝐴𝑦))
54 fveq2 6834 . . . . . 6 (𝑥 = 𝑦 → (𝐴𝑥) = (𝐴𝑦))
55 fveq2 6834 . . . . . 6 (𝑥 = 𝑦 → ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑥) = ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑦))
5654, 55neeq12d 2996 . . . . 5 (𝑥 = 𝑦 → ((𝐴𝑥) ≠ ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑥) ↔ (𝐴𝑦) ≠ ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑦)))
5756ralrab 3642 . . . 4 (∀𝑦 ∈ {𝑥 ∈ On ∣ (𝐴𝑥) ≠ ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑥)}dom 𝐴𝑦 ↔ ∀𝑦 ∈ On ((𝐴𝑦) ≠ ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑦) → dom 𝐴𝑦))
5853, 57sylibr 235 . . 3 (𝐴 No → ∀𝑦 ∈ {𝑥 ∈ On ∣ (𝐴𝑥) ≠ ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑥)}dom 𝐴𝑦)
59 ssint 4901 . . 3 (dom 𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑥)} ↔ ∀𝑦 ∈ {𝑥 ∈ On ∣ (𝐴𝑥) ≠ ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑥)}dom 𝐴𝑦)
6058, 59sylibr 235 . 2 (𝐴 No → dom 𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑥)})
6129, 60eqssd 3939 1 (𝐴 No {𝑥 ∈ On ∣ (𝐴𝑥) ≠ ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑥)} = dom 𝐴)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 207  wa 396  wo 853  w3a 1092   = wceq 1547  wcel 2119  wne 2935  wral 3054  {crab 3392  cun 3888  cin 3889  wss 3890  c0 4268  {csn 4562  {cpr 4564  cop 4568   cint 4884  dom cdm 5625  Ord word 6316  Oncon0 6317  Fun wfun 6486   Fn wfn 6487  cfv 6492  1oc1o 8395  2oc2o 8396   No csur 27628
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2712  ax-sep 5225  ax-nul 5235  ax-pow 5301  ax-pr 5369  ax-un 7685
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3or 1093  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2719  df-cleq 2732  df-clel 2815  df-ne 2936  df-ral 3055  df-rex 3065  df-rab 3393  df-v 3434  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-pss 3910  df-nul 4269  df-if 4462  df-pw 4538  df-sn 4563  df-pr 4565  df-op 4569  df-uni 4846  df-int 4885  df-br 5080  df-opab 5142  df-tr 5187  df-id 5520  df-eprel 5525  df-po 5533  df-so 5534  df-fr 5578  df-we 5580  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  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 8402  df-2o 8403  df-no 27631
This theorem is referenced by:  noextendlt  27658  noextendgt  27659
  Copyright terms: Public domain W3C validator