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 30373
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
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 250 . . . 4 ((𝜒𝑧𝐸) ↔ (𝜒𝑧𝐸))
18 biid 250 . . . 4 (((𝜒𝑧𝐸) ∧ 𝑧 ∈ {𝑥}) ↔ ((𝜒𝑧𝐸) ∧ 𝑧 ∈ {𝑥}))
191, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18bnj1442 30371 . . 3 (((𝜒𝑧𝐸) ∧ 𝑧 ∈ {𝑥}) → (𝑄𝑧) = (𝐺𝑊))
20 biid 250 . . . 4 (((𝜒𝑧𝐸) ∧ 𝑧 ∈ trCl(𝑥, 𝐴, 𝑅)) ↔ ((𝜒𝑧𝐸) ∧ 𝑧 ∈ trCl(𝑥, 𝐴, 𝑅)))
21 biid 250 . . . 4 ((((𝜒𝑧𝐸) ∧ 𝑧 ∈ trCl(𝑥, 𝐴, 𝑅)) ∧ 𝑓𝐻𝑧 ∈ dom 𝑓) ↔ (((𝜒𝑧𝐸) ∧ 𝑧 ∈ trCl(𝑥, 𝐴, 𝑅)) ∧ 𝑓𝐻𝑧 ∈ dom 𝑓))
22 biid 250 . . . 4 (((((𝜒𝑧𝐸) ∧ 𝑧 ∈ trCl(𝑥, 𝐴, 𝑅)) ∧ 𝑓𝐻𝑧 ∈ dom 𝑓) ∧ 𝑦 ∈ pred(𝑥, 𝐴, 𝑅) ∧ 𝑓𝐶 ∧ dom 𝑓 = ({𝑦} ∪ trCl(𝑦, 𝐴, 𝑅))) ↔ ((((𝜒𝑧𝐸) ∧ 𝑧 ∈ trCl(𝑥, 𝐴, 𝑅)) ∧ 𝑓𝐻𝑧 ∈ dom 𝑓) ∧ 𝑦 ∈ pred(𝑥, 𝐴, 𝑅) ∧ 𝑓𝐶 ∧ dom 𝑓 = ({𝑦} ∪ trCl(𝑦, 𝐴, 𝑅))))
23 biid 250 . . . 4 ((((((𝜒𝑧𝐸) ∧ 𝑧 ∈ trCl(𝑥, 𝐴, 𝑅)) ∧ 𝑓𝐻𝑧 ∈ dom 𝑓) ∧ 𝑦 ∈ pred(𝑥, 𝐴, 𝑅) ∧ 𝑓𝐶 ∧ dom 𝑓 = ({𝑦} ∪ trCl(𝑦, 𝐴, 𝑅))) ∧ 𝑑𝐵𝑓 Fn 𝑑 ∧ ∀𝑥𝑑 (𝑓𝑥) = (𝐺𝑌)) ↔ (((((𝜒𝑧𝐸) ∧ 𝑧 ∈ trCl(𝑥, 𝐴, 𝑅)) ∧ 𝑓𝐻𝑧 ∈ dom 𝑓) ∧ 𝑦 ∈ pred(𝑥, 𝐴, 𝑅) ∧ 𝑓𝐶 ∧ dom 𝑓 = ({𝑦} ∪ trCl(𝑦, 𝐴, 𝑅))) ∧ 𝑑𝐵𝑓 Fn 𝑑 ∧ ∀𝑥𝑑 (𝑓𝑥) = (𝐺𝑌)))
24 eqid 2610 . . . 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 30372 . . 3 (((𝜒𝑧𝐸) ∧ 𝑧 ∈ trCl(𝑥, 𝐴, 𝑅)) → (𝑄𝑧) = (𝐺𝑊))
2614bnj1424 30163 . . . 4 (𝑧𝐸 → (𝑧 ∈ {𝑥} ∨ 𝑧 ∈ trCl(𝑥, 𝐴, 𝑅)))
2726adantl 481 . . 3 ((𝜒𝑧𝐸) → (𝑧 ∈ {𝑥} ∨ 𝑧 ∈ trCl(𝑥, 𝐴, 𝑅)))
2819, 25, 27mpjaodan 823 . 2 ((𝜒𝑧𝐸) → (𝑄𝑧) = (𝐺𝑊))
2928ralrimiva 2949 1 (𝜒 → ∀𝑧𝐸 (𝑄𝑧) = (𝐺𝑊))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 195  wo 382  wa 383  w3a 1031   = 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  w-bnj17 30005   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-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-rep 4699  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847  ax-reg 8380  ax-inf2 8421
This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3or 1032  df-3an 1033  df-tru 1478  df-fal 1481  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-ral 2901  df-rex 2902  df-reu 2903  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-pss 3556  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-tp 4130  df-op 4132  df-uni 4373  df-iun 4457  df-br 4584  df-opab 4644  df-mpt 4645  df-tr 4681  df-eprel 4949  df-id 4953  df-po 4959  df-so 4960  df-fr 4997  df-we 4999  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-ord 5643  df-on 5644  df-lim 5645  df-suc 5646  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-om 6958  df-1o 7447  df-bnj17 30006  df-bnj14 30008  df-bnj13 30010  df-bnj15 30012  df-bnj18 30014
This theorem is referenced by:  bnj1312  30380
  Copyright terms: Public domain W3C validator