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 30381
 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
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 250 . 2 ((𝑓𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅))) ↔ (𝑓𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅))))
5 eqid 2610 . 2 {𝑥𝐴 ∣ ¬ ∃𝑓(𝑓𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))} = {𝑥𝐴 ∣ ¬ ∃𝑓(𝑓𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))}
6 biid 250 . 2 ((𝑅 FrSe 𝐴 ∧ {𝑥𝐴 ∣ ¬ ∃𝑓(𝑓𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))} ≠ ∅) ↔ (𝑅 FrSe 𝐴 ∧ {𝑥𝐴 ∣ ¬ ∃𝑓(𝑓𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))} ≠ ∅))
7 biid 250 . 2 (((𝑅 FrSe 𝐴 ∧ {𝑥𝐴 ∣ ¬ ∃𝑓(𝑓𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))} ≠ ∅) ∧ 𝑥 ∈ {𝑥𝐴 ∣ ¬ ∃𝑓(𝑓𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))} ∧ ∀𝑦 ∈ {𝑥𝐴 ∣ ¬ ∃𝑓(𝑓𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))} ¬ 𝑦𝑅𝑥) ↔ ((𝑅 FrSe 𝐴 ∧ {𝑥𝐴 ∣ ¬ ∃𝑓(𝑓𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))} ≠ ∅) ∧ 𝑥 ∈ {𝑥𝐴 ∣ ¬ ∃𝑓(𝑓𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))} ∧ ∀𝑦 ∈ {𝑥𝐴 ∣ ¬ ∃𝑓(𝑓𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))} ¬ 𝑦𝑅𝑥))
8 biid 250 . 2 ([𝑦 / 𝑥](𝑓𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅))) ↔ [𝑦 / 𝑥](𝑓𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅))))
9 eqid 2610 . 2 {𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)[𝑦 / 𝑥](𝑓𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))} = {𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)[𝑦 / 𝑥](𝑓𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))}
10 eqid 2610 . 2 {𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)[𝑦 / 𝑥](𝑓𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))} = {𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)[𝑦 / 𝑥](𝑓𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))}
11 eqid 2610 . 2 𝑥, ( {𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)[𝑦 / 𝑥](𝑓𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))} ↾ pred(𝑥, 𝐴, 𝑅))⟩ = ⟨𝑥, ( {𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)[𝑦 / 𝑥](𝑓𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))} ↾ pred(𝑥, 𝐴, 𝑅))⟩
12 eqid 2610 . 2 ( {𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)[𝑦 / 𝑥](𝑓𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))} ∪ {⟨𝑥, (𝐺‘⟨𝑥, ( {𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)[𝑦 / 𝑥](𝑓𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))} ↾ pred(𝑥, 𝐴, 𝑅))⟩)⟩}) = ( {𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)[𝑦 / 𝑥](𝑓𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))} ∪ {⟨𝑥, (𝐺‘⟨𝑥, ( {𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)[𝑦 / 𝑥](𝑓𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))} ↾ pred(𝑥, 𝐴, 𝑅))⟩)⟩})
13 eqid 2610 . 2 𝑧, (( {𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)[𝑦 / 𝑥](𝑓𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))} ∪ {⟨𝑥, (𝐺‘⟨𝑥, ( {𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)[𝑦 / 𝑥](𝑓𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))} ↾ pred(𝑥, 𝐴, 𝑅))⟩)⟩}) ↾ pred(𝑧, 𝐴, 𝑅))⟩ = ⟨𝑧, (( {𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)[𝑦 / 𝑥](𝑓𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))} ∪ {⟨𝑥, (𝐺‘⟨𝑥, ( {𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)[𝑦 / 𝑥](𝑓𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))} ↾ pred(𝑥, 𝐴, 𝑅))⟩)⟩}) ↾ pred(𝑧, 𝐴, 𝑅))⟩
14 eqid 2610 . 2 ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)) = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅))
151, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14bnj1312 30380 1 (𝑅 FrSe 𝐴 → ∀𝑥𝐴𝑓𝐶 dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))
 Colors of variables: wff setvar class Syntax hints:  ¬ wn 3   → wi 4   ∧ 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   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  df-bnj19 30016 This theorem is referenced by:  bnj1498  30383
 Copyright terms: Public domain W3C validator