Theorem bnj1421 30364

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

Assertion

Ref	Expression
bnj1421	⊢ (𝜒 → Fun 𝑄)

Distinct variable groups:   𝑥,𝐴   𝑥,𝑅

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

Proof of Theorem bnj1421

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		bnj1421.13	. . . 4 ⊢ (𝜒 → Fun 𝑃)
2		vex 3176	. . . . 5 ⊢ 𝑥 ∈ V
3		fvex 6113	. . . . 5 ⊢ (𝐺‘𝑍) ∈ V
4	2, 3	funsn 5853	. . . 4 ⊢ Fun {⟨𝑥, (𝐺‘𝑍)⟩}
5	1, 4	jctir 559	. . 3 ⊢ (𝜒 → (Fun 𝑃 ∧ Fun {⟨𝑥, (𝐺‘𝑍)⟩}))
6		bnj1421.15	. . . . 5 ⊢ (𝜒 → dom 𝑃 = trCl(𝑥, 𝐴, 𝑅))
7	3	dmsnop 5527	. . . . . 6 ⊢ dom {⟨𝑥, (𝐺‘𝑍)⟩} = {𝑥}
8	7	a1i 11	. . . . 5 ⊢ (𝜒 → dom {⟨𝑥, (𝐺‘𝑍)⟩} = {𝑥})
9	6, 8	ineq12d 3777	. . . 4 ⊢ (𝜒 → (dom 𝑃 ∩ dom {⟨𝑥, (𝐺‘𝑍)⟩}) = ( trCl(𝑥, 𝐴, 𝑅) ∩ {𝑥}))
10		bnj1421.7	. . . . . . 7 ⊢ (𝜒 ↔ (𝜓 ∧ 𝑥 ∈ 𝐷 ∧ ∀𝑦 ∈ 𝐷 ¬ 𝑦𝑅𝑥))
11		bnj1421.6	. . . . . . . 8 ⊢ (𝜓 ↔ (𝑅 FrSe 𝐴 ∧ 𝐷 ≠ ∅))
12	11	simplbi 475	. . . . . . 7 ⊢ (𝜓 → 𝑅 FrSe 𝐴)
13	10, 12	bnj835 30083	. . . . . 6 ⊢ (𝜒 → 𝑅 FrSe 𝐴)
14		biid 250	. . . . . . . 8 ⊢ (𝑅 FrSe 𝐴 ↔ 𝑅 FrSe 𝐴)
15		biid 250	. . . . . . . 8 ⊢ (¬ 𝑥 ∈ trCl(𝑥, 𝐴, 𝑅) ↔ ¬ 𝑥 ∈ trCl(𝑥, 𝐴, 𝑅))
16		biid 250	. . . . . . . 8 ⊢ (∀𝑧 ∈ 𝐴 (𝑧𝑅𝑥 → [𝑧 / 𝑥] ¬ 𝑥 ∈ trCl(𝑥, 𝐴, 𝑅)) ↔ ∀𝑧 ∈ 𝐴 (𝑧𝑅𝑥 → [𝑧 / 𝑥] ¬ 𝑥 ∈ trCl(𝑥, 𝐴, 𝑅)))
17		biid 250	. . . . . . . 8 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴 ∧ ∀𝑧 ∈ 𝐴 (𝑧𝑅𝑥 → [𝑧 / 𝑥] ¬ 𝑥 ∈ trCl(𝑥, 𝐴, 𝑅))) ↔ (𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴 ∧ ∀𝑧 ∈ 𝐴 (𝑧𝑅𝑥 → [𝑧 / 𝑥] ¬ 𝑥 ∈ trCl(𝑥, 𝐴, 𝑅))))
18		eqid 2610	. . . . . . . 8 ⊢ ( pred(𝑥, 𝐴, 𝑅) ∪ ∪ 𝑧 ∈ pred (𝑥, 𝐴, 𝑅) trCl(𝑧, 𝐴, 𝑅)) = ( pred(𝑥, 𝐴, 𝑅) ∪ ∪ 𝑧 ∈ pred (𝑥, 𝐴, 𝑅) trCl(𝑧, 𝐴, 𝑅))
19	14, 15, 16, 17, 18	bnj1417 30363	. . . . . . 7 ⊢ (𝑅 FrSe 𝐴 → ∀𝑥 ∈ 𝐴 ¬ 𝑥 ∈ trCl(𝑥, 𝐴, 𝑅))
20		disjsn 4192	. . . . . . . 8 ⊢ (( trCl(𝑥, 𝐴, 𝑅) ∩ {𝑥}) = ∅ ↔ ¬ 𝑥 ∈ trCl(𝑥, 𝐴, 𝑅))
21	20	ralbii 2963	. . . . . . 7 ⊢ (∀𝑥 ∈ 𝐴 ( trCl(𝑥, 𝐴, 𝑅) ∩ {𝑥}) = ∅ ↔ ∀𝑥 ∈ 𝐴 ¬ 𝑥 ∈ trCl(𝑥, 𝐴, 𝑅))
22	19, 21	sylibr 223	. . . . . 6 ⊢ (𝑅 FrSe 𝐴 → ∀𝑥 ∈ 𝐴 ( trCl(𝑥, 𝐴, 𝑅) ∩ {𝑥}) = ∅)
23	13, 22	syl 17	. . . . 5 ⊢ (𝜒 → ∀𝑥 ∈ 𝐴 ( trCl(𝑥, 𝐴, 𝑅) ∩ {𝑥}) = ∅)
24		bnj1421.5	. . . . . 6 ⊢ 𝐷 = {𝑥 ∈ 𝐴 ∣ ¬ ∃𝑓𝜏}
25	24, 10	bnj1212 30124	. . . . 5 ⊢ (𝜒 → 𝑥 ∈ 𝐴)
26	23, 25	bnj1294 30142	. . . 4 ⊢ (𝜒 → ( trCl(𝑥, 𝐴, 𝑅) ∩ {𝑥}) = ∅)
27	9, 26	eqtrd 2644	. . 3 ⊢ (𝜒 → (dom 𝑃 ∩ dom {⟨𝑥, (𝐺‘𝑍)⟩}) = ∅)
28		funun 5846	. . 3 ⊢ (((Fun 𝑃 ∧ Fun {⟨𝑥, (𝐺‘𝑍)⟩}) ∧ (dom 𝑃 ∩ dom {⟨𝑥, (𝐺‘𝑍)⟩}) = ∅) → Fun (𝑃 ∪ {⟨𝑥, (𝐺‘𝑍)⟩}))
29	5, 27, 28	syl2anc 691	. 2 ⊢ (𝜒 → Fun (𝑃 ∪ {⟨𝑥, (𝐺‘𝑍)⟩}))
30		bnj1421.12	. . 3 ⊢ 𝑄 = (𝑃 ∪ {⟨𝑥, (𝐺‘𝑍)⟩})
31	30	funeqi 5824	. 2 ⊢ (Fun 𝑄 ↔ Fun (𝑃 ∪ {⟨𝑥, (𝐺‘𝑍)⟩}))
32	29, 31	sylibr 223	1 ⊢ (𝜒 → Fun 𝑄)

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 195   ∧ wa 383   ∧ w3a 1031   = wceq 1475  ∃wex 1695   ∈ wcel 1977  {cab 2596   ≠ wne 2780  ∀wral 2896  ∃wrex 2897  {crab 2900  [wsbc 3402   ∪ cun 3538   ∩ cin 3539   ⊆ wss 3540  ∅c0 3874  {csn 4125  ⟨cop 4131  ∪ cuni 4372  ∪ ciun 4455   class class class wbr 4583  dom cdm 5038   ↾ cres 5040  Fun wfun 5798   Fn wfn 5799  ‘cfv 5804   predc-bnj14 30007   FrSe w-bnj15 30011   trClc-bnj18 30013

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-rep 4699  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847  ax-reg 8380  ax-inf2 8421

This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3or 1032  df-3an 1033  df-tru 1478  df-fal 1481  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-ral 2901  df-rex 2902  df-reu 2903  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-pss 3556  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-tp 4130  df-op 4132  df-uni 4373  df-iun 4457  df-br 4584  df-opab 4644  df-mpt 4645  df-tr 4681  df-eprel 4949  df-id 4953  df-po 4959  df-so 4960  df-fr 4997  df-we 4999  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-ord 5643  df-on 5644  df-lim 5645  df-suc 5646  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-om 6958  df-1o 7447  df-bnj17 30006  df-bnj14 30008  df-bnj13 30010  df-bnj15 30012  df-bnj18 30014  df-bnj19 30016

This theorem is referenced by:  bnj1312  30380