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

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

Proof of Theorem bnj1423
StepHypRef Expression
1 bnj1423.1 . . . 4 𝐵 = {𝑑 ∣ (𝑑𝐴 ∧ ∀𝑥𝑑 pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑)}
2 bnj1423.2 . . . 4 𝑌 = ⟨𝑥, (𝑓 ↾ pred(𝑥, 𝐴, 𝑅))⟩
3 bnj1423.3 . . . 4 𝐶 = {𝑓 ∣ ∃𝑑𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥𝑑 (𝑓𝑥) = (𝐺𝑌))}
4 bnj1423.4 . . . 4 (𝜏 ↔ (𝑓𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅))))
5 bnj1423.5 . . . 4 𝐷 = {𝑥𝐴 ∣ ¬ ∃𝑓𝜏}
6 bnj1423.6 . . . 4 (𝜓 ↔ (𝑅 FrSe 𝐴𝐷 ≠ ∅))
7 bnj1423.7 . . . 4 (𝜒 ↔ (𝜓𝑥𝐷 ∧ ∀𝑦𝐷 ¬ 𝑦𝑅𝑥))
8 bnj1423.8 . . . 4 (𝜏′[𝑦 / 𝑥]𝜏)
9 bnj1423.9 . . . 4 𝐻 = {𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)𝜏′}
10 bnj1423.10 . . . 4 𝑃 = 𝐻
11 bnj1423.11 . . . 4 𝑍 = ⟨𝑥, (𝑃 ↾ pred(𝑥, 𝐴, 𝑅))⟩
12 bnj1423.12 . . . 4 𝑄 = (𝑃 ∪ {⟨𝑥, (𝐺𝑍)⟩})
13 bnj1423.13 . . . 4 𝑊 = ⟨𝑧, (𝑄 ↾ pred(𝑧, 𝐴, 𝑅))⟩
14 bnj1423.14 . . . 4 𝐸 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅))
15 bnj1423.15 . . . 4 (𝜒𝑃 Fn trCl(𝑥, 𝐴, 𝑅))
16 bnj1423.16 . . . 4 (𝜒𝑄 Fn ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))
17 biid 261 . . . 4 ((𝜒𝑧𝐸) ↔ (𝜒𝑧𝐸))
18 biid 261 . . . 4 (((𝜒𝑧𝐸) ∧ 𝑧 ∈ {𝑥}) ↔ ((𝜒𝑧𝐸) ∧ 𝑧 ∈ {𝑥}))
191, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18bnj1442 35061 . . 3 (((𝜒𝑧𝐸) ∧ 𝑧 ∈ {𝑥}) → (𝑄𝑧) = (𝐺𝑊))
20 biid 261 . . . 4 (((𝜒𝑧𝐸) ∧ 𝑧 ∈ trCl(𝑥, 𝐴, 𝑅)) ↔ ((𝜒𝑧𝐸) ∧ 𝑧 ∈ trCl(𝑥, 𝐴, 𝑅)))
21 biid 261 . . . 4 ((((𝜒𝑧𝐸) ∧ 𝑧 ∈ trCl(𝑥, 𝐴, 𝑅)) ∧ 𝑓𝐻𝑧 ∈ dom 𝑓) ↔ (((𝜒𝑧𝐸) ∧ 𝑧 ∈ trCl(𝑥, 𝐴, 𝑅)) ∧ 𝑓𝐻𝑧 ∈ dom 𝑓))
22 biid 261 . . . 4 (((((𝜒𝑧𝐸) ∧ 𝑧 ∈ trCl(𝑥, 𝐴, 𝑅)) ∧ 𝑓𝐻𝑧 ∈ dom 𝑓) ∧ 𝑦 ∈ pred(𝑥, 𝐴, 𝑅) ∧ 𝑓𝐶 ∧ dom 𝑓 = ({𝑦} ∪ trCl(𝑦, 𝐴, 𝑅))) ↔ ((((𝜒𝑧𝐸) ∧ 𝑧 ∈ trCl(𝑥, 𝐴, 𝑅)) ∧ 𝑓𝐻𝑧 ∈ dom 𝑓) ∧ 𝑦 ∈ pred(𝑥, 𝐴, 𝑅) ∧ 𝑓𝐶 ∧ dom 𝑓 = ({𝑦} ∪ trCl(𝑦, 𝐴, 𝑅))))
23 biid 261 . . . 4 ((((((𝜒𝑧𝐸) ∧ 𝑧 ∈ trCl(𝑥, 𝐴, 𝑅)) ∧ 𝑓𝐻𝑧 ∈ dom 𝑓) ∧ 𝑦 ∈ pred(𝑥, 𝐴, 𝑅) ∧ 𝑓𝐶 ∧ dom 𝑓 = ({𝑦} ∪ trCl(𝑦, 𝐴, 𝑅))) ∧ 𝑑𝐵𝑓 Fn 𝑑 ∧ ∀𝑥𝑑 (𝑓𝑥) = (𝐺𝑌)) ↔ (((((𝜒𝑧𝐸) ∧ 𝑧 ∈ trCl(𝑥, 𝐴, 𝑅)) ∧ 𝑓𝐻𝑧 ∈ dom 𝑓) ∧ 𝑦 ∈ pred(𝑥, 𝐴, 𝑅) ∧ 𝑓𝐶 ∧ dom 𝑓 = ({𝑦} ∪ trCl(𝑦, 𝐴, 𝑅))) ∧ 𝑑𝐵𝑓 Fn 𝑑 ∧ ∀𝑥𝑑 (𝑓𝑥) = (𝐺𝑌)))
24 eqid 2731 . . . 4 𝑧, (𝑓 ↾ pred(𝑧, 𝐴, 𝑅))⟩ = ⟨𝑧, (𝑓 ↾ pred(𝑧, 𝐴, 𝑅))⟩
251, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 20, 21, 22, 23, 24bnj1450 35062 . . 3 (((𝜒𝑧𝐸) ∧ 𝑧 ∈ trCl(𝑥, 𝐴, 𝑅)) → (𝑄𝑧) = (𝐺𝑊))
2614bnj1424 34850 . . . 4 (𝑧𝐸 → (𝑧 ∈ {𝑥} ∨ 𝑧 ∈ trCl(𝑥, 𝐴, 𝑅)))
2726adantl 481 . . 3 ((𝜒𝑧𝐸) → (𝑧 ∈ {𝑥} ∨ 𝑧 ∈ trCl(𝑥, 𝐴, 𝑅)))
2819, 25, 27mpjaodan 960 . 2 ((𝜒𝑧𝐸) → (𝑄𝑧) = (𝐺𝑊))
2928ralrimiva 3124 1 (𝜒 → ∀𝑧𝐸 (𝑄𝑧) = (𝐺𝑊))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 206  wa 395  wo 847  w3a 1086   = wceq 1541  wex 1780  wcel 2111  {cab 2709  wne 2928  wral 3047  wrex 3056  {crab 3395  [wsbc 3736  cun 3895  wss 3897  c0 4280  {csn 4573  cop 4579   cuni 4856   class class class wbr 5089  dom cdm 5614  cres 5616   Fn wfn 6476  cfv 6481  w-bnj17 34698   predc-bnj14 34700   FrSe w-bnj15 34704   trClc-bnj18 34706
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-10 2144  ax-11 2160  ax-12 2180  ax-ext 2703  ax-rep 5215  ax-sep 5232  ax-nul 5242  ax-pow 5301  ax-pr 5368  ax-un 7668  ax-reg 9478  ax-inf2 9531
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2535  df-eu 2564  df-clab 2710  df-cleq 2723  df-clel 2806  df-nfc 2881  df-ne 2929  df-ral 3048  df-rex 3057  df-reu 3347  df-rab 3396  df-v 3438  df-sbc 3737  df-csb 3846  df-dif 3900  df-un 3902  df-in 3904  df-ss 3914  df-pss 3917  df-nul 4281  df-if 4473  df-pw 4549  df-sn 4574  df-pr 4576  df-op 4580  df-uni 4857  df-iun 4941  df-br 5090  df-opab 5152  df-mpt 5171  df-tr 5197  df-id 5509  df-eprel 5514  df-po 5522  df-so 5523  df-fr 5567  df-we 5569  df-xp 5620  df-rel 5621  df-cnv 5622  df-co 5623  df-dm 5624  df-rn 5625  df-res 5626  df-ima 5627  df-ord 6309  df-on 6310  df-lim 6311  df-suc 6312  df-iota 6437  df-fun 6483  df-fn 6484  df-f 6485  df-f1 6486  df-fo 6487  df-f1o 6488  df-fv 6489  df-om 7797  df-1o 8385  df-bnj17 34699  df-bnj14 34701  df-bnj13 34703  df-bnj15 34705  df-bnj18 34707
This theorem is referenced by:  bnj1312  35070
  Copyright terms: Public domain W3C validator