Theorem bnj1466 35195

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

Assertion

Ref	Expression
bnj1466	⊢ (𝑤 ∈ 𝑄 → ∀𝑓 𝑤 ∈ 𝑄)

Distinct variable groups:   𝐴,𝑓,𝑤   𝑓,𝐺,𝑤   𝑤,𝐻   𝑤,𝑃   𝑅,𝑓,𝑤   𝑤,𝑍   𝑥,𝑓,𝑤

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

Proof of Theorem bnj1466

Step	Hyp	Ref	Expression
1		bnj1466.12	. . 3 ⊢ 𝑄 = (𝑃 ∪ {⟨𝑥, (𝐺‘𝑍)⟩})
2		bnj1466.10	. . . . 5 ⊢ 𝑃 = ∪ 𝐻
3		bnj1466.9	. . . . . . . 8 ⊢ 𝐻 = {𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)𝜏′}
4	3	bnj1317 34963	. . . . . . 7 ⊢ (𝑤 ∈ 𝐻 → ∀𝑓 𝑤 ∈ 𝐻)
5	4	nfcii 2887	. . . . . 6 ⊢ Ⅎ𝑓𝐻
6	5	nfuni 4857	. . . . 5 ⊢ Ⅎ𝑓∪ 𝐻
7	2, 6	nfcxfr 2896	. . . 4 ⊢ Ⅎ𝑓𝑃
8		nfcv 2898	. . . . . 6 ⊢ Ⅎ𝑓𝑥
9		nfcv 2898	. . . . . . 7 ⊢ Ⅎ𝑓𝐺
10		bnj1466.11	. . . . . . . 8 ⊢ 𝑍 = ⟨𝑥, (𝑃 ↾ pred(𝑥, 𝐴, 𝑅))⟩
11		nfcv 2898	. . . . . . . . . 10 ⊢ Ⅎ𝑓 pred(𝑥, 𝐴, 𝑅)
12	7, 11	nfres 5946	. . . . . . . . 9 ⊢ Ⅎ𝑓(𝑃 ↾ pred(𝑥, 𝐴, 𝑅))
13	8, 12	nfop 4832	. . . . . . . 8 ⊢ Ⅎ𝑓⟨𝑥, (𝑃 ↾ pred(𝑥, 𝐴, 𝑅))⟩
14	10, 13	nfcxfr 2896	. . . . . . 7 ⊢ Ⅎ𝑓𝑍
15	9, 14	nffv 6850	. . . . . 6 ⊢ Ⅎ𝑓(𝐺‘𝑍)
16	8, 15	nfop 4832	. . . . 5 ⊢ Ⅎ𝑓⟨𝑥, (𝐺‘𝑍)⟩
17	16	nfsn 4651	. . . 4 ⊢ Ⅎ𝑓{⟨𝑥, (𝐺‘𝑍)⟩}
18	7, 17	nfun 4110	. . 3 ⊢ Ⅎ𝑓(𝑃 ∪ {⟨𝑥, (𝐺‘𝑍)⟩})
19	1, 18	nfcxfr 2896	. 2 ⊢ Ⅎ𝑓𝑄
20	19	nfcrii 2893	1 ⊢ (𝑤 ∈ 𝑄 → ∀𝑓 𝑤 ∈ 𝑄)

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1087  ∀wal 1540   = wceq 1542  ∃wex 1781   ∈ wcel 2114  {cab 2714   ≠ wne 2932  ∀wral 3051  ∃wrex 3061  {crab 3389  [wsbc 3728   ∪ cun 3887   ⊆ wss 3889  ∅c0 4273  {csn 4567  ⟨cop 4573  ∪ cuni 4850   class class class wbr 5085  dom cdm 5631   ↾ cres 5633   Fn wfn 6493  ‘cfv 6498   predc-bnj14 34831   FrSe w-bnj15 34835   trClc-bnj18 34837

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 2708

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ral 3052  df-rex 3062  df-rab 3390  df-v 3431  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-nul 4274  df-if 4467  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-br 5086  df-opab 5148  df-xp 5637  df-res 5643  df-iota 6454  df-fv 6506

This theorem is referenced by:  bnj1463  35197  bnj1491  35199