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

Theorem bnj1415 35651
Description: Technical lemma for bnj60 35675. 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
bnj1415.1 𝐵 = {𝑑 ∣ (𝑑 ⊆ 𝐴 ∧ ∀𝑥 ∈ 𝑑 pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑)}
bnj1415.2 𝑌 = ⟨𝑥, (𝑓 ↾ pred(𝑥, 𝐴, 𝑅))⟩
bnj1415.3 𝐶 = {𝑓 ∣ ∃𝑑 ∈ 𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌))}
bnj1415.4 (𝜏 ↔ (𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅))))
bnj1415.5 𝐷 = {𝑥 ∈ 𝐴 ∣ ¬ ∃𝑓𝜏}
bnj1415.6 (𝜓 ↔ (𝑅 FrSe 𝐴 ∧ 𝐷 ≠ ∅))
bnj1415.7 (𝜒 ↔ (𝜓 ∧ 𝑥 ∈ 𝐷 ∧ ∀𝑦 ∈ 𝐷 ¬ 𝑦𝑅𝑥))
bnj1415.8 (𝜏′ ↔ [𝑦 / 𝑥]𝜏)
bnj1415.9 𝐻 = {𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)𝜏′}
bnj1415.10 𝑃 = ∪ 𝐻
Assertion
Ref Expression
bnj1415 (𝜒 → dom 𝑃 = trCl(𝑥, 𝐴, 𝑅))
Distinct variable groups:   𝐴,𝑓,𝑥,𝑦   𝐵,𝑓   𝑦,𝐶   𝑦,𝐷   𝑅,𝑓,𝑥,𝑦   𝑓,𝑑,𝑥   𝜓,𝑦   𝜏,𝑦
Allowed substitution hints:   𝜓(𝑥, 𝑓, 𝑑)   𝜒(𝑥, 𝑦, 𝑓, 𝑑)   𝜏(𝑥, 𝑓, 𝑑)   𝐴(𝑑)   𝐵(𝑥, 𝑦, 𝑑)   𝐶(𝑥, 𝑓, 𝑑)   𝐷(𝑥, 𝑓, 𝑑)   𝑃(𝑥, 𝑦, 𝑓, 𝑑)   𝑅(𝑑)   𝐺(𝑥, 𝑦, 𝑓, 𝑑)   𝐻(𝑥, 𝑦, 𝑓, 𝑑)   𝑌(𝑥, 𝑦, 𝑓, 𝑑)   𝜏′(𝑥, 𝑦, 𝑓, 𝑑)

Proof of Theorem bnj1415
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 bnj1415.7 . . . 4 (𝜒 ↔ (𝜓 ∧ 𝑥 ∈ 𝐷 ∧ ∀𝑦 ∈ 𝐷 ¬ 𝑦𝑅𝑥))
2 bnj1415.6 . . . . 5 (𝜓 ↔ (𝑅 FrSe 𝐴 ∧ 𝐷 ≠ ∅))
32simplbi 502 . . . 4 (𝜓 → 𝑅 FrSe 𝐴)
41, 3bnj835 35373 . . 3 (𝜒 → 𝑅 FrSe 𝐴)
5 bnj1415.5 . . . 4 𝐷 = {𝑥 ∈ 𝐴 ∣ ¬ ∃𝑓𝜏}
65, 1bnj1212 35412 . . 3 (𝜒 → 𝑥 ∈ 𝐴)
7 eqid 2761 . . . 4 ( pred(𝑥, 𝐴, 𝑅) ∪ ∪ 𝑦 ∈ pred (𝑥, 𝐴, 𝑅) trCl(𝑦, 𝐴, 𝑅)) = ( pred(𝑥, 𝐴, 𝑅) ∪ ∪ 𝑦 ∈ pred (𝑥, 𝐴, 𝑅) trCl(𝑦, 𝐴, 𝑅))
87bnj1414 35650 . . 3 ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → trCl(𝑥, 𝐴, 𝑅) = ( pred(𝑥, 𝐴, 𝑅) ∪ ∪ 𝑦 ∈ pred (𝑥, 𝐴, 𝑅) trCl(𝑦, 𝐴, 𝑅)))
94, 6, 8syl2anc 596 . 2 (𝜒 → trCl(𝑥, 𝐴, 𝑅) = ( pred(𝑥, 𝐴, 𝑅) ∪ ∪ 𝑦 ∈ pred (𝑥, 𝐴, 𝑅) trCl(𝑦, 𝐴, 𝑅)))
10 iunun 5053 . . . 4 ∪ 𝑦 ∈ pred (𝑥, 𝐴, 𝑅)({𝑦} ∪ trCl(𝑦, 𝐴, 𝑅)) = (∪ 𝑦 ∈ pred (𝑥, 𝐴, 𝑅){𝑦} ∪ ∪ 𝑦 ∈ pred (𝑥, 𝐴, 𝑅) trCl(𝑦, 𝐴, 𝑅))
11 iunid 5019 . . . . 5 ∪ 𝑦 ∈ pred (𝑥, 𝐴, 𝑅){𝑦} = pred(𝑥, 𝐴, 𝑅)
1211uneq1i 4111 . . . 4 (∪ 𝑦 ∈ pred (𝑥, 𝐴, 𝑅){𝑦} ∪ ∪ 𝑦 ∈ pred (𝑥, 𝐴, 𝑅) trCl(𝑦, 𝐴, 𝑅)) = ( pred(𝑥, 𝐴, 𝑅) ∪ ∪ 𝑦 ∈ pred (𝑥, 𝐴, 𝑅) trCl(𝑦, 𝐴, 𝑅))
1310, 12eqtri 2784 . . 3 ∪ 𝑦 ∈ pred (𝑥, 𝐴, 𝑅)({𝑦} ∪ trCl(𝑦, 𝐴, 𝑅)) = ( pred(𝑥, 𝐴, 𝑅) ∪ ∪ 𝑦 ∈ pred (𝑥, 𝐴, 𝑅) trCl(𝑦, 𝐴, 𝑅))
14 bnj1415.1 . . . 4 𝐵 = {𝑑 ∣ (𝑑 ⊆ 𝐴 ∧ ∀𝑥 ∈ 𝑑 pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑)}
15 bnj1415.2 . . . 4 𝑌 = ⟨𝑥, (𝑓 ↾ pred(𝑥, 𝐴, 𝑅))⟩
16 bnj1415.3 . . . 4 𝐶 = {𝑓 ∣ ∃𝑑 ∈ 𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌))}
17 bnj1415.4 . . . 4 (𝜏 ↔ (𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅))))
18 bnj1415.8 . . . 4 (𝜏′ ↔ [𝑦 / 𝑥]𝜏)
19 bnj1415.9 . . . 4 𝐻 = {𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)𝜏′}
20 bnj1415.10 . . . 4 𝑃 = ∪ 𝐻
21 biid 264 . . . 4 ((𝜒 ∧ 𝑧 ∈ ∪ 𝑦 ∈ pred (𝑥, 𝐴, 𝑅)({𝑦} ∪ trCl(𝑦, 𝐴, 𝑅))) ↔ (𝜒 ∧ 𝑧 ∈ ∪ 𝑦 ∈ pred (𝑥, 𝐴, 𝑅)({𝑦} ∪ trCl(𝑦, 𝐴, 𝑅))))
22 biid 264 . . . 4 (((𝜒 ∧ 𝑧 ∈ ∪ 𝑦 ∈ pred (𝑥, 𝐴, 𝑅)({𝑦} ∪ trCl(𝑦, 𝐴, 𝑅))) ∧ 𝑦 ∈ pred(𝑥, 𝐴, 𝑅) ∧ 𝑧 ∈ ({𝑦} ∪ trCl(𝑦, 𝐴, 𝑅))) ↔ ((𝜒 ∧ 𝑧 ∈ ∪ 𝑦 ∈ pred (𝑥, 𝐴, 𝑅)({𝑦} ∪ trCl(𝑦, 𝐴, 𝑅))) ∧ 𝑦 ∈ pred(𝑥, 𝐴, 𝑅) ∧ 𝑧 ∈ ({𝑦} ∪ trCl(𝑦, 𝐴, 𝑅))))
2314, 15, 16, 17, 5, 2, 1, 18, 19, 20, 21, 22bnj1398 35647 . . 3 (𝜒 → ∪ 𝑦 ∈ pred (𝑥, 𝐴, 𝑅)({𝑦} ∪ trCl(𝑦, 𝐴, 𝑅)) = dom 𝑃)
2413, 23eqtr3id 2810 . 2 (𝜒 → ( pred(𝑥, 𝐴, 𝑅) ∪ ∪ 𝑦 ∈ pred (𝑥, 𝐴, 𝑅) trCl(𝑦, 𝐴, 𝑅)) = dom 𝑃)
259, 24eqtr2d 2797 1 (𝜒 → dom 𝑃 = trCl(𝑥, 𝐴, 𝑅))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570  ∃wex 1812   ∈ wcel 2145  {cab 2739   ≠ wne 2956  ∀wral 3077  ∃wrex 3087  {crab 3413  [wsbc 3739   ∪ cun 3897   ⊆ wss 3899  ∅c0 4279  {csn 4584  ⟨cop 4590  ∪ cuni 4867  ∪ ciun 4951   class class class wbr 5103  dom cdm 5651   ↾ cres 5653   Fn wfn 6526  ‘cfv 6531   predc-bnj14 35302   FrSe w-bnj15 35306   trClc-bnj18 35308
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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7740  ax-reg 9570  ax-inf2 9626
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 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-ord 6358  df-on 6359  df-lim 6360  df-suc 6361  df-iota 6487  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-om 7867  df-1o 8460  df-bnj17 35301  df-bnj14 35303  df-bnj13 35305  df-bnj15 35307  df-bnj18 35309  df-bnj19 35311
This theorem is used by:  bnj1312  35671
  Copyright terms: Public domain W3C validator