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

Theorem noextenddif 27587
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 27569 . . 3 (𝐴 No → dom 𝐴 ∈ On)
2 noextend.1 . . . . . 6 𝑋 ∈ {1o, 2o}
32nosgnn0i 27578 . . . . 5 ∅ ≠ 𝑋
43a1i 11 . . . 4 (𝐴 No → ∅ ≠ 𝑋)
5 nodmord 27572 . . . . . 6 (𝐴 No → Ord dom 𝐴)
6 ordirr 6353 . . . . . 6 (Ord dom 𝐴 → ¬ dom 𝐴 ∈ dom 𝐴)
75, 6syl 17 . . . . 5 (𝐴 No → ¬ dom 𝐴 ∈ dom 𝐴)
8 ndmfv 6896 . . . . 5 (¬ dom 𝐴 ∈ dom 𝐴 → (𝐴‘dom 𝐴) = ∅)
97, 8syl 17 . . . 4 (𝐴 No → (𝐴‘dom 𝐴) = ∅)
10 nofun 27568 . . . . . . 7 (𝐴 No → Fun 𝐴)
11 funfn 6549 . . . . . . 7 (Fun 𝐴𝐴 Fn dom 𝐴)
1210, 11sylib 218 . . . . . 6 (𝐴 No 𝐴 Fn dom 𝐴)
13 fnsng 6571 . . . . . . 7 ((dom 𝐴 ∈ On ∧ 𝑋 ∈ {1o, 2o}) → {⟨dom 𝐴, 𝑋⟩} Fn {dom 𝐴})
141, 2, 13sylancl 586 . . . . . 6 (𝐴 No → {⟨dom 𝐴, 𝑋⟩} Fn {dom 𝐴})
15 disjsn 4678 . . . . . . 7 ((dom 𝐴 ∩ {dom 𝐴}) = ∅ ↔ ¬ dom 𝐴 ∈ dom 𝐴)
167, 15sylibr 234 . . . . . 6 (𝐴 No → (dom 𝐴 ∩ {dom 𝐴}) = ∅)
17 snidg 4627 . . . . . . 7 (dom 𝐴 ∈ On → dom 𝐴 ∈ {dom 𝐴})
181, 17syl 17 . . . . . 6 (𝐴 No → dom 𝐴 ∈ {dom 𝐴})
19 fvun2 6956 . . . . . 6 ((𝐴 Fn dom 𝐴 ∧ {⟨dom 𝐴, 𝑋⟩} Fn {dom 𝐴} ∧ ((dom 𝐴 ∩ {dom 𝐴}) = ∅ ∧ dom 𝐴 ∈ {dom 𝐴})) → ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘dom 𝐴) = ({⟨dom 𝐴, 𝑋⟩}‘dom 𝐴))
2012, 14, 16, 18, 19syl112anc 1376 . . . . 5 (𝐴 No → ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘dom 𝐴) = ({⟨dom 𝐴, 𝑋⟩}‘dom 𝐴))
21 fvsng 7157 . . . . . 6 ((dom 𝐴 ∈ On ∧ 𝑋 ∈ {1o, 2o}) → ({⟨dom 𝐴, 𝑋⟩}‘dom 𝐴) = 𝑋)
221, 2, 21sylancl 586 . . . . 5 (𝐴 No → ({⟨dom 𝐴, 𝑋⟩}‘dom 𝐴) = 𝑋)
2320, 22eqtrd 2765 . . . 4 (𝐴 No → ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘dom 𝐴) = 𝑋)
244, 9, 233netr4d 3003 . . 3 (𝐴 No → (𝐴‘dom 𝐴) ≠ ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘dom 𝐴))
25 fveq2 6861 . . . . 5 (𝑥 = dom 𝐴 → (𝐴𝑥) = (𝐴‘dom 𝐴))
26 fveq2 6861 . . . . 5 (𝑥 = dom 𝐴 → ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑥) = ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘dom 𝐴))
2725, 26neeq12d 2987 . . . 4 (𝑥 = dom 𝐴 → ((𝐴𝑥) ≠ ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑥) ↔ (𝐴‘dom 𝐴) ≠ ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘dom 𝐴)))
2827onintss 6387 . . 3 (dom 𝐴 ∈ On → ((𝐴‘dom 𝐴) ≠ ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘dom 𝐴) → {𝑥 ∈ On ∣ (𝐴𝑥) ≠ ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑥)} ⊆ dom 𝐴))
291, 24, 28sylc 65 . 2 (𝐴 No {𝑥 ∈ On ∣ (𝐴𝑥) ≠ ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑥)} ⊆ dom 𝐴)
30 eloni 6345 . . . . . . . 8 (𝑦 ∈ On → Ord 𝑦)
31 ordtri2 6370 . . . . . . . . . 10 ((Ord 𝑦 ∧ Ord dom 𝐴) → (𝑦 ∈ dom 𝐴 ↔ ¬ (𝑦 = dom 𝐴 ∨ dom 𝐴𝑦)))
32 eqcom 2737 . . . . . . . . . . . . 13 (𝑦 = dom 𝐴 ↔ dom 𝐴 = 𝑦)
3332orbi1i 913 . . . . . . . . . . . 12 ((𝑦 = dom 𝐴 ∨ dom 𝐴𝑦) ↔ (dom 𝐴 = 𝑦 ∨ dom 𝐴𝑦))
34 orcom 870 . . . . . . . . . . . 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 6364 . . . . . . . . . . 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 597 . . . . . . 7 ((𝐴 No 𝑦 ∈ On) → (𝑦 ∈ dom 𝐴 ↔ ¬ dom 𝐴𝑦))
43123ad2ant1 1133 . . . . . . . . . 10 ((𝐴 No 𝑦 ∈ On ∧ 𝑦 ∈ dom 𝐴) → 𝐴 Fn dom 𝐴)
44143ad2ant1 1133 . . . . . . . . . 10 ((𝐴 No 𝑦 ∈ On ∧ 𝑦 ∈ dom 𝐴) → {⟨dom 𝐴, 𝑋⟩} Fn {dom 𝐴})
45163ad2ant1 1133 . . . . . . . . . 10 ((𝐴 No 𝑦 ∈ On ∧ 𝑦 ∈ dom 𝐴) → (dom 𝐴 ∩ {dom 𝐴}) = ∅)
46 simp3 1138 . . . . . . . . . 10 ((𝐴 No 𝑦 ∈ On ∧ 𝑦 ∈ dom 𝐴) → 𝑦 ∈ dom 𝐴)
47 fvun1 6955 . . . . . . . . . 10 ((𝐴 Fn dom 𝐴 ∧ {⟨dom 𝐴, 𝑋⟩} Fn {dom 𝐴} ∧ ((dom 𝐴 ∩ {dom 𝐴}) = ∅ ∧ 𝑦 ∈ dom 𝐴)) → ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑦) = (𝐴𝑦))
4843, 44, 45, 46, 47syl112anc 1376 . . . . . . . . 9 ((𝐴 No 𝑦 ∈ On ∧ 𝑦 ∈ dom 𝐴) → ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑦) = (𝐴𝑦))
4948eqcomd 2736 . . . . . . . 8 ((𝐴 No 𝑦 ∈ On ∧ 𝑦 ∈ dom 𝐴) → (𝐴𝑦) = ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑦))
50493expia 1121 . . . . . . 7 ((𝐴 No 𝑦 ∈ On) → (𝑦 ∈ dom 𝐴 → (𝐴𝑦) = ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑦)))
5142, 50sylbird 260 . . . . . 6 ((𝐴 No 𝑦 ∈ On) → (¬ dom 𝐴𝑦 → (𝐴𝑦) = ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑦)))
5251necon1ad 2943 . . . . 5 ((𝐴 No 𝑦 ∈ On) → ((𝐴𝑦) ≠ ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑦) → dom 𝐴𝑦))
5352ralrimiva 3126 . . . 4 (𝐴 No → ∀𝑦 ∈ On ((𝐴𝑦) ≠ ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑦) → dom 𝐴𝑦))
54 fveq2 6861 . . . . . 6 (𝑥 = 𝑦 → (𝐴𝑥) = (𝐴𝑦))
55 fveq2 6861 . . . . . 6 (𝑥 = 𝑦 → ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑥) = ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑦))
5654, 55neeq12d 2987 . . . . 5 (𝑥 = 𝑦 → ((𝐴𝑥) ≠ ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑥) ↔ (𝐴𝑦) ≠ ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑦)))
5756ralrab 3668 . . . 4 (∀𝑦 ∈ {𝑥 ∈ On ∣ (𝐴𝑥) ≠ ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑥)}dom 𝐴𝑦 ↔ ∀𝑦 ∈ On ((𝐴𝑦) ≠ ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑦) → dom 𝐴𝑦))
5853, 57sylibr 234 . . 3 (𝐴 No → ∀𝑦 ∈ {𝑥 ∈ On ∣ (𝐴𝑥) ≠ ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑥)}dom 𝐴𝑦)
59 ssint 4931 . . 3 (dom 𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑥)} ↔ ∀𝑦 ∈ {𝑥 ∈ On ∣ (𝐴𝑥) ≠ ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑥)}dom 𝐴𝑦)
6058, 59sylibr 234 . 2 (𝐴 No → dom 𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑥)})
6129, 60eqssd 3967 1 (𝐴 No {𝑥 ∈ On ∣ (𝐴𝑥) ≠ ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑥)} = dom 𝐴)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 206  wa 395  wo 847  w3a 1086   = wceq 1540  wcel 2109  wne 2926  wral 3045  {crab 3408  cun 3915  cin 3916  wss 3917  c0 4299  {csn 4592  {cpr 4594  cop 4598   cint 4913  dom cdm 5641  Ord word 6334  Oncon0 6335  Fun wfun 6508   Fn wfn 6509  cfv 6514  1oc1o 8430  2oc2o 8431   No csur 27558
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2702  ax-sep 5254  ax-nul 5264  ax-pow 5323  ax-pr 5390  ax-un 7714
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2534  df-eu 2563  df-clab 2709  df-cleq 2722  df-clel 2804  df-ne 2927  df-ral 3046  df-rex 3055  df-rab 3409  df-v 3452  df-dif 3920  df-un 3922  df-in 3924  df-ss 3934  df-pss 3937  df-nul 4300  df-if 4492  df-pw 4568  df-sn 4593  df-pr 4595  df-op 4599  df-uni 4875  df-int 4914  df-br 5111  df-opab 5173  df-tr 5218  df-id 5536  df-eprel 5541  df-po 5549  df-so 5550  df-fr 5594  df-we 5596  df-xp 5647  df-rel 5648  df-cnv 5649  df-co 5650  df-dm 5651  df-rn 5652  df-res 5653  df-ima 5654  df-ord 6338  df-on 6339  df-suc 6341  df-iota 6467  df-fun 6516  df-fn 6517  df-f 6518  df-fv 6522  df-1o 8437  df-2o 8438  df-no 27561
This theorem is referenced by:  noextendlt  27588  noextendgt  27589
  Copyright terms: Public domain W3C validator