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 35681
Description: Technical lemma for bnj60 35692. 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 264 . . . 4 ((𝜒 ∧ 𝑧 ∈ 𝐸) ↔ (𝜒 ∧ 𝑧 ∈ 𝐸))
18 biid 264 . . . 4 (((𝜒 ∧ 𝑧 ∈ 𝐸) ∧ 𝑧 ∈ {𝑥}) ↔ ((𝜒 ∧ 𝑧 ∈ 𝐸) ∧ 𝑧 ∈ {𝑥}))
191, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18bnj1442 35679 . . 3 (((𝜒 ∧ 𝑧 ∈ 𝐸) ∧ 𝑧 ∈ {𝑥}) → (𝑄‘𝑧) = (𝐺‘𝑊))
20 biid 264 . . . 4 (((𝜒 ∧ 𝑧 ∈ 𝐸) ∧ 𝑧 ∈ trCl(𝑥, 𝐴, 𝑅)) ↔ ((𝜒 ∧ 𝑧 ∈ 𝐸) ∧ 𝑧 ∈ trCl(𝑥, 𝐴, 𝑅)))
21 biid 264 . . . 4 ((((𝜒 ∧ 𝑧 ∈ 𝐸) ∧ 𝑧 ∈ trCl(𝑥, 𝐴, 𝑅)) ∧ 𝑓 ∈ 𝐻 ∧ 𝑧 ∈ dom 𝑓) ↔ (((𝜒 ∧ 𝑧 ∈ 𝐸) ∧ 𝑧 ∈ trCl(𝑥, 𝐴, 𝑅)) ∧ 𝑓 ∈ 𝐻 ∧ 𝑧 ∈ dom 𝑓))
22 biid 264 . . . 4 (((((𝜒 ∧ 𝑧 ∈ 𝐸) ∧ 𝑧 ∈ trCl(𝑥, 𝐴, 𝑅)) ∧ 𝑓 ∈ 𝐻 ∧ 𝑧 ∈ dom 𝑓) ∧ 𝑦 ∈ pred(𝑥, 𝐴, 𝑅) ∧ 𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑦} ∪ trCl(𝑦, 𝐴, 𝑅))) ↔ ((((𝜒 ∧ 𝑧 ∈ 𝐸) ∧ 𝑧 ∈ trCl(𝑥, 𝐴, 𝑅)) ∧ 𝑓 ∈ 𝐻 ∧ 𝑧 ∈ dom 𝑓) ∧ 𝑦 ∈ pred(𝑥, 𝐴, 𝑅) ∧ 𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑦} ∪ trCl(𝑦, 𝐴, 𝑅))))
23 biid 264 . . . 4 ((((((𝜒 ∧ 𝑧 ∈ 𝐸) ∧ 𝑧 ∈ trCl(𝑥, 𝐴, 𝑅)) ∧ 𝑓 ∈ 𝐻 ∧ 𝑧 ∈ dom 𝑓) ∧ 𝑦 ∈ pred(𝑥, 𝐴, 𝑅) ∧ 𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑦} ∪ trCl(𝑦, 𝐴, 𝑅))) ∧ 𝑑 ∈ 𝐵 ∧ 𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌)) ↔ (((((𝜒 ∧ 𝑧 ∈ 𝐸) ∧ 𝑧 ∈ trCl(𝑥, 𝐴, 𝑅)) ∧ 𝑓 ∈ 𝐻 ∧ 𝑧 ∈ dom 𝑓) ∧ 𝑦 ∈ pred(𝑥, 𝐴, 𝑅) ∧ 𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑦} ∪ trCl(𝑦, 𝐴, 𝑅))) ∧ 𝑑 ∈ 𝐵 ∧ 𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌)))
24 eqid 2760 . . . 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 35680 . . 3 (((𝜒 ∧ 𝑧 ∈ 𝐸) ∧ 𝑧 ∈ trCl(𝑥, 𝐴, 𝑅)) → (𝑄‘𝑧) = (𝐺‘𝑊))
2614bnj1424 35468 . . . 4 (𝑧 ∈ 𝐸 → (𝑧 ∈ {𝑥} ∨ 𝑧 ∈ trCl(𝑥, 𝐴, 𝑅)))
2726adantl 487 . . 3 ((𝜒 ∧ 𝑧 ∈ 𝐸) → (𝑧 ∈ {𝑥} ∨ 𝑧 ∈ trCl(𝑥, 𝐴, 𝑅)))
2819, 25, 27mpjaodan 973 . 2 ((𝜒 ∧ 𝑧 ∈ 𝐸) → (𝑄‘𝑧) = (𝐺‘𝑊))
2928ralrimiva 3154 1 (𝜒 → ∀𝑧 ∈ 𝐸 (𝑄‘𝑧) = (𝐺‘𝑊))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∨ wo 861   ∧ w3a 1103   = wceq 1569  ∃wex 1811   ∈ wcel 2144  {cab 2738   ≠ wne 2955  ∀wral 3076  ∃wrex 3086  {crab 3412  [wsbc 3738   ⊆ wss 3895   ∪ cun 4149  ∅c0 4278  {csn 4583  ⟨cop 4589  ∪ cuni 4866   class class class wbr 5102  dom cdm 5650   ↾ cres 5652   Fn wfn 6533  ‘cfv 6538   ∧ w-bnj17 35317   predc-bnj14 35319   FrSe w-bnj15 35323   trClc-bnj18 35325
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7751  ax-reg 9586  ax-inf2 9642
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-pss 4014  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5545  df-eprel 5550  df-po 5558  df-so 5559  df-fr 5603  df-we 5605  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-om 7878  df-1o 8476  df-bnj17 35318  df-bnj14 35320  df-bnj13 35322  df-bnj15 35324  df-bnj18 35326
This theorem is used by:  bnj1312  35688
  Copyright terms: Public domain W3C validator