Theorem noextenddif 28082

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 28064	. . 3 ⊢ (𝐴 ∈ No → dom 𝐴 ∈ On)
2		noextend.1	. . . . . 6 ⊢ 𝑋 ∈ {1o, 2o}
3	2	nosgnn0i 28073	. . . . 5 ⊢ ∅ ≠ 𝑋
4	3	a1i 11	. . . 4 ⊢ (𝐴 ∈ No → ∅ ≠ 𝑋)
5		nodmord 28067	. . . . . 6 ⊢ (𝐴 ∈ No → Ord dom 𝐴)
6		ordirr 6406	. . . . . 6 ⊢ (Ord dom 𝐴 → ¬ dom 𝐴 ∈ dom 𝐴)
7	5, 6	syl 18	. . . . 5 ⊢ (𝐴 ∈ No → ¬ dom 𝐴 ∈ dom 𝐴)
8		ndmfv 6948	. . . . 5 ⊢ (¬ dom 𝐴 ∈ dom 𝐴 → (𝐴‘dom 𝐴) = ∅)
9	7, 8	syl 18	. . . 4 ⊢ (𝐴 ∈ No → (𝐴‘dom 𝐴) = ∅)
10		nofun 28063	. . . . . . 7 ⊢ (𝐴 ∈ No → Fun 𝐴)
11		funfn 6598	. . . . . . 7 ⊢ (Fun 𝐴 ↔ 𝐴 Fn dom 𝐴)
12	10, 11	sylib 221	. . . . . 6 ⊢ (𝐴 ∈ No → 𝐴 Fn dom 𝐴)
13		fnsng 6622	. . . . . . 7 ⊢ ((dom 𝐴 ∈ On ∧ 𝑋 ∈ {1o, 2o}) → {⟨dom 𝐴, 𝑋⟩} Fn {dom 𝐴})
14	1, 2, 13	sylancl 598	. . . . . 6 ⊢ (𝐴 ∈ No → {⟨dom 𝐴, 𝑋⟩} Fn {dom 𝐴})
15		disjsn 4673	. . . . . . 7 ⊢ ((dom 𝐴 ∩ {dom 𝐴}) = ∅ ↔ ¬ dom 𝐴 ∈ dom 𝐴)
16	7, 15	sylibr 237	. . . . . 6 ⊢ (𝐴 ∈ No → (dom 𝐴 ∩ {dom 𝐴}) = ∅)
17		snidg 4622	. . . . . . 7 ⊢ (dom 𝐴 ∈ On → dom 𝐴 ∈ {dom 𝐴})
18	1, 17	syl 18	. . . . . 6 ⊢ (𝐴 ∈ No → dom 𝐴 ∈ {dom 𝐴})
19		fvun2 7008	. . . . . 6 ⊢ ((𝐴 Fn dom 𝐴 ∧ {⟨dom 𝐴, 𝑋⟩} Fn {dom 𝐴} ∧ ((dom 𝐴 ∩ {dom 𝐴}) = ∅ ∧ dom 𝐴 ∈ {dom 𝐴})) → ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘dom 𝐴) = ({⟨dom 𝐴, 𝑋⟩}‘dom 𝐴))
20	12, 14, 16, 18, 19	syl112anc 1402	. . . . 5 ⊢ (𝐴 ∈ No → ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘dom 𝐴) = ({⟨dom 𝐴, 𝑋⟩}‘dom 𝐴))
21		fvsng 7216	. . . . . 6 ⊢ ((dom 𝐴 ∈ On ∧ 𝑋 ∈ {1o, 2o}) → ({⟨dom 𝐴, 𝑋⟩}‘dom 𝐴) = 𝑋)
22	1, 2, 21	sylancl 598	. . . . 5 ⊢ (𝐴 ∈ No → ({⟨dom 𝐴, 𝑋⟩}‘dom 𝐴) = 𝑋)
23	20, 22	eqtrd 2798	. . . 4 ⊢ (𝐴 ∈ No → ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘dom 𝐴) = 𝑋)
24	4, 9, 23	3netr4d 3036	. . 3 ⊢ (𝐴 ∈ No → (𝐴‘dom 𝐴) ≠ ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘dom 𝐴))
25		fveq2 6916	. . . . 5 ⊢ (𝑥 = dom 𝐴 → (𝐴‘𝑥) = (𝐴‘dom 𝐴))
26		fveq2 6916	. . . . 5 ⊢ (𝑥 = dom 𝐴 → ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑥) = ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘dom 𝐴))
27	25, 26	neeq12d 3020	. . . 4 ⊢ (𝑥 = dom 𝐴 → ((𝐴‘𝑥) ≠ ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑥) ↔ (𝐴‘dom 𝐴) ≠ ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘dom 𝐴)))
28	27	onintss 6441	. . 3 ⊢ (dom 𝐴 ∈ On → ((𝐴‘dom 𝐴) ≠ ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘dom 𝐴) → ∩ {𝑥 ∈ On ∣ (𝐴‘𝑥) ≠ ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑥)} ⊆ dom 𝐴))
29	1, 24, 28	sylc 66	. 2 ⊢ (𝐴 ∈ No → ∩ {𝑥 ∈ On ∣ (𝐴‘𝑥) ≠ ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑥)} ⊆ dom 𝐴)
30		eloni 6398	. . . . . . . 8 ⊢ (𝑦 ∈ On → Ord 𝑦)
31		ordtri2 6424	. . . . . . . . . 10 ⊢ ((Ord 𝑦 ∧ Ord dom 𝐴) → (𝑦 ∈ dom 𝐴 ↔ ¬ (𝑦 = dom 𝐴 ∨ dom 𝐴 ∈ 𝑦)))
32		eqcom 2770	. . . . . . . . . . . . 13 ⊢ (𝑦 = dom 𝐴 ↔ dom 𝐴 = 𝑦)
33	32	orbi1i 927	. . . . . . . . . . . 12 ⊢ ((𝑦 = dom 𝐴 ∨ dom 𝐴 ∈ 𝑦) ↔ (dom 𝐴 = 𝑦 ∨ dom 𝐴 ∈ 𝑦))
34		orcom 884	. . . . . . . . . . . 12 ⊢ ((dom 𝐴 = 𝑦 ∨ dom 𝐴 ∈ 𝑦) ↔ (dom 𝐴 ∈ 𝑦 ∨ dom 𝐴 = 𝑦))
35	33, 34	bitri 278	. . . . . . . . . . 11 ⊢ ((𝑦 = dom 𝐴 ∨ dom 𝐴 ∈ 𝑦) ↔ (dom 𝐴 ∈ 𝑦 ∨ dom 𝐴 = 𝑦))
36	35	notbii 323	. . . . . . . . . 10 ⊢ (¬ (𝑦 = dom 𝐴 ∨ dom 𝐴 ∈ 𝑦) ↔ ¬ (dom 𝐴 ∈ 𝑦 ∨ dom 𝐴 = 𝑦))
37	31, 36	bitrdi 290	. . . . . . . . 9 ⊢ ((Ord 𝑦 ∧ Ord dom 𝐴) → (𝑦 ∈ dom 𝐴 ↔ ¬ (dom 𝐴 ∈ 𝑦 ∨ dom 𝐴 = 𝑦)))
38		ordsseleq 6418	. . . . . . . . . . 11 ⊢ ((Ord dom 𝐴 ∧ Ord 𝑦) → (dom 𝐴 ⊆ 𝑦 ↔ (dom 𝐴 ∈ 𝑦 ∨ dom 𝐴 = 𝑦)))
39	38	notbid 321	. . . . . . . . . 10 ⊢ ((Ord dom 𝐴 ∧ Ord 𝑦) → (¬ dom 𝐴 ⊆ 𝑦 ↔ ¬ (dom 𝐴 ∈ 𝑦 ∨ dom 𝐴 = 𝑦)))
40	39	ancoms 464	. . . . . . . . 9 ⊢ ((Ord 𝑦 ∧ Ord dom 𝐴) → (¬ dom 𝐴 ⊆ 𝑦 ↔ ¬ (dom 𝐴 ∈ 𝑦 ∨ dom 𝐴 = 𝑦)))
41	37, 40	bitr4d 285	. . . . . . . 8 ⊢ ((Ord 𝑦 ∧ Ord dom 𝐴) → (𝑦 ∈ dom 𝐴 ↔ ¬ dom 𝐴 ⊆ 𝑦))
42	30, 5, 41	syl2anr 609	. . . . . . 7 ⊢ ((𝐴 ∈ No ∧ 𝑦 ∈ On) → (𝑦 ∈ dom 𝐴 ↔ ¬ dom 𝐴 ⊆ 𝑦))
43	12	3ad2ant1 1151	. . . . . . . . . 10 ⊢ ((𝐴 ∈ No ∧ 𝑦 ∈ On ∧ 𝑦 ∈ dom 𝐴) → 𝐴 Fn dom 𝐴)
44	14	3ad2ant1 1151	. . . . . . . . . 10 ⊢ ((𝐴 ∈ No ∧ 𝑦 ∈ On ∧ 𝑦 ∈ dom 𝐴) → {⟨dom 𝐴, 𝑋⟩} Fn {dom 𝐴})
45	16	3ad2ant1 1151	. . . . . . . . . 10 ⊢ ((𝐴 ∈ No ∧ 𝑦 ∈ On ∧ 𝑦 ∈ dom 𝐴) → (dom 𝐴 ∩ {dom 𝐴}) = ∅)
46		simp3 1156	. . . . . . . . . 10 ⊢ ((𝐴 ∈ No ∧ 𝑦 ∈ On ∧ 𝑦 ∈ dom 𝐴) → 𝑦 ∈ dom 𝐴)
47		fvun1 7007	. . . . . . . . . 10 ⊢ ((𝐴 Fn dom 𝐴 ∧ {⟨dom 𝐴, 𝑋⟩} Fn {dom 𝐴} ∧ ((dom 𝐴 ∩ {dom 𝐴}) = ∅ ∧ 𝑦 ∈ dom 𝐴)) → ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑦) = (𝐴‘𝑦))
48	43, 44, 45, 46, 47	syl112anc 1402	. . . . . . . . 9 ⊢ ((𝐴 ∈ No ∧ 𝑦 ∈ On ∧ 𝑦 ∈ dom 𝐴) → ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑦) = (𝐴‘𝑦))
49	48	eqcomd 2769	. . . . . . . 8 ⊢ ((𝐴 ∈ No ∧ 𝑦 ∈ On ∧ 𝑦 ∈ dom 𝐴) → (𝐴‘𝑦) = ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑦))
50	49	3expia 1139	. . . . . . 7 ⊢ ((𝐴 ∈ No ∧ 𝑦 ∈ On) → (𝑦 ∈ dom 𝐴 → (𝐴‘𝑦) = ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑦)))
51	42, 50	sylbird 263	. . . . . 6 ⊢ ((𝐴 ∈ No ∧ 𝑦 ∈ On) → (¬ dom 𝐴 ⊆ 𝑦 → (𝐴‘𝑦) = ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑦)))
52	51	necon1ad 2976	. . . . 5 ⊢ ((𝐴 ∈ No ∧ 𝑦 ∈ On) → ((𝐴‘𝑦) ≠ ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑦) → dom 𝐴 ⊆ 𝑦))
53	52	ralrimiva 3158	. . . 4 ⊢ (𝐴 ∈ No → ∀𝑦 ∈ On ((𝐴‘𝑦) ≠ ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑦) → dom 𝐴 ⊆ 𝑦))
54		fveq2 6916	. . . . . 6 ⊢ (𝑥 = 𝑦 → (𝐴‘𝑥) = (𝐴‘𝑦))
55		fveq2 6916	. . . . . 6 ⊢ (𝑥 = 𝑦 → ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑥) = ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑦))
56	54, 55	neeq12d 3020	. . . . 5 ⊢ (𝑥 = 𝑦 → ((𝐴‘𝑥) ≠ ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑥) ↔ (𝐴‘𝑦) ≠ ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑦)))
57	56	ralrab 3655	. . . 4 ⊢ (∀𝑦 ∈ {𝑥 ∈ On ∣ (𝐴‘𝑥) ≠ ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑥)}dom 𝐴 ⊆ 𝑦 ↔ ∀𝑦 ∈ On ((𝐴‘𝑦) ≠ ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑦) → dom 𝐴 ⊆ 𝑦))
58	53, 57	sylibr 237	. . 3 ⊢ (𝐴 ∈ No → ∀𝑦 ∈ {𝑥 ∈ On ∣ (𝐴‘𝑥) ≠ ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑥)}dom 𝐴 ⊆ 𝑦)
59		ssint 4929	. . 3 ⊢ (dom 𝐴 ⊆ ∩ {𝑥 ∈ On ∣ (𝐴‘𝑥) ≠ ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑥)} ↔ ∀𝑦 ∈ {𝑥 ∈ On ∣ (𝐴‘𝑥) ≠ ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑥)}dom 𝐴 ⊆ 𝑦)
60	58, 59	sylibr 237	. 2 ⊢ (𝐴 ∈ No → dom 𝐴 ⊆ ∩ {𝑥 ∈ On ∣ (𝐴‘𝑥) ≠ ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑥)})
61	29, 60	eqssd 3930	1 ⊢ (𝐴 ∈ No → ∩ {𝑥 ∈ On ∣ (𝐴‘𝑥) ≠ ((𝐴 ∪ {⟨dom 𝐴, 𝑋⟩})‘𝑥)} = dom 𝐴)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∨ wo 861   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147   ≠ wne 2959  ∀wral 3080  {crab 3416   ⊆ wss 3900   ∩ cin 4092   ∪ cun 4152  ∅c0 4281  {csn 4588  {cpr 4590  ⟨cop 4840  ∩ cint 4912  dom cdm 5658  Ord word 6387  Oncon0 6388  Fun wfun 6560   Fn wfn 6561  ‘cfv 6566  1_oc1o 8507  2_oc2o 8508  Nocsur 28054

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-int 4913  df-br 5109  df-opab 5174  df-tr 5219  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-ord 6391  df-on 6392  df-suc 6394  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-fv 6574  df-1o 8514  df-2o 8515  df-no 28057

This theorem is used by:  noextendlt  28083  noextendgt  28084