Theorem nogesgn1ores 27647

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

Assertion

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

Proof of Theorem nogesgn1ores

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		dmres 5972	. . . 4 ⊢ dom (𝐴 ↾ suc 𝑋) = (suc 𝑋 ∩ dom 𝐴)
2		simp11 1205	. . . . . . 7 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 1o) ∧ ¬ 𝐴 <s 𝐵) → 𝐴 ∈ No )
3		nodmord 27626	. . . . . . 7 ⊢ (𝐴 ∈ No → Ord dom 𝐴)
4	2, 3	syl 17	. . . . . 6 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 1o) ∧ ¬ 𝐴 <s 𝐵) → Ord dom 𝐴)
5		ndmfv 6867	. . . . . . . . . 10 ⊢ (¬ 𝑋 ∈ dom 𝐴 → (𝐴‘𝑋) = ∅)
6		1n0 8418	. . . . . . . . . . . . 13 ⊢ 1o ≠ ∅
7	6	necomi 2987	. . . . . . . . . . . 12 ⊢ ∅ ≠ 1o
8		neeq1 2995	. . . . . . . . . . . 12 ⊢ ((𝐴‘𝑋) = ∅ → ((𝐴‘𝑋) ≠ 1o ↔ ∅ ≠ 1o))
9	7, 8	mpbiri 258	. . . . . . . . . . 11 ⊢ ((𝐴‘𝑋) = ∅ → (𝐴‘𝑋) ≠ 1o)
10	9	neneqd 2938	. . . . . . . . . 10 ⊢ ((𝐴‘𝑋) = ∅ → ¬ (𝐴‘𝑋) = 1o)
11	5, 10	syl 17	. . . . . . . . 9 ⊢ (¬ 𝑋 ∈ dom 𝐴 → ¬ (𝐴‘𝑋) = 1o)
12	11	con4i 114	. . . . . . . 8 ⊢ ((𝐴‘𝑋) = 1o → 𝑋 ∈ dom 𝐴)
13	12	adantl 481	. . . . . . 7 ⊢ (((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 1o) → 𝑋 ∈ dom 𝐴)
14	13	3ad2ant2 1135	. . . . . 6 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 1o) ∧ ¬ 𝐴 <s 𝐵) → 𝑋 ∈ dom 𝐴)
15		ordsucss 7763	. . . . . 6 ⊢ (Ord dom 𝐴 → (𝑋 ∈ dom 𝐴 → suc 𝑋 ⊆ dom 𝐴))
16	4, 14, 15	sylc 65	. . . . 5 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 1o) ∧ ¬ 𝐴 <s 𝐵) → suc 𝑋 ⊆ dom 𝐴)
17		dfss2 3920	. . . . 5 ⊢ (suc 𝑋 ⊆ dom 𝐴 ↔ (suc 𝑋 ∩ dom 𝐴) = suc 𝑋)
18	16, 17	sylib 218	. . . 4 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 1o) ∧ ¬ 𝐴 <s 𝐵) → (suc 𝑋 ∩ dom 𝐴) = suc 𝑋)
19	1, 18	eqtrid 2784	. . 3 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 1o) ∧ ¬ 𝐴 <s 𝐵) → dom (𝐴 ↾ suc 𝑋) = suc 𝑋)
20		dmres 5972	. . . 4 ⊢ dom (𝐵 ↾ suc 𝑋) = (suc 𝑋 ∩ dom 𝐵)
21		simp12 1206	. . . . . . 7 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 1o) ∧ ¬ 𝐴 <s 𝐵) → 𝐵 ∈ No )
22		nodmord 27626	. . . . . . 7 ⊢ (𝐵 ∈ No → Ord dom 𝐵)
23	21, 22	syl 17	. . . . . 6 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 1o) ∧ ¬ 𝐴 <s 𝐵) → Ord dom 𝐵)
24		nogesgn1o 27646	. . . . . . 7 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 1o) ∧ ¬ 𝐴 <s 𝐵) → (𝐵‘𝑋) = 1o)
25		ndmfv 6867	. . . . . . . . 9 ⊢ (¬ 𝑋 ∈ dom 𝐵 → (𝐵‘𝑋) = ∅)
26		neeq1 2995	. . . . . . . . . . 11 ⊢ ((𝐵‘𝑋) = ∅ → ((𝐵‘𝑋) ≠ 1o ↔ ∅ ≠ 1o))
27	7, 26	mpbiri 258	. . . . . . . . . 10 ⊢ ((𝐵‘𝑋) = ∅ → (𝐵‘𝑋) ≠ 1o)
28	27	neneqd 2938	. . . . . . . . 9 ⊢ ((𝐵‘𝑋) = ∅ → ¬ (𝐵‘𝑋) = 1o)
29	25, 28	syl 17	. . . . . . . 8 ⊢ (¬ 𝑋 ∈ dom 𝐵 → ¬ (𝐵‘𝑋) = 1o)
30	29	con4i 114	. . . . . . 7 ⊢ ((𝐵‘𝑋) = 1o → 𝑋 ∈ dom 𝐵)
31	24, 30	syl 17	. . . . . 6 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 1o) ∧ ¬ 𝐴 <s 𝐵) → 𝑋 ∈ dom 𝐵)
32		ordsucss 7763	. . . . . 6 ⊢ (Ord dom 𝐵 → (𝑋 ∈ dom 𝐵 → suc 𝑋 ⊆ dom 𝐵))
33	23, 31, 32	sylc 65	. . . . 5 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 1o) ∧ ¬ 𝐴 <s 𝐵) → suc 𝑋 ⊆ dom 𝐵)
34		dfss2 3920	. . . . 5 ⊢ (suc 𝑋 ⊆ dom 𝐵 ↔ (suc 𝑋 ∩ dom 𝐵) = suc 𝑋)
35	33, 34	sylib 218	. . . 4 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 1o) ∧ ¬ 𝐴 <s 𝐵) → (suc 𝑋 ∩ dom 𝐵) = suc 𝑋)
36	20, 35	eqtrid 2784	. . 3 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 1o) ∧ ¬ 𝐴 <s 𝐵) → dom (𝐵 ↾ suc 𝑋) = suc 𝑋)
37	19, 36	eqtr4d 2775	. 2 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 1o) ∧ ¬ 𝐴 <s 𝐵) → dom (𝐴 ↾ suc 𝑋) = dom (𝐵 ↾ suc 𝑋))
38	19	eleq2d 2823	. . . 4 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 1o) ∧ ¬ 𝐴 <s 𝐵) → (𝑥 ∈ dom (𝐴 ↾ suc 𝑋) ↔ 𝑥 ∈ suc 𝑋))
39		vex 3445	. . . . . . . . 9 ⊢ 𝑥 ∈ V
40	39	elsuc 6390	. . . . . . . 8 ⊢ (𝑥 ∈ suc 𝑋 ↔ (𝑥 ∈ 𝑋 ∨ 𝑥 = 𝑋))
41		simpl2l 1228	. . . . . . . . . . . 12 ⊢ ((((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 1o) ∧ ¬ 𝐴 <s 𝐵) ∧ 𝑥 ∈ 𝑋) → (𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋))
42	41	fveq1d 6837	. . . . . . . . . . 11 ⊢ ((((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 1o) ∧ ¬ 𝐴 <s 𝐵) ∧ 𝑥 ∈ 𝑋) → ((𝐴 ↾ 𝑋)‘𝑥) = ((𝐵 ↾ 𝑋)‘𝑥))
43		simpr 484	. . . . . . . . . . . 12 ⊢ ((((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 1o) ∧ ¬ 𝐴 <s 𝐵) ∧ 𝑥 ∈ 𝑋) → 𝑥 ∈ 𝑋)
44	43	fvresd 6855	. . . . . . . . . . 11 ⊢ ((((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 1o) ∧ ¬ 𝐴 <s 𝐵) ∧ 𝑥 ∈ 𝑋) → ((𝐴 ↾ 𝑋)‘𝑥) = (𝐴‘𝑥))
45	43	fvresd 6855	. . . . . . . . . . 11 ⊢ ((((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 1o) ∧ ¬ 𝐴 <s 𝐵) ∧ 𝑥 ∈ 𝑋) → ((𝐵 ↾ 𝑋)‘𝑥) = (𝐵‘𝑥))
46	42, 44, 45	3eqtr3d 2780	. . . . . . . . . 10 ⊢ ((((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 1o) ∧ ¬ 𝐴 <s 𝐵) ∧ 𝑥 ∈ 𝑋) → (𝐴‘𝑥) = (𝐵‘𝑥))
47	46	ex 412	. . . . . . . . 9 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 1o) ∧ ¬ 𝐴 <s 𝐵) → (𝑥 ∈ 𝑋 → (𝐴‘𝑥) = (𝐵‘𝑥)))
48		simp2r 1202	. . . . . . . . . . 11 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 1o) ∧ ¬ 𝐴 <s 𝐵) → (𝐴‘𝑋) = 1o)
49	48, 24	eqtr4d 2775	. . . . . . . . . 10 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 1o) ∧ ¬ 𝐴 <s 𝐵) → (𝐴‘𝑋) = (𝐵‘𝑋))
50		fveq2 6835	. . . . . . . . . . 11 ⊢ (𝑥 = 𝑋 → (𝐴‘𝑥) = (𝐴‘𝑋))
51		fveq2 6835	. . . . . . . . . . 11 ⊢ (𝑥 = 𝑋 → (𝐵‘𝑥) = (𝐵‘𝑋))
52	50, 51	eqeq12d 2753	. . . . . . . . . 10 ⊢ (𝑥 = 𝑋 → ((𝐴‘𝑥) = (𝐵‘𝑥) ↔ (𝐴‘𝑋) = (𝐵‘𝑋)))
53	49, 52	syl5ibrcom 247	. . . . . . . . 9 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 1o) ∧ ¬ 𝐴 <s 𝐵) → (𝑥 = 𝑋 → (𝐴‘𝑥) = (𝐵‘𝑥)))
54	47, 53	jaod 860	. . . . . . . 8 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 1o) ∧ ¬ 𝐴 <s 𝐵) → ((𝑥 ∈ 𝑋 ∨ 𝑥 = 𝑋) → (𝐴‘𝑥) = (𝐵‘𝑥)))
55	40, 54	biimtrid 242	. . . . . . 7 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 1o) ∧ ¬ 𝐴 <s 𝐵) → (𝑥 ∈ suc 𝑋 → (𝐴‘𝑥) = (𝐵‘𝑥)))
56	55	imp 406	. . . . . 6 ⊢ ((((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 1o) ∧ ¬ 𝐴 <s 𝐵) ∧ 𝑥 ∈ suc 𝑋) → (𝐴‘𝑥) = (𝐵‘𝑥))
57		simpr 484	. . . . . . 7 ⊢ ((((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 1o) ∧ ¬ 𝐴 <s 𝐵) ∧ 𝑥 ∈ suc 𝑋) → 𝑥 ∈ suc 𝑋)
58	57	fvresd 6855	. . . . . 6 ⊢ ((((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 1o) ∧ ¬ 𝐴 <s 𝐵) ∧ 𝑥 ∈ suc 𝑋) → ((𝐴 ↾ suc 𝑋)‘𝑥) = (𝐴‘𝑥))
59	57	fvresd 6855	. . . . . 6 ⊢ ((((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 1o) ∧ ¬ 𝐴 <s 𝐵) ∧ 𝑥 ∈ suc 𝑋) → ((𝐵 ↾ suc 𝑋)‘𝑥) = (𝐵‘𝑥))
60	56, 58, 59	3eqtr4d 2782	. . . . 5 ⊢ ((((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 1o) ∧ ¬ 𝐴 <s 𝐵) ∧ 𝑥 ∈ suc 𝑋) → ((𝐴 ↾ suc 𝑋)‘𝑥) = ((𝐵 ↾ suc 𝑋)‘𝑥))
61	60	ex 412	. . . 4 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 1o) ∧ ¬ 𝐴 <s 𝐵) → (𝑥 ∈ suc 𝑋 → ((𝐴 ↾ suc 𝑋)‘𝑥) = ((𝐵 ↾ suc 𝑋)‘𝑥)))
62	38, 61	sylbid 240	. . 3 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 1o) ∧ ¬ 𝐴 <s 𝐵) → (𝑥 ∈ dom (𝐴 ↾ suc 𝑋) → ((𝐴 ↾ suc 𝑋)‘𝑥) = ((𝐵 ↾ suc 𝑋)‘𝑥)))
63	62	ralrimiv 3128	. 2 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 1o) ∧ ¬ 𝐴 <s 𝐵) → ∀𝑥 ∈ dom (𝐴 ↾ suc 𝑋)((𝐴 ↾ suc 𝑋)‘𝑥) = ((𝐵 ↾ suc 𝑋)‘𝑥))
64		nofun 27622	. . . . 5 ⊢ (𝐴 ∈ No → Fun 𝐴)
65	2, 64	syl 17	. . . 4 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 1o) ∧ ¬ 𝐴 <s 𝐵) → Fun 𝐴)
66	65	funresd 6536	. . 3 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 1o) ∧ ¬ 𝐴 <s 𝐵) → Fun (𝐴 ↾ suc 𝑋))
67		nofun 27622	. . . . 5 ⊢ (𝐵 ∈ No → Fun 𝐵)
68	21, 67	syl 17	. . . 4 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 1o) ∧ ¬ 𝐴 <s 𝐵) → Fun 𝐵)
69	68	funresd 6536	. . 3 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 1o) ∧ ¬ 𝐴 <s 𝐵) → Fun (𝐵 ↾ suc 𝑋))
70		eqfunfv 6983	. . 3 ⊢ ((Fun (𝐴 ↾ suc 𝑋) ∧ Fun (𝐵 ↾ suc 𝑋)) → ((𝐴 ↾ suc 𝑋) = (𝐵 ↾ suc 𝑋) ↔ (dom (𝐴 ↾ suc 𝑋) = dom (𝐵 ↾ suc 𝑋) ∧ ∀𝑥 ∈ dom (𝐴 ↾ suc 𝑋)((𝐴 ↾ suc 𝑋)‘𝑥) = ((𝐵 ↾ suc 𝑋)‘𝑥))))
71	66, 69, 70	syl2anc 585	. 2 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 1o) ∧ ¬ 𝐴 <s 𝐵) → ((𝐴 ↾ suc 𝑋) = (𝐵 ↾ suc 𝑋) ↔ (dom (𝐴 ↾ suc 𝑋) = dom (𝐵 ↾ suc 𝑋) ∧ ∀𝑥 ∈ dom (𝐴 ↾ suc 𝑋)((𝐴 ↾ suc 𝑋)‘𝑥) = ((𝐵 ↾ suc 𝑋)‘𝑥))))
72	37, 63, 71	mpbir2and 714	1 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 1o) ∧ ¬ 𝐴 <s 𝐵) → (𝐴 ↾ suc 𝑋) = (𝐵 ↾ suc 𝑋))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395   ∨ wo 848   ∧ w3a 1087   = wceq 1542   ∈ wcel 2114   ≠ wne 2933  ∀wral 3052   ∩ cin 3901   ⊆ wss 3902  ∅c0 4286   class class class wbr 5099  dom cdm 5625   ↾ cres 5627  Ord word 6317  Oncon0 6318  suc csuc 6320  Fun wfun 6487  ‘cfv 6493  1_oc1o 8393   No csur 27612   <s clts 27613

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5242  ax-nul 5252  ax-pow 5311  ax-pr 5378  ax-un 7683

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3062  df-rab 3401  df-v 3443  df-sbc 3742  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4287  df-if 4481  df-pw 4557  df-sn 4582  df-pr 4584  df-tp 4586  df-op 4588  df-uni 4865  df-br 5100  df-opab 5162  df-mpt 5181  df-tr 5207  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 6321  df-on 6322  df-suc 6324  df-iota 6449  df-fun 6495  df-fn 6496  df-f 6497  df-fv 6501  df-1o 8400  df-2o 8401  df-no 27615  df-lts 27616

This theorem is referenced by:  noinfbnd1lem3  27698