Theorem bnj1523 35468

Description: Technical lemma for bnj1522 35469. This lemma may no longer be used or have become an indirect lemma of the theorem in question (i.e. a lemma of a lemma... of the theorem). (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (New usage is discouraged.)

Hypotheses

Ref	Expression
bnj1523.1	⊢ 𝐵 = {𝑑 ∣ (𝑑 ⊆ 𝐴 ∧ ∀𝑥 ∈ 𝑑 pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑)}
bnj1523.2	⊢ 𝑌 = ⟨𝑥, (𝑓 ↾ pred(𝑥, 𝐴, 𝑅))⟩
bnj1523.3	⊢ 𝐶 = {𝑓 ∣ ∃𝑑 ∈ 𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌))}
bnj1523.4	⊢ 𝐹 = ∪ 𝐶
bnj1523.5	⊢ (𝜑 ↔ (𝑅 FrSe 𝐴 ∧ 𝐻 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝐻‘𝑥) = (𝐺‘⟨𝑥, (𝐻 ↾ pred(𝑥, 𝐴, 𝑅))⟩)))
bnj1523.6	⊢ (𝜓 ↔ (𝜑 ∧ 𝐹 ≠ 𝐻))
bnj1523.7	⊢ (𝜒 ↔ (𝜓 ∧ 𝑥 ∈ 𝐴 ∧ (𝐹‘𝑥) ≠ (𝐻‘𝑥)))
bnj1523.8	⊢ 𝐷 = {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) ≠ (𝐻‘𝑥)}
bnj1523.9	⊢ (𝜃 ↔ (𝜒 ∧ 𝑦 ∈ 𝐷 ∧ ∀𝑧 ∈ 𝐷 ¬ 𝑧𝑅𝑦))

Assertion

Ref	Expression
bnj1523	⊢ ((𝑅 FrSe 𝐴 ∧ 𝐻 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝐻‘𝑥) = (𝐺‘⟨𝑥, (𝐻 ↾ pred(𝑥, 𝐴, 𝑅))⟩)) → 𝐹 = 𝐻)

Distinct variable groups:   𝐴,𝑑,𝑓,𝑥   𝑦,𝐴,𝑧,𝑥   𝐵,𝑓   𝑦,𝐷,𝑧   𝑦,𝐹,𝑧   𝐺,𝑑,𝑓,𝑥   𝑦,𝐺   𝑥,𝐻,𝑦,𝑧   𝑅,𝑑,𝑓,𝑥   𝑦,𝑅,𝑧   𝑌,𝑑   𝜒,𝑦

Allowed substitution hints:   𝜑(𝑥, 𝑦, 𝑧, 𝑓, 𝑑)   𝜓(𝑥, 𝑦, 𝑧, 𝑓, 𝑑)   𝜒(𝑥, 𝑧, 𝑓, 𝑑)   𝜃(𝑥, 𝑦, 𝑧, 𝑓, 𝑑)   𝐵(𝑥, 𝑦, 𝑧, 𝑑)   𝐶(𝑥, 𝑦, 𝑧, 𝑓, 𝑑)   𝐷(𝑥, 𝑓, 𝑑)   𝐹(𝑥, 𝑓, 𝑑)   𝐺(𝑧)   𝐻(𝑓, 𝑑)   𝑌(𝑥, 𝑦, 𝑧, 𝑓)

Proof of Theorem bnj1523

Dummy variables 𝑣 𝑤 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		bnj1523.5	. 2 ⊢ (𝜑 ↔ (𝑅 FrSe 𝐴 ∧ 𝐻 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝐻‘𝑥) = (𝐺‘⟨𝑥, (𝐻 ↾ pred(𝑥, 𝐴, 𝑅))⟩)))
2		bnj1523.6	. . 3 ⊢ (𝜓 ↔ (𝜑 ∧ 𝐹 ≠ 𝐻))
3		bnj1523.9	. . . . . . . . . . . . 13 ⊢ (𝜃 ↔ (𝜒 ∧ 𝑦 ∈ 𝐷 ∧ ∀𝑧 ∈ 𝐷 ¬ 𝑧𝑅𝑦))
4		bnj1523.7	. . . . . . . . . . . . . 14 ⊢ (𝜒 ↔ (𝜓 ∧ 𝑥 ∈ 𝐴 ∧ (𝐹‘𝑥) ≠ (𝐻‘𝑥)))
5		bnj1523.1	. . . . . . . . . . . . . . . . 17 ⊢ 𝐵 = {𝑑 ∣ (𝑑 ⊆ 𝐴 ∧ ∀𝑥 ∈ 𝑑 pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑)}
6		bnj1523.2	. . . . . . . . . . . . . . . . 17 ⊢ 𝑌 = ⟨𝑥, (𝑓 ↾ pred(𝑥, 𝐴, 𝑅))⟩
7		bnj1523.3	. . . . . . . . . . . . . . . . 17 ⊢ 𝐶 = {𝑓 ∣ ∃𝑑 ∈ 𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌))}
8		bnj1523.4	. . . . . . . . . . . . . . . . 17 ⊢ 𝐹 = ∪ 𝐶
9	5, 6, 7, 8	bnj60 35459	. . . . . . . . . . . . . . . 16 ⊢ (𝑅 FrSe 𝐴 → 𝐹 Fn 𝐴)
10	1, 9	bnj835 35157	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝐹 Fn 𝐴)
11	2, 10	bnj832 35156	. . . . . . . . . . . . . 14 ⊢ (𝜓 → 𝐹 Fn 𝐴)
12	4, 11	bnj835 35157	. . . . . . . . . . . . 13 ⊢ (𝜒 → 𝐹 Fn 𝐴)
13	3, 12	bnj835 35157	. . . . . . . . . . . 12 ⊢ (𝜃 → 𝐹 Fn 𝐴)
14	1	simp2bi 1163	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝐻 Fn 𝐴)
15	2, 14	bnj832 35156	. . . . . . . . . . . . . 14 ⊢ (𝜓 → 𝐻 Fn 𝐴)
16	4, 15	bnj835 35157	. . . . . . . . . . . . 13 ⊢ (𝜒 → 𝐻 Fn 𝐴)
17	3, 16	bnj835 35157	. . . . . . . . . . . 12 ⊢ (𝜃 → 𝐻 Fn 𝐴)
18		bnj213 35279	. . . . . . . . . . . . 13 ⊢ pred(𝑦, 𝐴, 𝑅) ⊆ 𝐴
19	18	a1i 11	. . . . . . . . . . . 12 ⊢ (𝜃 → pred(𝑦, 𝐴, 𝑅) ⊆ 𝐴)
20	3	simp3bi 1164	. . . . . . . . . . . . . . . . 17 ⊢ (𝜃 → ∀𝑧 ∈ 𝐷 ¬ 𝑧𝑅𝑦)
21	20	bnj1211 35194	. . . . . . . . . . . . . . . 16 ⊢ (𝜃 → ∀𝑧(𝑧 ∈ 𝐷 → ¬ 𝑧𝑅𝑦))
22		con2b 362	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑧 ∈ 𝐷 → ¬ 𝑧𝑅𝑦) ↔ (𝑧𝑅𝑦 → ¬ 𝑧 ∈ 𝐷))
23	22	albii 1848	. . . . . . . . . . . . . . . 16 ⊢ (∀𝑧(𝑧 ∈ 𝐷 → ¬ 𝑧𝑅𝑦) ↔ ∀𝑧(𝑧𝑅𝑦 → ¬ 𝑧 ∈ 𝐷))
24	21, 23	sylib 221	. . . . . . . . . . . . . . 15 ⊢ (𝜃 → ∀𝑧(𝑧𝑅𝑦 → ¬ 𝑧 ∈ 𝐷))
25		bnj1418 35437	. . . . . . . . . . . . . . . . 17 ⊢ (𝑧 ∈ pred(𝑦, 𝐴, 𝑅) → 𝑧𝑅𝑦)
26	25	imim1i 64	. . . . . . . . . . . . . . . 16 ⊢ ((𝑧𝑅𝑦 → ¬ 𝑧 ∈ 𝐷) → (𝑧 ∈ pred(𝑦, 𝐴, 𝑅) → ¬ 𝑧 ∈ 𝐷))
27	26	alimi 1840	. . . . . . . . . . . . . . 15 ⊢ (∀𝑧(𝑧𝑅𝑦 → ¬ 𝑧 ∈ 𝐷) → ∀𝑧(𝑧 ∈ pred(𝑦, 𝐴, 𝑅) → ¬ 𝑧 ∈ 𝐷))
28	24, 27	syl 18	. . . . . . . . . . . . . 14 ⊢ (𝜃 → ∀𝑧(𝑧 ∈ pred(𝑦, 𝐴, 𝑅) → ¬ 𝑧 ∈ 𝐷))
29	28	ralrid 3086	. . . . . . . . . . . . 13 ⊢ (𝜃 → ∀𝑧 ∈ pred (𝑦, 𝐴, 𝑅) ¬ 𝑧 ∈ 𝐷)
30		bnj1523.8	. . . . . . . . . . . . . 14 ⊢ 𝐷 = {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) ≠ (𝐻‘𝑥)}
31	5	bnj1309 35419	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑤 ∈ 𝐵 → ∀𝑥 𝑤 ∈ 𝐵)
32	7, 31	bnj1307 35420	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑤 ∈ 𝐶 → ∀𝑥 𝑤 ∈ 𝐶)
33	32	nfcii 2913	. . . . . . . . . . . . . . . . 17 ⊢ Ⅎ𝑥𝐶
34	33	nfuni 4878	. . . . . . . . . . . . . . . 16 ⊢ Ⅎ𝑥∪ 𝐶
35	8, 34	nfcxfr 2922	. . . . . . . . . . . . . . 15 ⊢ Ⅎ𝑥𝐹
36	35	nfcrii 2919	. . . . . . . . . . . . . 14 ⊢ (𝑤 ∈ 𝐹 → ∀𝑥 𝑤 ∈ 𝐹)
37	30, 36	bnj1534 35250	. . . . . . . . . . . . 13 ⊢ 𝐷 = {𝑧 ∈ 𝐴 ∣ (𝐹‘𝑧) ≠ (𝐻‘𝑧)}
38	29, 18, 37	bnj1533 35249	. . . . . . . . . . . 12 ⊢ (𝜃 → ∀𝑧 ∈ pred (𝑦, 𝐴, 𝑅)(𝐹‘𝑧) = (𝐻‘𝑧))
39	13, 17, 19, 38	bnj1536 35251	. . . . . . . . . . 11 ⊢ (𝜃 → (𝐹 ↾ pred(𝑦, 𝐴, 𝑅)) = (𝐻 ↾ pred(𝑦, 𝐴, 𝑅)))
40	39	opeq2d 4844	. . . . . . . . . 10 ⊢ (𝜃 → ⟨𝑦, (𝐹 ↾ pred(𝑦, 𝐴, 𝑅))⟩ = ⟨𝑦, (𝐻 ↾ pred(𝑦, 𝐴, 𝑅))⟩)
41	40	fveq2d 6885	. . . . . . . . 9 ⊢ (𝜃 → (𝐺‘⟨𝑦, (𝐹 ↾ pred(𝑦, 𝐴, 𝑅))⟩) = (𝐺‘⟨𝑦, (𝐻 ↾ pred(𝑦, 𝐴, 𝑅))⟩))
42	5, 6, 7, 8	bnj1500 35465	. . . . . . . . . . . . . . 15 ⊢ (𝑅 FrSe 𝐴 → ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) = (𝐺‘⟨𝑥, (𝐹 ↾ pred(𝑥, 𝐴, 𝑅))⟩))
43	1, 42	bnj835 35157	. . . . . . . . . . . . . 14 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) = (𝐺‘⟨𝑥, (𝐹 ↾ pred(𝑥, 𝐴, 𝑅))⟩))
44	2, 43	bnj832 35156	. . . . . . . . . . . . 13 ⊢ (𝜓 → ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) = (𝐺‘⟨𝑥, (𝐹 ↾ pred(𝑥, 𝐴, 𝑅))⟩))
45	4, 44	bnj835 35157	. . . . . . . . . . . 12 ⊢ (𝜒 → ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) = (𝐺‘⟨𝑥, (𝐹 ↾ pred(𝑥, 𝐴, 𝑅))⟩))
46	45, 36	bnj1529 35467	. . . . . . . . . . 11 ⊢ (𝜒 → ∀𝑦 ∈ 𝐴 (𝐹‘𝑦) = (𝐺‘⟨𝑦, (𝐹 ↾ pred(𝑦, 𝐴, 𝑅))⟩))
47	3, 46	bnj835 35157	. . . . . . . . . 10 ⊢ (𝜃 → ∀𝑦 ∈ 𝐴 (𝐹‘𝑦) = (𝐺‘⟨𝑦, (𝐹 ↾ pred(𝑦, 𝐴, 𝑅))⟩))
48	30	ssrab3 4035	. . . . . . . . . . 11 ⊢ 𝐷 ⊆ 𝐴
49	3	simp2bi 1163	. . . . . . . . . . 11 ⊢ (𝜃 → 𝑦 ∈ 𝐷)
50	48, 49	bnj1213 35195	. . . . . . . . . 10 ⊢ (𝜃 → 𝑦 ∈ 𝐴)
51	47, 50	bnj1294 35214	. . . . . . . . 9 ⊢ (𝜃 → (𝐹‘𝑦) = (𝐺‘⟨𝑦, (𝐹 ↾ pred(𝑦, 𝐴, 𝑅))⟩))
52	1	simp3bi 1164	. . . . . . . . . . . . . 14 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 (𝐻‘𝑥) = (𝐺‘⟨𝑥, (𝐻 ↾ pred(𝑥, 𝐴, 𝑅))⟩))
53	2, 52	bnj832 35156	. . . . . . . . . . . . 13 ⊢ (𝜓 → ∀𝑥 ∈ 𝐴 (𝐻‘𝑥) = (𝐺‘⟨𝑥, (𝐻 ↾ pred(𝑥, 𝐴, 𝑅))⟩))
54	4, 53	bnj835 35157	. . . . . . . . . . . 12 ⊢ (𝜒 → ∀𝑥 ∈ 𝐴 (𝐻‘𝑥) = (𝐺‘⟨𝑥, (𝐻 ↾ pred(𝑥, 𝐴, 𝑅))⟩))
55		ax-5 1939	. . . . . . . . . . . 12 ⊢ (𝑣 ∈ 𝐻 → ∀𝑥 𝑣 ∈ 𝐻)
56	54, 55	bnj1529 35467	. . . . . . . . . . 11 ⊢ (𝜒 → ∀𝑦 ∈ 𝐴 (𝐻‘𝑦) = (𝐺‘⟨𝑦, (𝐻 ↾ pred(𝑦, 𝐴, 𝑅))⟩))
57	3, 56	bnj835 35157	. . . . . . . . . 10 ⊢ (𝜃 → ∀𝑦 ∈ 𝐴 (𝐻‘𝑦) = (𝐺‘⟨𝑦, (𝐻 ↾ pred(𝑦, 𝐴, 𝑅))⟩))
58	57, 50	bnj1294 35214	. . . . . . . . 9 ⊢ (𝜃 → (𝐻‘𝑦) = (𝐺‘⟨𝑦, (𝐻 ↾ pred(𝑦, 𝐴, 𝑅))⟩))
59	41, 51, 58	3eqtr4d 2807	. . . . . . . 8 ⊢ (𝜃 → (𝐹‘𝑦) = (𝐻‘𝑦))
60	30, 36	bnj1534 35250	. . . . . . . . . . 11 ⊢ 𝐷 = {𝑦 ∈ 𝐴 ∣ (𝐹‘𝑦) ≠ (𝐻‘𝑦)}
61	60	bnj1538 35252	. . . . . . . . . 10 ⊢ (𝑦 ∈ 𝐷 → (𝐹‘𝑦) ≠ (𝐻‘𝑦))
62	3, 61	bnj836 35158	. . . . . . . . 9 ⊢ (𝜃 → (𝐹‘𝑦) ≠ (𝐻‘𝑦))
63	62	neneqd 2962	. . . . . . . 8 ⊢ (𝜃 → ¬ (𝐹‘𝑦) = (𝐻‘𝑦))
64	59, 63	pm2.65i 196	. . . . . . 7 ⊢ ¬ 𝜃
65	64	nex 1829	. . . . . 6 ⊢ ¬ ∃𝑦𝜃
66	1	simp1bi 1162	. . . . . . . . . 10 ⊢ (𝜑 → 𝑅 FrSe 𝐴)
67	2, 66	bnj832 35156	. . . . . . . . 9 ⊢ (𝜓 → 𝑅 FrSe 𝐴)
68	4, 67	bnj835 35157	. . . . . . . 8 ⊢ (𝜒 → 𝑅 FrSe 𝐴)
69	48	a1i 11	. . . . . . . 8 ⊢ (𝜒 → 𝐷 ⊆ 𝐴)
70	4	simp2bi 1163	. . . . . . . . . 10 ⊢ (𝜒 → 𝑥 ∈ 𝐴)
71	4	simp3bi 1164	. . . . . . . . . 10 ⊢ (𝜒 → (𝐹‘𝑥) ≠ (𝐻‘𝑥))
72	30	reqabi 3438	. . . . . . . . . 10 ⊢ (𝑥 ∈ 𝐷 ↔ (𝑥 ∈ 𝐴 ∧ (𝐹‘𝑥) ≠ (𝐻‘𝑥)))
73	70, 71, 72	sylanbrc 594	. . . . . . . . 9 ⊢ (𝜒 → 𝑥 ∈ 𝐷)
74	73	ne0d 4294	. . . . . . . 8 ⊢ (𝜒 → 𝐷 ≠ ∅)
75		bnj69 35407	. . . . . . . 8 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝐷 ⊆ 𝐴 ∧ 𝐷 ≠ ∅) → ∃𝑦 ∈ 𝐷 ∀𝑧 ∈ 𝐷 ¬ 𝑧𝑅𝑦)
76	68, 69, 74, 75	syl3anc 1397	. . . . . . 7 ⊢ (𝜒 → ∃𝑦 ∈ 𝐷 ∀𝑧 ∈ 𝐷 ¬ 𝑧𝑅𝑦)
77	76, 3	bnj1209 35193	. . . . . 6 ⊢ (𝜒 → ∃𝑦𝜃)
78	65, 77	mto 200	. . . . 5 ⊢ ¬ 𝜒
79	78	nex 1829	. . . 4 ⊢ ¬ ∃𝑥𝜒
80	2	simprbi 502	. . . . . 6 ⊢ (𝜓 → 𝐹 ≠ 𝐻)
81	11, 15, 80, 36	bnj1542 35254	. . . . 5 ⊢ (𝜓 → ∃𝑥 ∈ 𝐴 (𝐹‘𝑥) ≠ (𝐻‘𝑥))
82	5, 6, 7, 8, 1, 2	bnj1525 35466	. . . . 5 ⊢ (𝜓 → ∀𝑥𝜓)
83	81, 4, 82	bnj1521 35248	. . . 4 ⊢ (𝜓 → ∃𝑥𝜒)
84	79, 83	mto 200	. . 3 ⊢ ¬ 𝜓
85	2, 84	bnj1541 35253	. 2 ⊢ (𝜑 → 𝐹 = 𝐻)
86	1, 85	sylbir 238	1 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝐻 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝐻‘𝑥) = (𝐺‘⟨𝑥, (𝐻 ↾ pred(𝑥, 𝐴, 𝑅))⟩)) → 𝐹 = 𝐻)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 400   ∧ w3a 1102  ∀wal 1567   = wceq 1569  ∃wex 1808   ∈ wcel 2142  {cab 2740   ≠ wne 2957  ∀wral 3078  ∃wrex 3088  {crab 3415   ⊆ wss 3904  ∅c0 4285  ⟨cop 4594  ∪ cuni 4871   class class class wbr 5108   ↾ cres 5662   Fn wfn 6531  ‘cfv 6536   predc-bnj14 35086   FrSe w-bnj15 35090

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-rep 5237  ax-sep 5256  ax-nul 5268  ax-pow 5335  ax-pr 5403  ax-un 7734  ax-reg 9552  ax-inf2 9608

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1103  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-nf 1813  df-sb 2096  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-reu 3369  df-rab 3416  df-v 3456  df-sbc 3744  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-pss 3924  df-nul 4286  df-if 4487  df-pw 4563  df-sn 4589  df-pr 4591  df-op 4595  df-uni 4872  df-iun 4957  df-br 5109  df-opab 5173  df-mpt 5192  df-tr 5218  df-id 5555  df-eprel 5560  df-po 5568  df-so 5569  df-fr 5613  df-we 5615  df-xp 5666  df-rel 5667  df-cnv 5668  df-co 5669  df-dm 5670  df-rn 5671  df-res 5672  df-ima 5673  df-ord 6363  df-on 6364  df-lim 6365  df-suc 6366  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-om 7861  df-1o 8451  df-bnj17 35085  df-bnj14 35087  df-bnj13 35089  df-bnj15 35091  df-bnj18 35093  df-bnj19 35095

This theorem is used by:  bnj1522  35469