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

Theorem bnj1493 32356
Description: Technical lemma for bnj60 32359. 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
bnj1493.1 𝐵 = {𝑑 ∣ (𝑑𝐴 ∧ ∀𝑥𝑑 pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑)}
bnj1493.2 𝑌 = ⟨𝑥, (𝑓 ↾ pred(𝑥, 𝐴, 𝑅))⟩
bnj1493.3 𝐶 = {𝑓 ∣ ∃𝑑𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥𝑑 (𝑓𝑥) = (𝐺𝑌))}
Assertion
Ref Expression
bnj1493 (𝑅 FrSe 𝐴 → ∀𝑥𝐴𝑓𝐶 dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))
Distinct variable groups:   𝐴,𝑑,𝑓,𝑥   𝐵,𝑓   𝐺,𝑑,𝑓,𝑥   𝑅,𝑑,𝑓,𝑥
Allowed substitution hints:   𝐵(𝑥,𝑑)   𝐶(𝑥,𝑓,𝑑)   𝑌(𝑥,𝑓,𝑑)

Proof of Theorem bnj1493
Dummy variables 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 bnj1493.1 . 2 𝐵 = {𝑑 ∣ (𝑑𝐴 ∧ ∀𝑥𝑑 pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑)}
2 bnj1493.2 . 2 𝑌 = ⟨𝑥, (𝑓 ↾ pred(𝑥, 𝐴, 𝑅))⟩
3 bnj1493.3 . 2 𝐶 = {𝑓 ∣ ∃𝑑𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥𝑑 (𝑓𝑥) = (𝐺𝑌))}
4 biid 264 . 2 ((𝑓𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅))) ↔ (𝑓𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅))))
5 eqid 2824 . 2 {𝑥𝐴 ∣ ¬ ∃𝑓(𝑓𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))} = {𝑥𝐴 ∣ ¬ ∃𝑓(𝑓𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))}
6 biid 264 . 2 ((𝑅 FrSe 𝐴 ∧ {𝑥𝐴 ∣ ¬ ∃𝑓(𝑓𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))} ≠ ∅) ↔ (𝑅 FrSe 𝐴 ∧ {𝑥𝐴 ∣ ¬ ∃𝑓(𝑓𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))} ≠ ∅))
7 biid 264 . 2 (((𝑅 FrSe 𝐴 ∧ {𝑥𝐴 ∣ ¬ ∃𝑓(𝑓𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))} ≠ ∅) ∧ 𝑥 ∈ {𝑥𝐴 ∣ ¬ ∃𝑓(𝑓𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))} ∧ ∀𝑦 ∈ {𝑥𝐴 ∣ ¬ ∃𝑓(𝑓𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))} ¬ 𝑦𝑅𝑥) ↔ ((𝑅 FrSe 𝐴 ∧ {𝑥𝐴 ∣ ¬ ∃𝑓(𝑓𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))} ≠ ∅) ∧ 𝑥 ∈ {𝑥𝐴 ∣ ¬ ∃𝑓(𝑓𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))} ∧ ∀𝑦 ∈ {𝑥𝐴 ∣ ¬ ∃𝑓(𝑓𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))} ¬ 𝑦𝑅𝑥))
8 biid 264 . 2 ([𝑦 / 𝑥](𝑓𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅))) ↔ [𝑦 / 𝑥](𝑓𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅))))
9 eqid 2824 . 2 {𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)[𝑦 / 𝑥](𝑓𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))} = {𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)[𝑦 / 𝑥](𝑓𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))}
10 eqid 2824 . 2 {𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)[𝑦 / 𝑥](𝑓𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))} = {𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)[𝑦 / 𝑥](𝑓𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))}
11 eqid 2824 . 2 𝑥, ( {𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)[𝑦 / 𝑥](𝑓𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))} ↾ pred(𝑥, 𝐴, 𝑅))⟩ = ⟨𝑥, ( {𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)[𝑦 / 𝑥](𝑓𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))} ↾ pred(𝑥, 𝐴, 𝑅))⟩
12 eqid 2824 . 2 ( {𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)[𝑦 / 𝑥](𝑓𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))} ∪ {⟨𝑥, (𝐺‘⟨𝑥, ( {𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)[𝑦 / 𝑥](𝑓𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))} ↾ pred(𝑥, 𝐴, 𝑅))⟩)⟩}) = ( {𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)[𝑦 / 𝑥](𝑓𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))} ∪ {⟨𝑥, (𝐺‘⟨𝑥, ( {𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)[𝑦 / 𝑥](𝑓𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))} ↾ pred(𝑥, 𝐴, 𝑅))⟩)⟩})
13 eqid 2824 . 2 𝑧, (( {𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)[𝑦 / 𝑥](𝑓𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))} ∪ {⟨𝑥, (𝐺‘⟨𝑥, ( {𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)[𝑦 / 𝑥](𝑓𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))} ↾ pred(𝑥, 𝐴, 𝑅))⟩)⟩}) ↾ pred(𝑧, 𝐴, 𝑅))⟩ = ⟨𝑧, (( {𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)[𝑦 / 𝑥](𝑓𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))} ∪ {⟨𝑥, (𝐺‘⟨𝑥, ( {𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)[𝑦 / 𝑥](𝑓𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))} ↾ pred(𝑥, 𝐴, 𝑅))⟩)⟩}) ↾ pred(𝑧, 𝐴, 𝑅))⟩
14 eqid 2824 . 2 ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)) = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅))
151, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14bnj1312 32355 1 (𝑅 FrSe 𝐴 → ∀𝑥𝐴𝑓𝐶 dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 399  w3a 1084   = wceq 1538  wex 1781  wcel 2115  {cab 2802  wne 3014  wral 3133  wrex 3134  {crab 3137  [wsbc 3758  cun 3917  wss 3919  c0 4275  {csn 4549  cop 4555   cuni 4824   class class class wbr 5052  dom cdm 5542  cres 5544   Fn wfn 6338  cfv 6343   predc-bnj14 31983   FrSe w-bnj15 31987   trClc-bnj18 31989
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 1912  ax-6 1971  ax-7 2016  ax-8 2117  ax-9 2125  ax-10 2146  ax-11 2162  ax-12 2179  ax-ext 2796  ax-rep 5176  ax-sep 5189  ax-nul 5196  ax-pow 5253  ax-pr 5317  ax-un 7451  ax-reg 9047  ax-inf2 9095
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 2071  df-mo 2624  df-eu 2655  df-clab 2803  df-cleq 2817  df-clel 2896  df-nfc 2964  df-ne 3015  df-ral 3138  df-rex 3139  df-reu 3140  df-rab 3142  df-v 3482  df-sbc 3759  df-csb 3867  df-dif 3922  df-un 3924  df-in 3926  df-ss 3936  df-pss 3938  df-nul 4276  df-if 4450  df-pw 4523  df-sn 4550  df-pr 4552  df-tp 4554  df-op 4556  df-uni 4825  df-iun 4907  df-br 5053  df-opab 5115  df-mpt 5133  df-tr 5159  df-id 5447  df-eprel 5452  df-po 5461  df-so 5462  df-fr 5501  df-we 5503  df-xp 5548  df-rel 5549  df-cnv 5550  df-co 5551  df-dm 5552  df-rn 5553  df-res 5554  df-ima 5555  df-ord 6181  df-on 6182  df-lim 6183  df-suc 6184  df-iota 6302  df-fun 6345  df-fn 6346  df-f 6347  df-f1 6348  df-fo 6349  df-f1o 6350  df-fv 6351  df-om 7571  df-1o 8092  df-bnj17 31982  df-bnj14 31984  df-bnj13 31986  df-bnj15 31988  df-bnj18 31990  df-bnj19 31992
This theorem is referenced by:  bnj1498  32358
  Copyright terms: Public domain W3C validator