Theorem bnj1498 35611

Description: Technical lemma for bnj60 35612. 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
bnj1498.1	⊢ 𝐵 = {𝑑 ∣ (𝑑 ⊆ 𝐴 ∧ ∀𝑥 ∈ 𝑑 pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑)}
bnj1498.2	⊢ 𝑌 = ⟨𝑥, (𝑓 ↾ pred(𝑥, 𝐴, 𝑅))⟩
bnj1498.3	⊢ 𝐶 = {𝑓 ∣ ∃𝑑 ∈ 𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌))}
bnj1498.4	⊢ 𝐹 = ∪ 𝐶

Assertion

Ref	Expression
bnj1498	⊢ (𝑅 FrSe 𝐴 → dom 𝐹 = 𝐴)

Distinct variable groups:   𝐴,𝑑,𝑓,𝑥   𝐵,𝑓   𝐺,𝑑,𝑓,𝑥   𝑅,𝑑,𝑓,𝑥

Allowed substitution hints:   𝐵(𝑥, 𝑑)   𝐶(𝑥, 𝑓, 𝑑)   𝐹(𝑥, 𝑓, 𝑑)   𝑌(𝑥, 𝑓, 𝑑)

Proof of Theorem bnj1498

Dummy variables 𝑡 𝑧 𝑤 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eliun 4955	. . . . . . 7 ⊢ (𝑧 ∈ ∪ 𝑓 ∈ 𝐶 dom 𝑓 ↔ ∃𝑓 ∈ 𝐶 𝑧 ∈ dom 𝑓)
2		bnj1498.3	. . . . . . . . . . . . . . . 16 ⊢ 𝐶 = {𝑓 ∣ ∃𝑑 ∈ 𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌))}
3	2	bnj1436 35389	. . . . . . . . . . . . . . 15 ⊢ (𝑓 ∈ 𝐶 → ∃𝑑 ∈ 𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌)))
4	3	bnj1299 35368	. . . . . . . . . . . . . 14 ⊢ (𝑓 ∈ 𝐶 → ∃𝑑 ∈ 𝐵 𝑓 Fn 𝑑)
5		fndm 6631	. . . . . . . . . . . . . 14 ⊢ (𝑓 Fn 𝑑 → dom 𝑓 = 𝑑)
6	4, 5	bnj31 35270	. . . . . . . . . . . . 13 ⊢ (𝑓 ∈ 𝐶 → ∃𝑑 ∈ 𝐵 dom 𝑓 = 𝑑)
7	6	bnj1196 35344	. . . . . . . . . . . 12 ⊢ (𝑓 ∈ 𝐶 → ∃𝑑(𝑑 ∈ 𝐵 ∧ dom 𝑓 = 𝑑))
8		bnj1498.1	. . . . . . . . . . . . . . 15 ⊢ 𝐵 = {𝑑 ∣ (𝑑 ⊆ 𝐴 ∧ ∀𝑥 ∈ 𝑑 pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑)}
9	8	bnj1436 35389	. . . . . . . . . . . . . 14 ⊢ (𝑑 ∈ 𝐵 → (𝑑 ⊆ 𝐴 ∧ ∀𝑥 ∈ 𝑑 pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑))
10	9	simpld 500	. . . . . . . . . . . . 13 ⊢ (𝑑 ∈ 𝐵 → 𝑑 ⊆ 𝐴)
11	10	anim1i 627	. . . . . . . . . . . 12 ⊢ ((𝑑 ∈ 𝐵 ∧ dom 𝑓 = 𝑑) → (𝑑 ⊆ 𝐴 ∧ dom 𝑓 = 𝑑))
12	7, 11	bnj593 35296	. . . . . . . . . . 11 ⊢ (𝑓 ∈ 𝐶 → ∃𝑑(𝑑 ⊆ 𝐴 ∧ dom 𝑓 = 𝑑))
13		sseq1 3956	. . . . . . . . . . . 12 ⊢ (dom 𝑓 = 𝑑 → (dom 𝑓 ⊆ 𝐴 ↔ 𝑑 ⊆ 𝐴))
14	13	biimparc 485	. . . . . . . . . . 11 ⊢ ((𝑑 ⊆ 𝐴 ∧ dom 𝑓 = 𝑑) → dom 𝑓 ⊆ 𝐴)
15	12, 14	bnj593 35296	. . . . . . . . . 10 ⊢ (𝑓 ∈ 𝐶 → ∃𝑑dom 𝑓 ⊆ 𝐴)
16	15	bnj937 35322	. . . . . . . . 9 ⊢ (𝑓 ∈ 𝐶 → dom 𝑓 ⊆ 𝐴)
17	16	sselda 3931	. . . . . . . 8 ⊢ ((𝑓 ∈ 𝐶 ∧ 𝑧 ∈ dom 𝑓) → 𝑧 ∈ 𝐴)
18	17	rexlimiva 3155	. . . . . . 7 ⊢ (∃𝑓 ∈ 𝐶 𝑧 ∈ dom 𝑓 → 𝑧 ∈ 𝐴)
19	1, 18	sylbi 220	. . . . . 6 ⊢ (𝑧 ∈ ∪ 𝑓 ∈ 𝐶 dom 𝑓 → 𝑧 ∈ 𝐴)
20	2	bnj1317 35371	. . . . . . 7 ⊢ (𝑤 ∈ 𝐶 → ∀𝑓 𝑤 ∈ 𝐶)
21	20	bnj1400 35385	. . . . . 6 ⊢ dom ∪ 𝐶 = ∪ 𝑓 ∈ 𝐶 dom 𝑓
22	19, 21	eleq2s 2878	. . . . 5 ⊢ (𝑧 ∈ dom ∪ 𝐶 → 𝑧 ∈ 𝐴)
23		bnj1498.4	. . . . . 6 ⊢ 𝐹 = ∪ 𝐶
24	23	dmeqi 5883	. . . . 5 ⊢ dom 𝐹 = dom ∪ 𝐶
25	22, 24	eleq2s 2878	. . . 4 ⊢ (𝑧 ∈ dom 𝐹 → 𝑧 ∈ 𝐴)
26	25	ssriv 3935	. . 3 ⊢ dom 𝐹 ⊆ 𝐴
27	26	a1i 11	. 2 ⊢ (𝑅 FrSe 𝐴 → dom 𝐹 ⊆ 𝐴)
28		bnj1498.2	. . . . . . . 8 ⊢ 𝑌 = ⟨𝑥, (𝑓 ↾ pred(𝑥, 𝐴, 𝑅))⟩
29	8, 28, 2	bnj1493 35609	. . . . . . 7 ⊢ (𝑅 FrSe 𝐴 → ∀𝑥 ∈ 𝐴 ∃𝑓 ∈ 𝐶 dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))
30		vsnid 4624	. . . . . . . . . . 11 ⊢ 𝑥 ∈ {𝑥}
31		elun1 4128	. . . . . . . . . . 11 ⊢ (𝑥 ∈ {𝑥} → 𝑥 ∈ ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))
32	30, 31	ax-mp 5	. . . . . . . . . 10 ⊢ 𝑥 ∈ ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅))
33		eleq2 2849	. . . . . . . . . 10 ⊢ (dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)) → (𝑥 ∈ dom 𝑓 ↔ 𝑥 ∈ ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅))))
34	32, 33	mpbiri 261	. . . . . . . . 9 ⊢ (dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)) → 𝑥 ∈ dom 𝑓)
35	34	reximi 3100	. . . . . . . 8 ⊢ (∃𝑓 ∈ 𝐶 dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)) → ∃𝑓 ∈ 𝐶 𝑥 ∈ dom 𝑓)
36	35	ralimi 3099	. . . . . . 7 ⊢ (∀𝑥 ∈ 𝐴 ∃𝑓 ∈ 𝐶 dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)) → ∀𝑥 ∈ 𝐴 ∃𝑓 ∈ 𝐶 𝑥 ∈ dom 𝑓)
37	29, 36	syl 18	. . . . . 6 ⊢ (𝑅 FrSe 𝐴 → ∀𝑥 ∈ 𝐴 ∃𝑓 ∈ 𝐶 𝑥 ∈ dom 𝑓)
38		eliun 4955	. . . . . . 7 ⊢ (𝑥 ∈ ∪ 𝑓 ∈ 𝐶 dom 𝑓 ↔ ∃𝑓 ∈ 𝐶 𝑥 ∈ dom 𝑓)
39	38	ralbii 3108	. . . . . 6 ⊢ (∀𝑥 ∈ 𝐴 𝑥 ∈ ∪ 𝑓 ∈ 𝐶 dom 𝑓 ↔ ∀𝑥 ∈ 𝐴 ∃𝑓 ∈ 𝐶 𝑥 ∈ dom 𝑓)
40	37, 39	sylibr 237	. . . . 5 ⊢ (𝑅 FrSe 𝐴 → ∀𝑥 ∈ 𝐴 𝑥 ∈ ∪ 𝑓 ∈ 𝐶 dom 𝑓)
41		nfcv 2922	. . . . . 6 ⊢ Ⅎ𝑥𝐴
42	8	bnj1309 35572	. . . . . . . . 9 ⊢ (𝑡 ∈ 𝐵 → ∀𝑥 𝑡 ∈ 𝐵)
43	2, 42	bnj1307 35573	. . . . . . . 8 ⊢ (𝑡 ∈ 𝐶 → ∀𝑥 𝑡 ∈ 𝐶)
44	43	nfcii 2911	. . . . . . 7 ⊢ Ⅎ𝑥𝐶
45		nfcv 2922	. . . . . . 7 ⊢ Ⅎ𝑥dom 𝑓
46	44, 45	nfiun 4982	. . . . . 6 ⊢ Ⅎ𝑥∪ 𝑓 ∈ 𝐶 dom 𝑓
47	41, 46	dfss3f 3923	. . . . 5 ⊢ (𝐴 ⊆ ∪ 𝑓 ∈ 𝐶 dom 𝑓 ↔ ∀𝑥 ∈ 𝐴 𝑥 ∈ ∪ 𝑓 ∈ 𝐶 dom 𝑓)
48	40, 47	sylibr 237	. . . 4 ⊢ (𝑅 FrSe 𝐴 → 𝐴 ⊆ ∪ 𝑓 ∈ 𝐶 dom 𝑓)
49	48, 21	sseqtrrdi 3972	. . 3 ⊢ (𝑅 FrSe 𝐴 → 𝐴 ⊆ dom ∪ 𝐶)
50	49, 24	sseqtrrdi 3972	. 2 ⊢ (𝑅 FrSe 𝐴 → 𝐴 ⊆ dom 𝐹)
51	27, 50	eqssd 3948	1 ⊢ (𝑅 FrSe 𝐴 → dom 𝐹 = 𝐴)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  {cab 2738  ∀wral 3076  ∃wrex 3086   ∪ cun 3897   ⊆ wss 3899  {csn 4584  ⟨cop 4590  ∪ cuni 4867  ∪ ciun 4951  dom cdm 5648   ↾ cres 5650   Fn wfn 6523  ‘cfv 6528   predc-bnj14 35239   FrSe w-bnj15 35243   trClc-bnj18 35245

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7735  ax-reg 9564  ax-inf2 9620

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 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5543  df-eprel 5548  df-po 5556  df-so 5557  df-fr 5601  df-we 5603  df-xp 5654  df-rel 5655  df-cnv 5656  df-co 5657  df-dm 5658  df-rn 5659  df-res 5660  df-ima 5661  df-ord 6355  df-on 6356  df-lim 6357  df-suc 6358  df-iota 6484  df-fun 6530  df-fn 6531  df-f 6532  df-f1 6533  df-fo 6534  df-f1o 6535  df-fv 6536  df-om 7862  df-1o 8455  df-bnj17 35238  df-bnj14 35240  df-bnj13 35242  df-bnj15 35244  df-bnj18 35246  df-bnj19 35248

This theorem is used by:  bnj60  35612