Theorem bnj1489 35552

Description: Technical lemma for bnj60 35558. 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
bnj1489.1	⊢ 𝐵 = {𝑑 ∣ (𝑑 ⊆ 𝐴 ∧ ∀𝑥 ∈ 𝑑 pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑)}
bnj1489.2	⊢ 𝑌 = ⟨𝑥, (𝑓 ↾ pred(𝑥, 𝐴, 𝑅))⟩
bnj1489.3	⊢ 𝐶 = {𝑓 ∣ ∃𝑑 ∈ 𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌))}
bnj1489.4	⊢ (𝜏 ↔ (𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅))))
bnj1489.5	⊢ 𝐷 = {𝑥 ∈ 𝐴 ∣ ¬ ∃𝑓𝜏}
bnj1489.6	⊢ (𝜓 ↔ (𝑅 FrSe 𝐴 ∧ 𝐷 ≠ ∅))
bnj1489.7	⊢ (𝜒 ↔ (𝜓 ∧ 𝑥 ∈ 𝐷 ∧ ∀𝑦 ∈ 𝐷 ¬ 𝑦𝑅𝑥))
bnj1489.8	⊢ (𝜏′ ↔ [𝑦 / 𝑥]𝜏)
bnj1489.9	⊢ 𝐻 = {𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)𝜏′}
bnj1489.10	⊢ 𝑃 = ∪ 𝐻
bnj1489.11	⊢ 𝑍 = ⟨𝑥, (𝑃 ↾ pred(𝑥, 𝐴, 𝑅))⟩
bnj1489.12	⊢ 𝑄 = (𝑃 ∪ {⟨𝑥, (𝐺‘𝑍)⟩})

Assertion

Ref	Expression
bnj1489	⊢ (𝜒 → 𝑄 ∈ V)

Distinct variable groups:   𝐴,𝑑,𝑓,𝑥   𝑦,𝐴,𝑓,𝑥   𝐵,𝑓   𝑦,𝐷   𝐺,𝑑,𝑓   𝑅,𝑑,𝑓,𝑥   𝑦,𝑅   𝜓,𝑦   𝜏,𝑦

Allowed substitution hints:   𝜓(𝑥, 𝑓, 𝑑)   𝜒(𝑥, 𝑦, 𝑓, 𝑑)   𝜏(𝑥, 𝑓, 𝑑)   𝐵(𝑥, 𝑦, 𝑑)   𝐶(𝑥, 𝑦, 𝑓, 𝑑)   𝐷(𝑥, 𝑓, 𝑑)   𝑃(𝑥, 𝑦, 𝑓, 𝑑)   𝑄(𝑥, 𝑦, 𝑓, 𝑑)   𝐺(𝑥, 𝑦)   𝐻(𝑥, 𝑦, 𝑓, 𝑑)   𝑌(𝑥, 𝑦, 𝑓, 𝑑)   𝑍(𝑥, 𝑦, 𝑓, 𝑑)   𝜏′(𝑥, 𝑦, 𝑓, 𝑑)

Proof of Theorem bnj1489

Step	Hyp	Ref	Expression
1		bnj1489.12	. 2 ⊢ 𝑄 = (𝑃 ∪ {⟨𝑥, (𝐺‘𝑍)⟩})
2		bnj1489.10	. . . 4 ⊢ 𝑃 = ∪ 𝐻
3		bnj1489.7	. . . . . . . 8 ⊢ (𝜒 ↔ (𝜓 ∧ 𝑥 ∈ 𝐷 ∧ ∀𝑦 ∈ 𝐷 ¬ 𝑦𝑅𝑥))
4		bnj1489.6	. . . . . . . . 9 ⊢ (𝜓 ↔ (𝑅 FrSe 𝐴 ∧ 𝐷 ≠ ∅))
5		bnj1364 35524	. . . . . . . . . 10 ⊢ (𝑅 FrSe 𝐴 → 𝑅 Se 𝐴)
6		df-bnj13 35188	. . . . . . . . . 10 ⊢ (𝑅 Se 𝐴 ↔ ∀𝑥 ∈ 𝐴 pred(𝑥, 𝐴, 𝑅) ∈ V)
7	5, 6	sylib 221	. . . . . . . . 9 ⊢ (𝑅 FrSe 𝐴 → ∀𝑥 ∈ 𝐴 pred(𝑥, 𝐴, 𝑅) ∈ V)
8	4, 7	bnj832 35255	. . . . . . . 8 ⊢ (𝜓 → ∀𝑥 ∈ 𝐴 pred(𝑥, 𝐴, 𝑅) ∈ V)
9	3, 8	bnj835 35256	. . . . . . 7 ⊢ (𝜒 → ∀𝑥 ∈ 𝐴 pred(𝑥, 𝐴, 𝑅) ∈ V)
10		bnj1489.5	. . . . . . . 8 ⊢ 𝐷 = {𝑥 ∈ 𝐴 ∣ ¬ ∃𝑓𝜏}
11	10, 3	bnj1212 35295	. . . . . . 7 ⊢ (𝜒 → 𝑥 ∈ 𝐴)
12	9, 11	bnj1294 35313	. . . . . 6 ⊢ (𝜒 → pred(𝑥, 𝐴, 𝑅) ∈ V)
13		nfv 1947	. . . . . . . . 9 ⊢ Ⅎ𝑦𝜓
14		nfv 1947	. . . . . . . . 9 ⊢ Ⅎ𝑦 𝑥 ∈ 𝐷
15		nfra1 3288	. . . . . . . . 9 ⊢ Ⅎ𝑦∀𝑦 ∈ 𝐷 ¬ 𝑦𝑅𝑥
16	13, 14, 15	nf3an 1934	. . . . . . . 8 ⊢ Ⅎ𝑦(𝜓 ∧ 𝑥 ∈ 𝐷 ∧ ∀𝑦 ∈ 𝐷 ¬ 𝑦𝑅𝑥)
17	3, 16	nfxfr 1886	. . . . . . 7 ⊢ Ⅎ𝑦𝜒
18	4	simplbi 502	. . . . . . . . . . 11 ⊢ (𝜓 → 𝑅 FrSe 𝐴)
19	3, 18	bnj835 35256	. . . . . . . . . 10 ⊢ (𝜒 → 𝑅 FrSe 𝐴)
20	19	adantr 486	. . . . . . . . 9 ⊢ ((𝜒 ∧ 𝑦 ∈ pred(𝑥, 𝐴, 𝑅)) → 𝑅 FrSe 𝐴)
21		bnj1489.1	. . . . . . . . . . 11 ⊢ 𝐵 = {𝑑 ∣ (𝑑 ⊆ 𝐴 ∧ ∀𝑥 ∈ 𝑑 pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑)}
22		bnj1489.2	. . . . . . . . . . 11 ⊢ 𝑌 = ⟨𝑥, (𝑓 ↾ pred(𝑥, 𝐴, 𝑅))⟩
23		bnj1489.3	. . . . . . . . . . 11 ⊢ 𝐶 = {𝑓 ∣ ∃𝑑 ∈ 𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌))}
24		bnj1489.4	. . . . . . . . . . 11 ⊢ (𝜏 ↔ (𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅))))
25		bnj1489.8	. . . . . . . . . . 11 ⊢ (𝜏′ ↔ [𝑦 / 𝑥]𝜏)
26	21, 22, 23, 24, 10, 4, 3, 25	bnj1388 35529	. . . . . . . . . 10 ⊢ (𝜒 → ∀𝑦 ∈ pred (𝑥, 𝐴, 𝑅)∃𝑓𝜏′)
27	26	r19.21bi 3256	. . . . . . . . 9 ⊢ ((𝜒 ∧ 𝑦 ∈ pred(𝑥, 𝐴, 𝑅)) → ∃𝑓𝜏′)
28		nfv 1947	. . . . . . . . . . . 12 ⊢ Ⅎ𝑥 𝑅 FrSe 𝐴
29		nfsbc1v 3762	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑥[𝑦 / 𝑥]𝜏
30	25, 29	nfxfr 1886	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑥𝜏′
31	30	nfex 2356	. . . . . . . . . . . 12 ⊢ Ⅎ𝑥∃𝑓𝜏′
32	28, 31	nfan 1932	. . . . . . . . . . 11 ⊢ Ⅎ𝑥(𝑅 FrSe 𝐴 ∧ ∃𝑓𝜏′)
33	30	nfeuw 2620	. . . . . . . . . . 11 ⊢ Ⅎ𝑥∃!𝑓𝜏′
34	32, 33	nfim 1929	. . . . . . . . . 10 ⊢ Ⅎ𝑥((𝑅 FrSe 𝐴 ∧ ∃𝑓𝜏′) → ∃!𝑓𝜏′)
35		sneq 4597	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 = 𝑦 → {𝑥} = {𝑦})
36		bnj1318 35521	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 = 𝑦 → trCl(𝑥, 𝐴, 𝑅) = trCl(𝑦, 𝐴, 𝑅))
37	35, 36	uneq12d 4119	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 = 𝑦 → ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)) = ({𝑦} ∪ trCl(𝑦, 𝐴, 𝑅)))
38	37	eqeq2d 2773	. . . . . . . . . . . . . . 15 ⊢ (𝑥 = 𝑦 → (dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)) ↔ dom 𝑓 = ({𝑦} ∪ trCl(𝑦, 𝐴, 𝑅))))
39	38	anbi2d 642	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 𝑦 → ((𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅))) ↔ (𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑦} ∪ trCl(𝑦, 𝐴, 𝑅)))))
40	21, 22, 23, 24, 25	bnj1373 35526	. . . . . . . . . . . . . 14 ⊢ (𝜏′ ↔ (𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑦} ∪ trCl(𝑦, 𝐴, 𝑅))))
41	39, 40	bitr4di 292	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝑦 → ((𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅))) ↔ 𝜏′))
42	41	exbidv 1954	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝑦 → (∃𝑓(𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅))) ↔ ∃𝑓𝜏′))
43	42	anbi2d 642	. . . . . . . . . . 11 ⊢ (𝑥 = 𝑦 → ((𝑅 FrSe 𝐴 ∧ ∃𝑓(𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))) ↔ (𝑅 FrSe 𝐴 ∧ ∃𝑓𝜏′)))
44	41	eubidv 2613	. . . . . . . . . . 11 ⊢ (𝑥 = 𝑦 → (∃!𝑓(𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅))) ↔ ∃!𝑓𝜏′))
45	43, 44	imbi12d 347	. . . . . . . . . 10 ⊢ (𝑥 = 𝑦 → (((𝑅 FrSe 𝐴 ∧ ∃𝑓(𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))) → ∃!𝑓(𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))) ↔ ((𝑅 FrSe 𝐴 ∧ ∃𝑓𝜏′) → ∃!𝑓𝜏′)))
46		biid 264	. . . . . . . . . . 11 ⊢ ((𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅))) ↔ (𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅))))
47	21, 22, 23, 46	bnj1321 35523	. . . . . . . . . 10 ⊢ ((𝑅 FrSe 𝐴 ∧ ∃𝑓(𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))) → ∃!𝑓(𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅))))
48	34, 45, 47	chvarfv 2278	. . . . . . . . 9 ⊢ ((𝑅 FrSe 𝐴 ∧ ∃𝑓𝜏′) → ∃!𝑓𝜏′)
49	20, 27, 48	syl2anc 596	. . . . . . . 8 ⊢ ((𝜒 ∧ 𝑦 ∈ pred(𝑥, 𝐴, 𝑅)) → ∃!𝑓𝜏′)
50	49	ex 418	. . . . . . 7 ⊢ (𝜒 → (𝑦 ∈ pred(𝑥, 𝐴, 𝑅) → ∃!𝑓𝜏′))
51	17, 50	ralrimi 3262	. . . . . 6 ⊢ (𝜒 → ∀𝑦 ∈ pred (𝑥, 𝐴, 𝑅)∃!𝑓𝜏′)
52		bnj1489.9	. . . . . . 7 ⊢ 𝐻 = {𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)𝜏′}
53	52	a1i 11	. . . . . 6 ⊢ (𝜒 → 𝐻 = {𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)𝜏′})
54		biid 264	. . . . . . 7 ⊢ (( pred(𝑥, 𝐴, 𝑅) ∈ V ∧ ∀𝑦 ∈ pred (𝑥, 𝐴, 𝑅)∃!𝑓𝜏′ ∧ 𝐻 = {𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)𝜏′}) ↔ ( pred(𝑥, 𝐴, 𝑅) ∈ V ∧ ∀𝑦 ∈ pred (𝑥, 𝐴, 𝑅)∃!𝑓𝜏′ ∧ 𝐻 = {𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)𝜏′}))
55	54	bnj1366 35325	. . . . . 6 ⊢ (( pred(𝑥, 𝐴, 𝑅) ∈ V ∧ ∀𝑦 ∈ pred (𝑥, 𝐴, 𝑅)∃!𝑓𝜏′ ∧ 𝐻 = {𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)𝜏′}) → 𝐻 ∈ V)
56	12, 51, 53, 55	syl3anc 1398	. . . . 5 ⊢ (𝜒 → 𝐻 ∈ V)
57	56	uniexd 7747	. . . 4 ⊢ (𝜒 → ∪ 𝐻 ∈ V)
58	2, 57	eqeltrid 2866	. . 3 ⊢ (𝜒 → 𝑃 ∈ V)
59		snex 5408	. . . 4 ⊢ {⟨𝑥, (𝐺‘𝑍)⟩} ∈ V
60	59	a1i 11	. . 3 ⊢ (𝜒 → {⟨𝑥, (𝐺‘𝑍)⟩} ∈ V)
61	58, 60	bnj1149 35288	. 2 ⊢ (𝜒 → (𝑃 ∪ {⟨𝑥, (𝐺‘𝑍)⟩}) ∈ V)
62	1, 61	eqeltrid 2866	1 ⊢ (𝜒 → 𝑄 ∈ V)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570  ∃wex 1812   ∈ wcel 2145  ∃!weu 2595  {cab 2740   ≠ wne 2957  ∀wral 3078  ∃wrex 3088  {crab 3414  Vcvv 3453  [wsbc 3742   ∪ cun 3900   ⊆ wss 3902  ∅c0 4282  {csn 4587  ⟨cop 4593  ∪ cuni 4870   class class class wbr 5107  dom cdm 5659   ↾ cres 5661   Fn wfn 6532  ‘cfv 6537   predc-bnj14 35185   Se w-bnj13 35187   FrSe w-bnj15 35189   trClc-bnj18 35191

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 2215  ax-ext 2734  ax-rep 5236  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7739  ax-reg 9567  ax-inf2 9623

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 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 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-tr 5217  df-id 5554  df-eprel 5559  df-po 5567  df-so 5568  df-fr 5612  df-we 5614  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-om 7866  df-1o 8458  df-bnj17 35184  df-bnj14 35186  df-bnj13 35188  df-bnj15 35190  df-bnj18 35192  df-bnj19 35194

This theorem is used by:  bnj1312  35554