Mathbox for Jonathan Ben-Naim < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  bnj1446 Structured version   Visualization version   GIF version

Theorem bnj1446 30367
 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
bnj1446.1 𝐵 = {𝑑 ∣ (𝑑𝐴 ∧ ∀𝑥𝑑 pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑)}
bnj1446.2 𝑌 = ⟨𝑥, (𝑓 ↾ pred(𝑥, 𝐴, 𝑅))⟩
bnj1446.3 𝐶 = {𝑓 ∣ ∃𝑑𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥𝑑 (𝑓𝑥) = (𝐺𝑌))}
bnj1446.4 (𝜏 ↔ (𝑓𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅))))
bnj1446.5 𝐷 = {𝑥𝐴 ∣ ¬ ∃𝑓𝜏}
bnj1446.6 (𝜓 ↔ (𝑅 FrSe 𝐴𝐷 ≠ ∅))
bnj1446.7 (𝜒 ↔ (𝜓𝑥𝐷 ∧ ∀𝑦𝐷 ¬ 𝑦𝑅𝑥))
bnj1446.8 (𝜏′[𝑦 / 𝑥]𝜏)
bnj1446.9 𝐻 = {𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)𝜏′}
bnj1446.10 𝑃 = 𝐻
bnj1446.11 𝑍 = ⟨𝑥, (𝑃 ↾ pred(𝑥, 𝐴, 𝑅))⟩
bnj1446.12 𝑄 = (𝑃 ∪ {⟨𝑥, (𝐺𝑍)⟩})
bnj1446.13 𝑊 = ⟨𝑧, (𝑄 ↾ pred(𝑧, 𝐴, 𝑅))⟩
Assertion
Ref Expression
bnj1446 ((𝑄𝑧) = (𝐺𝑊) → ∀𝑑(𝑄𝑧) = (𝐺𝑊))
Distinct variable groups:   𝐴,𝑑,𝑥   𝐵,𝑓   𝐺,𝑑   𝑅,𝑑,𝑥   𝑓,𝑑,𝑥   𝑦,𝑑,𝑥   𝑧,𝑑
Allowed substitution hints:   𝜓(𝑥,𝑦,𝑧,𝑓,𝑑)   𝜒(𝑥,𝑦,𝑧,𝑓,𝑑)   𝜏(𝑥,𝑦,𝑧,𝑓,𝑑)   𝐴(𝑦,𝑧,𝑓)   𝐵(𝑥,𝑦,𝑧,𝑑)   𝐶(𝑥,𝑦,𝑧,𝑓,𝑑)   𝐷(𝑥,𝑦,𝑧,𝑓,𝑑)   𝑃(𝑥,𝑦,𝑧,𝑓,𝑑)   𝑄(𝑥,𝑦,𝑧,𝑓,𝑑)   𝑅(𝑦,𝑧,𝑓)   𝐺(𝑥,𝑦,𝑧,𝑓)   𝐻(𝑥,𝑦,𝑧,𝑓,𝑑)   𝑊(𝑥,𝑦,𝑧,𝑓,𝑑)   𝑌(𝑥,𝑦,𝑧,𝑓,𝑑)   𝑍(𝑥,𝑦,𝑧,𝑓,𝑑)   𝜏′(𝑥,𝑦,𝑧,𝑓,𝑑)

Proof of Theorem bnj1446
StepHypRef Expression
1 bnj1446.12 . . . . 5 𝑄 = (𝑃 ∪ {⟨𝑥, (𝐺𝑍)⟩})
2 bnj1446.10 . . . . . . 7 𝑃 = 𝐻
3 bnj1446.9 . . . . . . . . 9 𝐻 = {𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)𝜏′}
4 nfcv 2751 . . . . . . . . . . 11 𝑑 pred(𝑥, 𝐴, 𝑅)
5 bnj1446.8 . . . . . . . . . . . 12 (𝜏′[𝑦 / 𝑥]𝜏)
6 nfcv 2751 . . . . . . . . . . . . 13 𝑑𝑦
7 bnj1446.4 . . . . . . . . . . . . . 14 (𝜏 ↔ (𝑓𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅))))
8 bnj1446.3 . . . . . . . . . . . . . . . . 17 𝐶 = {𝑓 ∣ ∃𝑑𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥𝑑 (𝑓𝑥) = (𝐺𝑌))}
9 nfre1 2988 . . . . . . . . . . . . . . . . . 18 𝑑𝑑𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥𝑑 (𝑓𝑥) = (𝐺𝑌))
109nfab 2755 . . . . . . . . . . . . . . . . 17 𝑑{𝑓 ∣ ∃𝑑𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥𝑑 (𝑓𝑥) = (𝐺𝑌))}
118, 10nfcxfr 2749 . . . . . . . . . . . . . . . 16 𝑑𝐶
1211nfcri 2745 . . . . . . . . . . . . . . 15 𝑑 𝑓𝐶
13 nfv 1830 . . . . . . . . . . . . . . 15 𝑑dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅))
1412, 13nfan 1816 . . . . . . . . . . . . . 14 𝑑(𝑓𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))
157, 14nfxfr 1771 . . . . . . . . . . . . 13 𝑑𝜏
166, 15nfsbc 3424 . . . . . . . . . . . 12 𝑑[𝑦 / 𝑥]𝜏
175, 16nfxfr 1771 . . . . . . . . . . 11 𝑑𝜏′
184, 17nfrex 2990 . . . . . . . . . 10 𝑑𝑦 ∈ pred (𝑥, 𝐴, 𝑅)𝜏′
1918nfab 2755 . . . . . . . . 9 𝑑{𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)𝜏′}
203, 19nfcxfr 2749 . . . . . . . 8 𝑑𝐻
2120nfuni 4378 . . . . . . 7 𝑑 𝐻
222, 21nfcxfr 2749 . . . . . 6 𝑑𝑃
23 nfcv 2751 . . . . . . . 8 𝑑𝑥
24 nfcv 2751 . . . . . . . . 9 𝑑𝐺
25 bnj1446.11 . . . . . . . . . 10 𝑍 = ⟨𝑥, (𝑃 ↾ pred(𝑥, 𝐴, 𝑅))⟩
2622, 4nfres 5319 . . . . . . . . . . 11 𝑑(𝑃 ↾ pred(𝑥, 𝐴, 𝑅))
2723, 26nfop 4356 . . . . . . . . . 10 𝑑𝑥, (𝑃 ↾ pred(𝑥, 𝐴, 𝑅))⟩
2825, 27nfcxfr 2749 . . . . . . . . 9 𝑑𝑍
2924, 28nffv 6110 . . . . . . . 8 𝑑(𝐺𝑍)
3023, 29nfop 4356 . . . . . . 7 𝑑𝑥, (𝐺𝑍)⟩
3130nfsn 4189 . . . . . 6 𝑑{⟨𝑥, (𝐺𝑍)⟩}
3222, 31nfun 3731 . . . . 5 𝑑(𝑃 ∪ {⟨𝑥, (𝐺𝑍)⟩})
331, 32nfcxfr 2749 . . . 4 𝑑𝑄
34 nfcv 2751 . . . 4 𝑑𝑧
3533, 34nffv 6110 . . 3 𝑑(𝑄𝑧)
36 bnj1446.13 . . . . 5 𝑊 = ⟨𝑧, (𝑄 ↾ pred(𝑧, 𝐴, 𝑅))⟩
37 nfcv 2751 . . . . . . 7 𝑑 pred(𝑧, 𝐴, 𝑅)
3833, 37nfres 5319 . . . . . 6 𝑑(𝑄 ↾ pred(𝑧, 𝐴, 𝑅))
3934, 38nfop 4356 . . . . 5 𝑑𝑧, (𝑄 ↾ pred(𝑧, 𝐴, 𝑅))⟩
4036, 39nfcxfr 2749 . . . 4 𝑑𝑊
4124, 40nffv 6110 . . 3 𝑑(𝐺𝑊)
4235, 41nfeq 2762 . 2 𝑑(𝑄𝑧) = (𝐺𝑊)
4342nf5ri 2053 1 ((𝑄𝑧) = (𝐺𝑊) → ∀𝑑(𝑄𝑧) = (𝐺𝑊))
 Colors of variables: wff setvar class Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 195   ∧ wa 383   ∧ w3a 1031  ∀wal 1473   = wceq 1475  ∃wex 1695   ∈ wcel 1977  {cab 2596   ≠ wne 2780  ∀wral 2896  ∃wrex 2897  {crab 2900  [wsbc 3402   ∪ cun 3538   ⊆ wss 3540  ∅c0 3874  {csn 4125  ⟨cop 4131  ∪ cuni 4372   class class class wbr 4583  dom cdm 5038   ↾ cres 5040   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-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590 This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ral 2901  df-rex 2902  df-rab 2905  df-v 3175  df-sbc 3403  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-br 4584  df-opab 4644  df-xp 5044  df-res 5050  df-iota 5768  df-fv 5812 This theorem is referenced by:  bnj1450  30372  bnj1463  30377
 Copyright terms: Public domain W3C validator