Theorem bnj1466 35043

Description: Technical lemma for bnj60 35052. 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 34811	. . . . . . 7 ⊢ (𝑤 ∈ 𝐻 → ∀𝑓 𝑤 ∈ 𝐻)
5	4	nfcii 2880	. . . . . 6 ⊢ Ⅎ𝑓𝐻
6	5	nfuni 4878	. . . . 5 ⊢ Ⅎ𝑓∪ 𝐻
7	2, 6	nfcxfr 2889	. . . 4 ⊢ Ⅎ𝑓𝑃
8		nfcv 2891	. . . . . 6 ⊢ Ⅎ𝑓𝑥
9		nfcv 2891	. . . . . . 7 ⊢ Ⅎ𝑓𝐺
10		bnj1466.11	. . . . . . . 8 ⊢ 𝑍 = ⟨𝑥, (𝑃 ↾ pred(𝑥, 𝐴, 𝑅))⟩
11		nfcv 2891	. . . . . . . . . 10 ⊢ Ⅎ𝑓 pred(𝑥, 𝐴, 𝑅)
12	7, 11	nfres 5952	. . . . . . . . 9 ⊢ Ⅎ𝑓(𝑃 ↾ pred(𝑥, 𝐴, 𝑅))
13	8, 12	nfop 4853	. . . . . . . 8 ⊢ Ⅎ𝑓⟨𝑥, (𝑃 ↾ pred(𝑥, 𝐴, 𝑅))⟩
14	10, 13	nfcxfr 2889	. . . . . . 7 ⊢ Ⅎ𝑓𝑍
15	9, 14	nffv 6868	. . . . . 6 ⊢ Ⅎ𝑓(𝐺‘𝑍)
16	8, 15	nfop 4853	. . . . 5 ⊢ Ⅎ𝑓⟨𝑥, (𝐺‘𝑍)⟩
17	16	nfsn 4671	. . . 4 ⊢ Ⅎ𝑓{⟨𝑥, (𝐺‘𝑍)⟩}
18	7, 17	nfun 4133	. . 3 ⊢ Ⅎ𝑓(𝑃 ∪ {⟨𝑥, (𝐺‘𝑍)⟩})
19	1, 18	nfcxfr 2889	. 2 ⊢ Ⅎ𝑓𝑄
20	19	nfcrii 2886	1 ⊢ (𝑤 ∈ 𝑄 → ∀𝑓 𝑤 ∈ 𝑄)

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1086  ∀wal 1538   = wceq 1540  ∃wex 1779   ∈ wcel 2109  {cab 2707   ≠ wne 2925  ∀wral 3044  ∃wrex 3053  {crab 3405  [wsbc 3753   ∪ cun 3912   ⊆ wss 3914  ∅c0 4296  {csn 4589  ⟨cop 4595  ∪ cuni 4871   class class class wbr 5107  dom cdm 5638   ↾ cres 5640   Fn wfn 6506  ‘cfv 6511   predc-bnj14 34678   FrSe w-bnj15 34682   trClc-bnj18 34684

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ral 3045  df-rex 3054  df-rab 3406  df-v 3449  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-nul 4297  df-if 4489  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-br 5108  df-opab 5170  df-xp 5644  df-res 5650  df-iota 6464  df-fv 6519

This theorem is referenced by:  bnj1463  35045  bnj1491  35047