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 32433
Description: Technical lemma for bnj60 32444. 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 264 . . . 4 ((𝜒𝑧𝐸) ↔ (𝜒𝑧𝐸))
18 biid 264 . . . 4 (((𝜒𝑧𝐸) ∧ 𝑧 ∈ {𝑥}) ↔ ((𝜒𝑧𝐸) ∧ 𝑧 ∈ {𝑥}))
191, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18bnj1442 32431 . . 3 (((𝜒𝑧𝐸) ∧ 𝑧 ∈ {𝑥}) → (𝑄𝑧) = (𝐺𝑊))
20 biid 264 . . . 4 (((𝜒𝑧𝐸) ∧ 𝑧 ∈ trCl(𝑥, 𝐴, 𝑅)) ↔ ((𝜒𝑧𝐸) ∧ 𝑧 ∈ trCl(𝑥, 𝐴, 𝑅)))
21 biid 264 . . . 4 ((((𝜒𝑧𝐸) ∧ 𝑧 ∈ trCl(𝑥, 𝐴, 𝑅)) ∧ 𝑓𝐻𝑧 ∈ dom 𝑓) ↔ (((𝜒𝑧𝐸) ∧ 𝑧 ∈ trCl(𝑥, 𝐴, 𝑅)) ∧ 𝑓𝐻𝑧 ∈ dom 𝑓))
22 biid 264 . . . 4 (((((𝜒𝑧𝐸) ∧ 𝑧 ∈ trCl(𝑥, 𝐴, 𝑅)) ∧ 𝑓𝐻𝑧 ∈ dom 𝑓) ∧ 𝑦 ∈ pred(𝑥, 𝐴, 𝑅) ∧ 𝑓𝐶 ∧ dom 𝑓 = ({𝑦} ∪ trCl(𝑦, 𝐴, 𝑅))) ↔ ((((𝜒𝑧𝐸) ∧ 𝑧 ∈ trCl(𝑥, 𝐴, 𝑅)) ∧ 𝑓𝐻𝑧 ∈ dom 𝑓) ∧ 𝑦 ∈ pred(𝑥, 𝐴, 𝑅) ∧ 𝑓𝐶 ∧ dom 𝑓 = ({𝑦} ∪ trCl(𝑦, 𝐴, 𝑅))))
23 biid 264 . . . 4 ((((((𝜒𝑧𝐸) ∧ 𝑧 ∈ trCl(𝑥, 𝐴, 𝑅)) ∧ 𝑓𝐻𝑧 ∈ dom 𝑓) ∧ 𝑦 ∈ pred(𝑥, 𝐴, 𝑅) ∧ 𝑓𝐶 ∧ dom 𝑓 = ({𝑦} ∪ trCl(𝑦, 𝐴, 𝑅))) ∧ 𝑑𝐵𝑓 Fn 𝑑 ∧ ∀𝑥𝑑 (𝑓𝑥) = (𝐺𝑌)) ↔ (((((𝜒𝑧𝐸) ∧ 𝑧 ∈ trCl(𝑥, 𝐴, 𝑅)) ∧ 𝑓𝐻𝑧 ∈ dom 𝑓) ∧ 𝑦 ∈ pred(𝑥, 𝐴, 𝑅) ∧ 𝑓𝐶 ∧ dom 𝑓 = ({𝑦} ∪ trCl(𝑦, 𝐴, 𝑅))) ∧ 𝑑𝐵𝑓 Fn 𝑑 ∧ ∀𝑥𝑑 (𝑓𝑥) = (𝐺𝑌)))
24 eqid 2798 . . . 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 32432 . . 3 (((𝜒𝑧𝐸) ∧ 𝑧 ∈ trCl(𝑥, 𝐴, 𝑅)) → (𝑄𝑧) = (𝐺𝑊))
2614bnj1424 32220 . . . 4 (𝑧𝐸 → (𝑧 ∈ {𝑥} ∨ 𝑧 ∈ trCl(𝑥, 𝐴, 𝑅)))
2726adantl 485 . . 3 ((𝜒𝑧𝐸) → (𝑧 ∈ {𝑥} ∨ 𝑧 ∈ trCl(𝑥, 𝐴, 𝑅)))
2819, 25, 27mpjaodan 956 . 2 ((𝜒𝑧𝐸) → (𝑄𝑧) = (𝐺𝑊))
2928ralrimiva 3149 1 (𝜒 → ∀𝑧𝐸 (𝑄𝑧) = (𝐺𝑊))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 209  wa 399  wo 844  w3a 1084   = wceq 1538  wex 1781  wcel 2111  {cab 2776  wne 2987  wral 3106  wrex 3107  {crab 3110  [wsbc 3720  cun 3879  wss 3881  c0 4243  {csn 4525  cop 4531   cuni 4800   class class class wbr 5030  dom cdm 5519  cres 5521   Fn wfn 6319  cfv 6324  w-bnj17 32066   predc-bnj14 32068   FrSe w-bnj15 32072   trClc-bnj18 32074
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 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-rep 5154  ax-sep 5167  ax-nul 5174  ax-pow 5231  ax-pr 5295  ax-un 7441  ax-reg 9040  ax-inf2 9088
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3or 1085  df-3an 1086  df-tru 1541  df-fal 1551  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-ral 3111  df-rex 3112  df-reu 3113  df-rab 3115  df-v 3443  df-sbc 3721  df-csb 3829  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-pss 3900  df-nul 4244  df-if 4426  df-pw 4499  df-sn 4526  df-pr 4528  df-tp 4530  df-op 4532  df-uni 4801  df-iun 4883  df-br 5031  df-opab 5093  df-mpt 5111  df-tr 5137  df-id 5425  df-eprel 5430  df-po 5438  df-so 5439  df-fr 5478  df-we 5480  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-rn 5530  df-res 5531  df-ima 5532  df-ord 6162  df-on 6163  df-lim 6164  df-suc 6165  df-iota 6283  df-fun 6326  df-fn 6327  df-f 6328  df-f1 6329  df-fo 6330  df-f1o 6331  df-fv 6332  df-om 7561  df-1o 8085  df-bnj17 32067  df-bnj14 32069  df-bnj13 32071  df-bnj15 32073  df-bnj18 32075
This theorem is referenced by:  bnj1312  32440
  Copyright terms: Public domain W3C validator