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 35364
Description: Technical lemma for bnj60 35367. 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 2765 . 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 2765 . 2 {𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)[𝑦 / 𝑥](𝑓𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))} = {𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)[𝑦 / 𝑥](𝑓𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))}
10 eqid 2765 . 2 {𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)[𝑦 / 𝑥](𝑓𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))} = {𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)[𝑦 / 𝑥](𝑓𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))}
11 eqid 2765 . 2 𝑥, ( {𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)[𝑦 / 𝑥](𝑓𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))} ↾ pred(𝑥, 𝐴, 𝑅))⟩ = ⟨𝑥, ( {𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)[𝑦 / 𝑥](𝑓𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))} ↾ pred(𝑥, 𝐴, 𝑅))⟩
12 eqid 2765 . 2 ( {𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)[𝑦 / 𝑥](𝑓𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))} ∪ {⟨𝑥, (𝐺‘⟨𝑥, ( {𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)[𝑦 / 𝑥](𝑓𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))} ↾ pred(𝑥, 𝐴, 𝑅))⟩)⟩}) = ( {𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)[𝑦 / 𝑥](𝑓𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))} ∪ {⟨𝑥, (𝐺‘⟨𝑥, ( {𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)[𝑦 / 𝑥](𝑓𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))} ↾ pred(𝑥, 𝐴, 𝑅))⟩)⟩})
13 eqid 2765 . 2 𝑧, (( {𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)[𝑦 / 𝑥](𝑓𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))} ∪ {⟨𝑥, (𝐺‘⟨𝑥, ( {𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)[𝑦 / 𝑥](𝑓𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))} ↾ pred(𝑥, 𝐴, 𝑅))⟩)⟩}) ↾ pred(𝑧, 𝐴, 𝑅))⟩ = ⟨𝑧, (( {𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)[𝑦 / 𝑥](𝑓𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))} ∪ {⟨𝑥, (𝐺‘⟨𝑥, ( {𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)[𝑦 / 𝑥](𝑓𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))} ↾ pred(𝑥, 𝐴, 𝑅))⟩)⟩}) ↾ pred(𝑧, 𝐴, 𝑅))⟩
14 eqid 2765 . 2 ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)) = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅))
151, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14bnj1312 35363 1 (𝑅 FrSe 𝐴 → ∀𝑥𝐴𝑓𝐶 dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 400  w3a 1101   = wceq 1563  wex 1802  wcel 2145  {cab 2743  wne 2960  wral 3079  wrex 3089  {crab 3417  [wsbc 3747  cun 3905  wss 3907  c0 4288  {csn 4585  cop 4591   cuni 4868   class class class wbr 5105  dom cdm 5652  cres 5654   Fn wfn 6520  cfv 6525   predc-bnj14 34994   FrSe w-bnj15 34998   trClc-bnj18 35000
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2737  ax-rep 5232  ax-sep 5251  ax-nul 5261  ax-pow 5327  ax-pr 5395  ax-un 7722  ax-reg 9542  ax-inf2 9598
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-3an 1103  df-tru 1566  df-fal 1576  df-ex 1803  df-nf 1807  df-sb 2094  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3080  df-rex 3090  df-reu 3371  df-rab 3418  df-v 3459  df-sbc 3748  df-csb 3856  df-dif 3910  df-un 3912  df-in 3914  df-ss 3924  df-pss 3927  df-nul 4289  df-if 4484  df-pw 4560  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4869  df-iun 4954  df-br 5106  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5547  df-eprel 5552  df-po 5560  df-so 5561  df-fr 5605  df-we 5607  df-xp 5658  df-rel 5659  df-cnv 5660  df-co 5661  df-dm 5662  df-rn 5663  df-res 5664  df-ima 5665  df-ord 6353  df-on 6354  df-lim 6355  df-suc 6356  df-iota 6481  df-fun 6527  df-fn 6528  df-f 6529  df-f1 6530  df-fo 6531  df-f1o 6532  df-fv 6533  df-om 7851  df-1o 8441  df-bnj17 34993  df-bnj14 34995  df-bnj13 34997  df-bnj15 34999  df-bnj18 35001  df-bnj19 35003
This theorem is referenced by:  bnj1498  35366
  Copyright terms: Public domain W3C validator