Theorem nolesgn2ores 27617

Description: Given 𝐴 less-than or equal to 𝐵, equal to 𝐵 up to 𝑋, and 𝐴(𝑋) = 2_o, then (𝐴 ↾ suc 𝑋) = (𝐵 ↾ suc 𝑋). (Contributed by Scott Fenton, 6-Dec-2021.)

Assertion

Ref	Expression
nolesgn2ores	⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 2o) ∧ ¬ 𝐵 <s 𝐴) → (𝐴 ↾ suc 𝑋) = (𝐵 ↾ suc 𝑋))

Proof of Theorem nolesgn2ores

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		dmres 5972	. . . 4 ⊢ dom (𝐴 ↾ suc 𝑋) = (suc 𝑋 ∩ dom 𝐴)
2		simp11 1204	. . . . . . 7 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 2o) ∧ ¬ 𝐵 <s 𝐴) → 𝐴 ∈ No )
3		nodmord 27598	. . . . . . 7 ⊢ (𝐴 ∈ No → Ord dom 𝐴)
4	2, 3	syl 17	. . . . . 6 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 2o) ∧ ¬ 𝐵 <s 𝐴) → Ord dom 𝐴)
5		ndmfv 6875	. . . . . . . . . 10 ⊢ (¬ 𝑋 ∈ dom 𝐴 → (𝐴‘𝑋) = ∅)
6		2on 8424	. . . . . . . . . . . . . . 15 ⊢ 2o ∈ On
7	6	elexi 3467	. . . . . . . . . . . . . 14 ⊢ 2o ∈ V
8	7	prid2 4723	. . . . . . . . . . . . 13 ⊢ 2o ∈ {1o, 2o}
9	8	nosgnn0i 27604	. . . . . . . . . . . 12 ⊢ ∅ ≠ 2o
10		neeq1 2987	. . . . . . . . . . . 12 ⊢ ((𝐴‘𝑋) = ∅ → ((𝐴‘𝑋) ≠ 2o ↔ ∅ ≠ 2o))
11	9, 10	mpbiri 258	. . . . . . . . . . 11 ⊢ ((𝐴‘𝑋) = ∅ → (𝐴‘𝑋) ≠ 2o)
12	11	neneqd 2930	. . . . . . . . . 10 ⊢ ((𝐴‘𝑋) = ∅ → ¬ (𝐴‘𝑋) = 2o)
13	5, 12	syl 17	. . . . . . . . 9 ⊢ (¬ 𝑋 ∈ dom 𝐴 → ¬ (𝐴‘𝑋) = 2o)
14	13	con4i 114	. . . . . . . 8 ⊢ ((𝐴‘𝑋) = 2o → 𝑋 ∈ dom 𝐴)
15	14	adantl 481	. . . . . . 7 ⊢ (((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 2o) → 𝑋 ∈ dom 𝐴)
16	15	3ad2ant2 1134	. . . . . 6 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 2o) ∧ ¬ 𝐵 <s 𝐴) → 𝑋 ∈ dom 𝐴)
17		ordsucss 7773	. . . . . 6 ⊢ (Ord dom 𝐴 → (𝑋 ∈ dom 𝐴 → suc 𝑋 ⊆ dom 𝐴))
18	4, 16, 17	sylc 65	. . . . 5 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 2o) ∧ ¬ 𝐵 <s 𝐴) → suc 𝑋 ⊆ dom 𝐴)
19		dfss2 3929	. . . . 5 ⊢ (suc 𝑋 ⊆ dom 𝐴 ↔ (suc 𝑋 ∩ dom 𝐴) = suc 𝑋)
20	18, 19	sylib 218	. . . 4 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 2o) ∧ ¬ 𝐵 <s 𝐴) → (suc 𝑋 ∩ dom 𝐴) = suc 𝑋)
21	1, 20	eqtrid 2776	. . 3 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 2o) ∧ ¬ 𝐵 <s 𝐴) → dom (𝐴 ↾ suc 𝑋) = suc 𝑋)
22		dmres 5972	. . . 4 ⊢ dom (𝐵 ↾ suc 𝑋) = (suc 𝑋 ∩ dom 𝐵)
23		simp12 1205	. . . . . . 7 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 2o) ∧ ¬ 𝐵 <s 𝐴) → 𝐵 ∈ No )
24		nodmord 27598	. . . . . . 7 ⊢ (𝐵 ∈ No → Ord dom 𝐵)
25	23, 24	syl 17	. . . . . 6 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 2o) ∧ ¬ 𝐵 <s 𝐴) → Ord dom 𝐵)
26		nolesgn2o 27616	. . . . . . 7 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 2o) ∧ ¬ 𝐵 <s 𝐴) → (𝐵‘𝑋) = 2o)
27		ndmfv 6875	. . . . . . . . 9 ⊢ (¬ 𝑋 ∈ dom 𝐵 → (𝐵‘𝑋) = ∅)
28		neeq1 2987	. . . . . . . . . . 11 ⊢ ((𝐵‘𝑋) = ∅ → ((𝐵‘𝑋) ≠ 2o ↔ ∅ ≠ 2o))
29	9, 28	mpbiri 258	. . . . . . . . . 10 ⊢ ((𝐵‘𝑋) = ∅ → (𝐵‘𝑋) ≠ 2o)
30	29	neneqd 2930	. . . . . . . . 9 ⊢ ((𝐵‘𝑋) = ∅ → ¬ (𝐵‘𝑋) = 2o)
31	27, 30	syl 17	. . . . . . . 8 ⊢ (¬ 𝑋 ∈ dom 𝐵 → ¬ (𝐵‘𝑋) = 2o)
32	31	con4i 114	. . . . . . 7 ⊢ ((𝐵‘𝑋) = 2o → 𝑋 ∈ dom 𝐵)
33	26, 32	syl 17	. . . . . 6 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 2o) ∧ ¬ 𝐵 <s 𝐴) → 𝑋 ∈ dom 𝐵)
34		ordsucss 7773	. . . . . 6 ⊢ (Ord dom 𝐵 → (𝑋 ∈ dom 𝐵 → suc 𝑋 ⊆ dom 𝐵))
35	25, 33, 34	sylc 65	. . . . 5 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 2o) ∧ ¬ 𝐵 <s 𝐴) → suc 𝑋 ⊆ dom 𝐵)
36		dfss2 3929	. . . . 5 ⊢ (suc 𝑋 ⊆ dom 𝐵 ↔ (suc 𝑋 ∩ dom 𝐵) = suc 𝑋)
37	35, 36	sylib 218	. . . 4 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 2o) ∧ ¬ 𝐵 <s 𝐴) → (suc 𝑋 ∩ dom 𝐵) = suc 𝑋)
38	22, 37	eqtrid 2776	. . 3 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 2o) ∧ ¬ 𝐵 <s 𝐴) → dom (𝐵 ↾ suc 𝑋) = suc 𝑋)
39	21, 38	eqtr4d 2767	. 2 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 2o) ∧ ¬ 𝐵 <s 𝐴) → dom (𝐴 ↾ suc 𝑋) = dom (𝐵 ↾ suc 𝑋))
40	21	eleq2d 2814	. . . 4 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 2o) ∧ ¬ 𝐵 <s 𝐴) → (𝑥 ∈ dom (𝐴 ↾ suc 𝑋) ↔ 𝑥 ∈ suc 𝑋))
41		vex 3448	. . . . . . . . 9 ⊢ 𝑥 ∈ V
42	41	elsuc 6392	. . . . . . . 8 ⊢ (𝑥 ∈ suc 𝑋 ↔ (𝑥 ∈ 𝑋 ∨ 𝑥 = 𝑋))
43		simp2l 1200	. . . . . . . . . . . . 13 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 2o) ∧ ¬ 𝐵 <s 𝐴) → (𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋))
44	43	fveq1d 6842	. . . . . . . . . . . 12 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 2o) ∧ ¬ 𝐵 <s 𝐴) → ((𝐴 ↾ 𝑋)‘𝑥) = ((𝐵 ↾ 𝑋)‘𝑥))
45	44	adantr 480	. . . . . . . . . . 11 ⊢ ((((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 2o) ∧ ¬ 𝐵 <s 𝐴) ∧ 𝑥 ∈ 𝑋) → ((𝐴 ↾ 𝑋)‘𝑥) = ((𝐵 ↾ 𝑋)‘𝑥))
46		simpr 484	. . . . . . . . . . . 12 ⊢ ((((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 2o) ∧ ¬ 𝐵 <s 𝐴) ∧ 𝑥 ∈ 𝑋) → 𝑥 ∈ 𝑋)
47	46	fvresd 6860	. . . . . . . . . . 11 ⊢ ((((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 2o) ∧ ¬ 𝐵 <s 𝐴) ∧ 𝑥 ∈ 𝑋) → ((𝐴 ↾ 𝑋)‘𝑥) = (𝐴‘𝑥))
48	46	fvresd 6860	. . . . . . . . . . 11 ⊢ ((((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 2o) ∧ ¬ 𝐵 <s 𝐴) ∧ 𝑥 ∈ 𝑋) → ((𝐵 ↾ 𝑋)‘𝑥) = (𝐵‘𝑥))
49	45, 47, 48	3eqtr3d 2772	. . . . . . . . . 10 ⊢ ((((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 2o) ∧ ¬ 𝐵 <s 𝐴) ∧ 𝑥 ∈ 𝑋) → (𝐴‘𝑥) = (𝐵‘𝑥))
50	49	ex 412	. . . . . . . . 9 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 2o) ∧ ¬ 𝐵 <s 𝐴) → (𝑥 ∈ 𝑋 → (𝐴‘𝑥) = (𝐵‘𝑥)))
51		simp2r 1201	. . . . . . . . . . 11 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 2o) ∧ ¬ 𝐵 <s 𝐴) → (𝐴‘𝑋) = 2o)
52	51, 26	eqtr4d 2767	. . . . . . . . . 10 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 2o) ∧ ¬ 𝐵 <s 𝐴) → (𝐴‘𝑋) = (𝐵‘𝑋))
53		fveq2 6840	. . . . . . . . . . 11 ⊢ (𝑥 = 𝑋 → (𝐴‘𝑥) = (𝐴‘𝑋))
54		fveq2 6840	. . . . . . . . . . 11 ⊢ (𝑥 = 𝑋 → (𝐵‘𝑥) = (𝐵‘𝑋))
55	53, 54	eqeq12d 2745	. . . . . . . . . 10 ⊢ (𝑥 = 𝑋 → ((𝐴‘𝑥) = (𝐵‘𝑥) ↔ (𝐴‘𝑋) = (𝐵‘𝑋)))
56	52, 55	syl5ibrcom 247	. . . . . . . . 9 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 2o) ∧ ¬ 𝐵 <s 𝐴) → (𝑥 = 𝑋 → (𝐴‘𝑥) = (𝐵‘𝑥)))
57	50, 56	jaod 859	. . . . . . . 8 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 2o) ∧ ¬ 𝐵 <s 𝐴) → ((𝑥 ∈ 𝑋 ∨ 𝑥 = 𝑋) → (𝐴‘𝑥) = (𝐵‘𝑥)))
58	42, 57	biimtrid 242	. . . . . . 7 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 2o) ∧ ¬ 𝐵 <s 𝐴) → (𝑥 ∈ suc 𝑋 → (𝐴‘𝑥) = (𝐵‘𝑥)))
59	58	imp 406	. . . . . 6 ⊢ ((((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 2o) ∧ ¬ 𝐵 <s 𝐴) ∧ 𝑥 ∈ suc 𝑋) → (𝐴‘𝑥) = (𝐵‘𝑥))
60		simpr 484	. . . . . . 7 ⊢ ((((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 2o) ∧ ¬ 𝐵 <s 𝐴) ∧ 𝑥 ∈ suc 𝑋) → 𝑥 ∈ suc 𝑋)
61	60	fvresd 6860	. . . . . 6 ⊢ ((((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 2o) ∧ ¬ 𝐵 <s 𝐴) ∧ 𝑥 ∈ suc 𝑋) → ((𝐴 ↾ suc 𝑋)‘𝑥) = (𝐴‘𝑥))
62	60	fvresd 6860	. . . . . 6 ⊢ ((((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 2o) ∧ ¬ 𝐵 <s 𝐴) ∧ 𝑥 ∈ suc 𝑋) → ((𝐵 ↾ suc 𝑋)‘𝑥) = (𝐵‘𝑥))
63	59, 61, 62	3eqtr4d 2774	. . . . 5 ⊢ ((((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 2o) ∧ ¬ 𝐵 <s 𝐴) ∧ 𝑥 ∈ suc 𝑋) → ((𝐴 ↾ suc 𝑋)‘𝑥) = ((𝐵 ↾ suc 𝑋)‘𝑥))
64	63	ex 412	. . . 4 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 2o) ∧ ¬ 𝐵 <s 𝐴) → (𝑥 ∈ suc 𝑋 → ((𝐴 ↾ suc 𝑋)‘𝑥) = ((𝐵 ↾ suc 𝑋)‘𝑥)))
65	40, 64	sylbid 240	. . 3 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 2o) ∧ ¬ 𝐵 <s 𝐴) → (𝑥 ∈ dom (𝐴 ↾ suc 𝑋) → ((𝐴 ↾ suc 𝑋)‘𝑥) = ((𝐵 ↾ suc 𝑋)‘𝑥)))
66	65	ralrimiv 3124	. 2 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 2o) ∧ ¬ 𝐵 <s 𝐴) → ∀𝑥 ∈ dom (𝐴 ↾ suc 𝑋)((𝐴 ↾ suc 𝑋)‘𝑥) = ((𝐵 ↾ suc 𝑋)‘𝑥))
67		nofun 27594	. . . 4 ⊢ (𝐴 ∈ No → Fun 𝐴)
68		funres 6542	. . . 4 ⊢ (Fun 𝐴 → Fun (𝐴 ↾ suc 𝑋))
69	2, 67, 68	3syl 18	. . 3 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 2o) ∧ ¬ 𝐵 <s 𝐴) → Fun (𝐴 ↾ suc 𝑋))
70		nofun 27594	. . . 4 ⊢ (𝐵 ∈ No → Fun 𝐵)
71		funres 6542	. . . 4 ⊢ (Fun 𝐵 → Fun (𝐵 ↾ suc 𝑋))
72	23, 70, 71	3syl 18	. . 3 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 2o) ∧ ¬ 𝐵 <s 𝐴) → Fun (𝐵 ↾ suc 𝑋))
73		eqfunfv 6990	. . 3 ⊢ ((Fun (𝐴 ↾ suc 𝑋) ∧ Fun (𝐵 ↾ suc 𝑋)) → ((𝐴 ↾ suc 𝑋) = (𝐵 ↾ suc 𝑋) ↔ (dom (𝐴 ↾ suc 𝑋) = dom (𝐵 ↾ suc 𝑋) ∧ ∀𝑥 ∈ dom (𝐴 ↾ suc 𝑋)((𝐴 ↾ suc 𝑋)‘𝑥) = ((𝐵 ↾ suc 𝑋)‘𝑥))))
74	69, 72, 73	syl2anc 584	. 2 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 2o) ∧ ¬ 𝐵 <s 𝐴) → ((𝐴 ↾ suc 𝑋) = (𝐵 ↾ suc 𝑋) ↔ (dom (𝐴 ↾ suc 𝑋) = dom (𝐵 ↾ suc 𝑋) ∧ ∀𝑥 ∈ dom (𝐴 ↾ suc 𝑋)((𝐴 ↾ suc 𝑋)‘𝑥) = ((𝐵 ↾ suc 𝑋)‘𝑥))))
75	39, 66, 74	mpbir2and 713	1 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 2o) ∧ ¬ 𝐵 <s 𝐴) → (𝐴 ↾ suc 𝑋) = (𝐵 ↾ suc 𝑋))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395   ∨ wo 847   ∧ w3a 1086   = wceq 1540   ∈ wcel 2109   ≠ wne 2925  ∀wral 3044   ∩ cin 3910   ⊆ wss 3911  ∅c0 4292   class class class wbr 5102  dom cdm 5631   ↾ cres 5633  Ord word 6319  Oncon0 6320  suc csuc 6322  Fun wfun 6493  ‘cfv 6499  1_oc1o 8404  2_oc2o 8405   No csur 27584   <s cslt 27585

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 2701  ax-sep 5246  ax-nul 5256  ax-pow 5315  ax-pr 5382  ax-un 7691

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 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-rab 3403  df-v 3446  df-sbc 3751  df-csb 3860  df-dif 3914  df-un 3916  df-in 3918  df-ss 3928  df-pss 3931  df-nul 4293  df-if 4485  df-pw 4561  df-sn 4586  df-pr 4588  df-tp 4590  df-op 4592  df-uni 4868  df-br 5103  df-opab 5165  df-mpt 5184  df-tr 5210  df-id 5526  df-eprel 5531  df-po 5539  df-so 5540  df-fr 5584  df-we 5586  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-ord 6323  df-on 6324  df-suc 6326  df-iota 6452  df-fun 6501  df-fn 6502  df-f 6503  df-fv 6507  df-1o 8411  df-2o 8412  df-no 27587  df-slt 27588

This theorem is referenced by:  nosupbnd1lem3  27655