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 35756
Description: Technical lemma for bnj60 35759. 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 2763 . 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 2763 . 2 {𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)[𝑦 / 𝑥](𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))} = {𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)[𝑦 / 𝑥](𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))}
10 eqid 2763 . 2 ∪ {𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)[𝑦 / 𝑥](𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))} = ∪ {𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)[𝑦 / 𝑥](𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))}
11 eqid 2763 . 2 ⟨𝑥, (∪ {𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)[𝑦 / 𝑥](𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))} ↾ pred(𝑥, 𝐴, 𝑅))⟩ = ⟨𝑥, (∪ {𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)[𝑦 / 𝑥](𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))} ↾ pred(𝑥, 𝐴, 𝑅))⟩
12 eqid 2763 . 2 (∪ {𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)[𝑦 / 𝑥](𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))} ∪ {⟨𝑥, (𝐺‘⟨𝑥, (∪ {𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)[𝑦 / 𝑥](𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))} ↾ pred(𝑥, 𝐴, 𝑅))⟩)⟩}) = (∪ {𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)[𝑦 / 𝑥](𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))} ∪ {⟨𝑥, (𝐺‘⟨𝑥, (∪ {𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)[𝑦 / 𝑥](𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))} ↾ pred(𝑥, 𝐴, 𝑅))⟩)⟩})
13 eqid 2763 . 2 ⟨𝑧, ((∪ {𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)[𝑦 / 𝑥](𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))} ∪ {⟨𝑥, (𝐺‘⟨𝑥, (∪ {𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)[𝑦 / 𝑥](𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))} ↾ pred(𝑥, 𝐴, 𝑅))⟩)⟩}) ↾ pred(𝑧, 𝐴, 𝑅))⟩ = ⟨𝑧, ((∪ {𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)[𝑦 / 𝑥](𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))} ∪ {⟨𝑥, (𝐺‘⟨𝑥, (∪ {𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)[𝑦 / 𝑥](𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))} ↾ pred(𝑥, 𝐴, 𝑅))⟩)⟩}) ↾ pred(𝑧, 𝐴, 𝑅))⟩
14 eqid 2763 . 2 ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)) = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅))
151, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14bnj1312 35755 1 (𝑅 FrSe 𝐴 → ∀𝑥 ∈ 𝐴 ∃𝑓 ∈ 𝐶 dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570  ∃wex 1812   ∈ wcel 2147  {cab 2741   ≠ wne 2959  ∀wral 3080  ∃wrex 3090  {crab 3416  [wsbc 3742   ⊆ wss 3900   ∪ cun 4152  ∅c0 4281  {csn 4588  ⟨cop 4838  ∪ cuni 4870   class class class wbr 5106  dom cdm 5655   ↾ cres 5657   Fn wfn 6550  ‘cfv 6555   predc-bnj14 35386   FrSe w-bnj15 35390   trClc-bnj18 35392
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7772  ax-reg 9610  ax-inf2 9666
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-tr 5216  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-ord 6380  df-on 6381  df-lim 6382  df-suc 6383  df-iota 6509  df-fun 6557  df-fn 6558  df-f 6559  df-f1 6560  df-fo 6561  df-f1o 6562  df-fv 6563  df-om 7899  df-1o 8501  df-bnj17 35385  df-bnj14 35387  df-bnj13 35389  df-bnj15 35391  df-bnj18 35393  df-bnj19 35395
This theorem is used by:  bnj1498  35758
  Copyright terms: Public domain W3C validator