Theorem noextenddif 33798

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.

Step	Hyp	Ref	Expression
1		nodmon 33780	. . 3 ⊢ (𝐴 ∈ No → dom 𝐴 ∈ On)
2		noextend.1	. . . . . 6 ⊢ 𝑋 ∈ {1o, 2o}
3	2	nosgnn0i 33789	. . . . 5 ⊢ ∅ ≠ 𝑋
4	3	a1i 11	. . . 4 ⊢ (𝐴 ∈ No → ∅ ≠ 𝑋)
5		nodmord 33783	. . . . . 6 ⊢ (𝐴 ∈ No → Ord dom 𝐴)
6		ordirr 6269	. . . . . 6 ⊢ (Ord dom 𝐴 → ¬ dom 𝐴 ∈ dom 𝐴)
7	5, 6	syl 17	. . . . 5 ⊢ (𝐴 ∈ No → ¬ dom 𝐴 ∈ dom 𝐴)
8		ndmfv 6786	. . . . 5 ⊢ (¬ dom 𝐴 ∈ dom 𝐴 → (𝐴‘dom 𝐴) = ∅)
9	7, 8	syl 17	. . . 4 ⊢ (𝐴 ∈ No → (𝐴‘dom 𝐴) = ∅)
10		nofun 33779	. . . . . . 7 ⊢ (𝐴 ∈ No → Fun 𝐴)
11		funfn 6448	. . . . . . 7 ⊢ (Fun 𝐴 ↔ 𝐴 Fn dom 𝐴)
12	10, 11	sylib 217	. . . . . 6 ⊢ (𝐴 ∈ No → 𝐴 Fn dom 𝐴)
13		fnsng 6470	. . . . . . 7 ⊢ ((dom 𝐴 ∈ On ∧ 𝑋 ∈ {1o, 2o}) → {⟨dom 𝐴, 𝑋⟩} Fn {dom 𝐴})
14	1, 2, 13	sylancl 585	. . . . . 6 ⊢ (𝐴 ∈ No → {⟨dom 𝐴, 𝑋⟩} Fn {dom 𝐴})
15		disjsn 4644	. . . . . . 7 ⊢ ((dom 𝐴 ∩ {dom 𝐴}) = ∅ ↔ ¬ dom 𝐴 ∈ dom 𝐴)
16	7, 15	sylibr 233	. . . . . 6 ⊢ (𝐴 ∈ No → (dom 𝐴 ∩ {dom 𝐴}) = ∅)
17		snidg 4592	. . . . . . 7 ⊢ (dom 𝐴 ∈ On → dom 𝐴 ∈ {dom 𝐴})
18	1, 17	syl 17	. . . . . 6 ⊢ (𝐴 ∈ No → dom 𝐴 ∈ {dom 𝐴})
19		fvun2 6842	. . . . . 6 ⊢ ((𝐴 Fn dom 𝐴 ∧ {⟨dom 𝐴, 𝑋⟩} Fn {dom 𝐴} ∧ ((dom 𝐴 ∩ {dom 𝐴}) = ∅ ∧ dom 𝐴 ∈ {dom 𝐴})) → ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘dom 𝐴) = ({⟨dom 𝐴, 𝑋⟩}‘dom 𝐴))
20	12, 14, 16, 18, 19	syl112anc 1372	. . . . 5 ⊢ (𝐴 ∈ No → ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘dom 𝐴) = ({⟨dom 𝐴, 𝑋⟩}‘dom 𝐴))
21		fvsng 7034	. . . . . 6 ⊢ ((dom 𝐴 ∈ On ∧ 𝑋 ∈ {1o, 2o}) → ({⟨dom 𝐴, 𝑋⟩}‘dom 𝐴) = 𝑋)
22	1, 2, 21	sylancl 585	. . . . 5 ⊢ (𝐴 ∈ No → ({⟨dom 𝐴, 𝑋⟩}‘dom 𝐴) = 𝑋)
23	20, 22	eqtrd 2778	. . . 4 ⊢ (𝐴 ∈ No → ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘dom 𝐴) = 𝑋)
24	4, 9, 23	3netr4d 3020	. . 3 ⊢ (𝐴 ∈ No → (𝐴‘dom 𝐴) ≠ ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘dom 𝐴))
25		fveq2 6756	. . . . 5 ⊢ (𝑥 = dom 𝐴 → (𝐴‘𝑥) = (𝐴‘dom 𝐴))
26		fveq2 6756	. . . . 5 ⊢ (𝑥 = dom 𝐴 → ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑥) = ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘dom 𝐴))
27	25, 26	neeq12d 3004	. . . 4 ⊢ (𝑥 = dom 𝐴 → ((𝐴‘𝑥) ≠ ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑥) ↔ (𝐴‘dom 𝐴) ≠ ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘dom 𝐴)))
28	27	onintss 6301	. . 3 ⊢ (dom 𝐴 ∈ On → ((𝐴‘dom 𝐴) ≠ ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘dom 𝐴) → ∩ {𝑥 ∈ On ∣ (𝐴‘𝑥) ≠ ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑥)} ⊆ dom 𝐴))
29	1, 24, 28	sylc 65	. 2 ⊢ (𝐴 ∈ No → ∩ {𝑥 ∈ On ∣ (𝐴‘𝑥) ≠ ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑥)} ⊆ dom 𝐴)
30		eloni 6261	. . . . . . . 8 ⊢ (𝑦 ∈ On → Ord 𝑦)
31		ordtri2 6286	. . . . . . . . . 10 ⊢ ((Ord 𝑦 ∧ Ord dom 𝐴) → (𝑦 ∈ dom 𝐴 ↔ ¬ (𝑦 = dom 𝐴 ∨ dom 𝐴 ∈ 𝑦)))
32		eqcom 2745	. . . . . . . . . . . . 13 ⊢ (𝑦 = dom 𝐴 ↔ dom 𝐴 = 𝑦)
33	32	orbi1i 910	. . . . . . . . . . . 12 ⊢ ((𝑦 = dom 𝐴 ∨ dom 𝐴 ∈ 𝑦) ↔ (dom 𝐴 = 𝑦 ∨ dom 𝐴 ∈ 𝑦))
34		orcom 866	. . . . . . . . . . . 12 ⊢ ((dom 𝐴 = 𝑦 ∨ dom 𝐴 ∈ 𝑦) ↔ (dom 𝐴 ∈ 𝑦 ∨ dom 𝐴 = 𝑦))
35	33, 34	bitri 274	. . . . . . . . . . 11 ⊢ ((𝑦 = dom 𝐴 ∨ dom 𝐴 ∈ 𝑦) ↔ (dom 𝐴 ∈ 𝑦 ∨ dom 𝐴 = 𝑦))
36	35	notbii 319	. . . . . . . . . 10 ⊢ (¬ (𝑦 = dom 𝐴 ∨ dom 𝐴 ∈ 𝑦) ↔ ¬ (dom 𝐴 ∈ 𝑦 ∨ dom 𝐴 = 𝑦))
37	31, 36	bitrdi 286	. . . . . . . . 9 ⊢ ((Ord 𝑦 ∧ Ord dom 𝐴) → (𝑦 ∈ dom 𝐴 ↔ ¬ (dom 𝐴 ∈ 𝑦 ∨ dom 𝐴 = 𝑦)))
38		ordsseleq 6280	. . . . . . . . . . 11 ⊢ ((Ord dom 𝐴 ∧ Ord 𝑦) → (dom 𝐴 ⊆ 𝑦 ↔ (dom 𝐴 ∈ 𝑦 ∨ dom 𝐴 = 𝑦)))
39	38	notbid 317	. . . . . . . . . 10 ⊢ ((Ord dom 𝐴 ∧ Ord 𝑦) → (¬ dom 𝐴 ⊆ 𝑦 ↔ ¬ (dom 𝐴 ∈ 𝑦 ∨ dom 𝐴 = 𝑦)))
40	39	ancoms 458	. . . . . . . . 9 ⊢ ((Ord 𝑦 ∧ Ord dom 𝐴) → (¬ dom 𝐴 ⊆ 𝑦 ↔ ¬ (dom 𝐴 ∈ 𝑦 ∨ dom 𝐴 = 𝑦)))
41	37, 40	bitr4d 281	. . . . . . . 8 ⊢ ((Ord 𝑦 ∧ Ord dom 𝐴) → (𝑦 ∈ dom 𝐴 ↔ ¬ dom 𝐴 ⊆ 𝑦))
42	30, 5, 41	syl2anr 596	. . . . . . 7 ⊢ ((𝐴 ∈ No ∧ 𝑦 ∈ On) → (𝑦 ∈ dom 𝐴 ↔ ¬ dom 𝐴 ⊆ 𝑦))
43	12	3ad2ant1 1131	. . . . . . . . . 10 ⊢ ((𝐴 ∈ No ∧ 𝑦 ∈ On ∧ 𝑦 ∈ dom 𝐴) → 𝐴 Fn dom 𝐴)
44	14	3ad2ant1 1131	. . . . . . . . . 10 ⊢ ((𝐴 ∈ No ∧ 𝑦 ∈ On ∧ 𝑦 ∈ dom 𝐴) → {⟨dom 𝐴, 𝑋⟩} Fn {dom 𝐴})
45	16	3ad2ant1 1131	. . . . . . . . . 10 ⊢ ((𝐴 ∈ No ∧ 𝑦 ∈ On ∧ 𝑦 ∈ dom 𝐴) → (dom 𝐴 ∩ {dom 𝐴}) = ∅)
46		simp3 1136	. . . . . . . . . 10 ⊢ ((𝐴 ∈ No ∧ 𝑦 ∈ On ∧ 𝑦 ∈ dom 𝐴) → 𝑦 ∈ dom 𝐴)
47		fvun1 6841	. . . . . . . . . 10 ⊢ ((𝐴 Fn dom 𝐴 ∧ {⟨dom 𝐴, 𝑋⟩} Fn {dom 𝐴} ∧ ((dom 𝐴 ∩ {dom 𝐴}) = ∅ ∧ 𝑦 ∈ dom 𝐴)) → ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑦) = (𝐴‘𝑦))
48	43, 44, 45, 46, 47	syl112anc 1372	. . . . . . . . 9 ⊢ ((𝐴 ∈ No ∧ 𝑦 ∈ On ∧ 𝑦 ∈ dom 𝐴) → ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑦) = (𝐴‘𝑦))
49	48	eqcomd 2744	. . . . . . . 8 ⊢ ((𝐴 ∈ No ∧ 𝑦 ∈ On ∧ 𝑦 ∈ dom 𝐴) → (𝐴‘𝑦) = ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑦))
50	49	3expia 1119	. . . . . . 7 ⊢ ((𝐴 ∈ No ∧ 𝑦 ∈ On) → (𝑦 ∈ dom 𝐴 → (𝐴‘𝑦) = ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑦)))
51	42, 50	sylbird 259	. . . . . 6 ⊢ ((𝐴 ∈ No ∧ 𝑦 ∈ On) → (¬ dom 𝐴 ⊆ 𝑦 → (𝐴‘𝑦) = ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑦)))
52	51	necon1ad 2959	. . . . 5 ⊢ ((𝐴 ∈ No ∧ 𝑦 ∈ On) → ((𝐴‘𝑦) ≠ ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑦) → dom 𝐴 ⊆ 𝑦))
53	52	ralrimiva 3107	. . . 4 ⊢ (𝐴 ∈ No → ∀𝑦 ∈ On ((𝐴‘𝑦) ≠ ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑦) → dom 𝐴 ⊆ 𝑦))
54		fveq2 6756	. . . . . 6 ⊢ (𝑥 = 𝑦 → (𝐴‘𝑥) = (𝐴‘𝑦))
55		fveq2 6756	. . . . . 6 ⊢ (𝑥 = 𝑦 → ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑥) = ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑦))
56	54, 55	neeq12d 3004	. . . . 5 ⊢ (𝑥 = 𝑦 → ((𝐴‘𝑥) ≠ ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑥) ↔ (𝐴‘𝑦) ≠ ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑦)))
57	56	ralrab 3623	. . . 4 ⊢ (∀𝑦 ∈ {𝑥 ∈ On ∣ (𝐴‘𝑥) ≠ ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑥)}dom 𝐴 ⊆ 𝑦 ↔ ∀𝑦 ∈ On ((𝐴‘𝑦) ≠ ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑦) → dom 𝐴 ⊆ 𝑦))
58	53, 57	sylibr 233	. . 3 ⊢ (𝐴 ∈ No → ∀𝑦 ∈ {𝑥 ∈ On ∣ (𝐴‘𝑥) ≠ ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑥)}dom 𝐴 ⊆ 𝑦)
59		ssint 4892	. . 3 ⊢ (dom 𝐴 ⊆ ∩ {𝑥 ∈ On ∣ (𝐴‘𝑥) ≠ ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑥)} ↔ ∀𝑦 ∈ {𝑥 ∈ On ∣ (𝐴‘𝑥) ≠ ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑥)}dom 𝐴 ⊆ 𝑦)
60	58, 59	sylibr 233	. 2 ⊢ (𝐴 ∈ No → dom 𝐴 ⊆ ∩ {𝑥 ∈ On ∣ (𝐴‘𝑥) ≠ ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑥)})
61	29, 60	eqssd 3934	1 ⊢ (𝐴 ∈ No → ∩ {𝑥 ∈ On ∣ (𝐴‘𝑥) ≠ ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑥)} = dom 𝐴)

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 205   ∧ wa 395   ∨ wo 843   ∧ w3a 1085   = wceq 1539   ∈ wcel 2108   ≠ wne 2942  ∀wral 3063  {crab 3067   ∪ cun 3881   ∩ cin 3882   ⊆ wss 3883  ∅c0 4253  {csn 4558  {cpr 4560  ⟨cop 4564  ∩ cint 4876  dom cdm 5580  Ord word 6250  Oncon0 6251  Fun wfun 6412   Fn wfn 6413  ‘cfv 6418  1_oc1o 8260  2_oc2o 8261   No csur 33770

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-rep 5205  ax-sep 5218  ax-nul 5225  ax-pr 5347

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-reu 3070  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-op 4565  df-uni 4837  df-int 4877  df-iun 4923  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-f1 6423  df-fo 6424  df-f1o 6425  df-fv 6426  df-1o 8267  df-2o 8268  df-no 33773

This theorem is referenced by:  noextendlt  33799  noextendgt  33800