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

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

Proof of Theorem bnj1447
StepHypRef Expression
1 bnj1447.12 . . . . 5 𝑄 = (𝑃 ∪ {⟨𝑥, (𝐺𝑍)⟩})
2 bnj1447.10 . . . . . . 7 𝑃 = 𝐻
3 bnj1447.9 . . . . . . . . 9 𝐻 = {𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)𝜏′}
4 nfre1 3002 . . . . . . . . . 10 𝑦𝑦 ∈ pred (𝑥, 𝐴, 𝑅)𝜏′
54nfab 2766 . . . . . . . . 9 𝑦{𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)𝜏′}
63, 5nfcxfr 2760 . . . . . . . 8 𝑦𝐻
76nfuni 4433 . . . . . . 7 𝑦 𝐻
82, 7nfcxfr 2760 . . . . . 6 𝑦𝑃
9 nfcv 2762 . . . . . . . 8 𝑦𝑥
10 nfcv 2762 . . . . . . . . 9 𝑦𝐺
11 bnj1447.11 . . . . . . . . . 10 𝑍 = ⟨𝑥, (𝑃 ↾ pred(𝑥, 𝐴, 𝑅))⟩
12 nfcv 2762 . . . . . . . . . . . 12 𝑦 pred(𝑥, 𝐴, 𝑅)
138, 12nfres 5387 . . . . . . . . . . 11 𝑦(𝑃 ↾ pred(𝑥, 𝐴, 𝑅))
149, 13nfop 4409 . . . . . . . . . 10 𝑦𝑥, (𝑃 ↾ pred(𝑥, 𝐴, 𝑅))⟩
1511, 14nfcxfr 2760 . . . . . . . . 9 𝑦𝑍
1610, 15nffv 6185 . . . . . . . 8 𝑦(𝐺𝑍)
179, 16nfop 4409 . . . . . . 7 𝑦𝑥, (𝐺𝑍)⟩
1817nfsn 4233 . . . . . 6 𝑦{⟨𝑥, (𝐺𝑍)⟩}
198, 18nfun 3761 . . . . 5 𝑦(𝑃 ∪ {⟨𝑥, (𝐺𝑍)⟩})
201, 19nfcxfr 2760 . . . 4 𝑦𝑄
21 nfcv 2762 . . . 4 𝑦𝑧
2220, 21nffv 6185 . . 3 𝑦(𝑄𝑧)
23 bnj1447.13 . . . . 5 𝑊 = ⟨𝑧, (𝑄 ↾ pred(𝑧, 𝐴, 𝑅))⟩
24 nfcv 2762 . . . . . . 7 𝑦 pred(𝑧, 𝐴, 𝑅)
2520, 24nfres 5387 . . . . . 6 𝑦(𝑄 ↾ pred(𝑧, 𝐴, 𝑅))
2621, 25nfop 4409 . . . . 5 𝑦𝑧, (𝑄 ↾ pred(𝑧, 𝐴, 𝑅))⟩
2723, 26nfcxfr 2760 . . . 4 𝑦𝑊
2810, 27nffv 6185 . . 3 𝑦(𝐺𝑊)
2922, 28nfeq 2773 . 2 𝑦(𝑄𝑧) = (𝐺𝑊)
3029nf5ri 2063 1 ((𝑄𝑧) = (𝐺𝑊) → ∀𝑦(𝑄𝑧) = (𝐺𝑊))
 Colors of variables: wff setvar class Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 196   ∧ wa 384   ∧ w3a 1036  ∀wal 1479   = wceq 1481  ∃wex 1702   ∈ wcel 1988  {cab 2606   ≠ wne 2791  ∀wral 2909  ∃wrex 2910  {crab 2913  [wsbc 3429   ∪ cun 3565   ⊆ wss 3567  ∅c0 3907  {csn 4168  ⟨cop 4174  ∪ cuni 4427   class class class wbr 4644  dom cdm 5104   ↾ cres 5106   Fn wfn 5871  ‘cfv 5876   predc-bnj14 30728   FrSe w-bnj15 30732   trClc-bnj18 30734 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1720  ax-4 1735  ax-5 1837  ax-6 1886  ax-7 1933  ax-9 1997  ax-10 2017  ax-11 2032  ax-12 2045  ax-13 2244  ax-ext 2600 This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1038  df-tru 1484  df-ex 1703  df-nf 1708  df-sb 1879  df-clab 2607  df-cleq 2613  df-clel 2616  df-nfc 2751  df-ral 2914  df-rex 2915  df-rab 2918  df-v 3197  df-dif 3570  df-un 3572  df-in 3574  df-ss 3581  df-nul 3908  df-if 4078  df-sn 4169  df-pr 4171  df-op 4175  df-uni 4428  df-br 4645  df-opab 4704  df-xp 5110  df-res 5116  df-iota 5839  df-fv 5884 This theorem is referenced by:  bnj1450  31092
 Copyright terms: Public domain W3C validator