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

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

Proof of Theorem bnj1421
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 bnj1421.13 . . . 4 (𝜒 → Fun 𝑃)
2 vex 3454 . . . . 5 𝑥 ∈ V
3 fvex 6898 . . . . 5 (𝐺‘𝑍) ∈ V
42, 3funsn 6593 . . . 4 Fun {⟨𝑥, (𝐺‘𝑍)⟩}
51, 4jctir 530 . . 3 (𝜒 → (Fun 𝑃 ∧ Fun {⟨𝑥, (𝐺‘𝑍)⟩}))
6 bnj1421.15 . . . . 5 (𝜒 → dom 𝑃 = trCl(𝑥, 𝐴, 𝑅))
73dmsnop 6217 . . . . . 6 dom {⟨𝑥, (𝐺‘𝑍)⟩} = {𝑥}
87a1i 11 . . . . 5 (𝜒 → dom {⟨𝑥, (𝐺‘𝑍)⟩} = {𝑥})
96, 8ineq12d 4118 . . . 4 (𝜒 → (dom 𝑃 ∩ dom {⟨𝑥, (𝐺‘𝑍)⟩}) = ( trCl(𝑥, 𝐴, 𝑅) ∩ {𝑥}))
10 bnj1421.7 . . . . . . 7 (𝜒 ↔ (𝜓 ∧ 𝑥 ∈ 𝐷 ∧ ∀𝑦 ∈ 𝐷 ¬ 𝑦𝑅𝑥))
11 bnj1421.6 . . . . . . . 8 (𝜓 ↔ (𝑅 FrSe 𝐴 ∧ 𝐷 ≠ ∅))
1211simplbi 502 . . . . . . 7 (𝜓 → 𝑅 FrSe 𝐴)
1310, 12bnj835 35390 . . . . . 6 (𝜒 → 𝑅 FrSe 𝐴)
14 biid 264 . . . . . . . 8 (𝑅 FrSe 𝐴 ↔ 𝑅 FrSe 𝐴)
15 biid 264 . . . . . . . 8 (¬ 𝑥 ∈ trCl(𝑥, 𝐴, 𝑅) ↔ ¬ 𝑥 ∈ trCl(𝑥, 𝐴, 𝑅))
16 biid 264 . . . . . . . 8 (∀𝑧 ∈ 𝐴 (𝑧𝑅𝑥 → [𝑧 / 𝑥] ¬ 𝑥 ∈ trCl(𝑥, 𝐴, 𝑅)) ↔ ∀𝑧 ∈ 𝐴 (𝑧𝑅𝑥 → [𝑧 / 𝑥] ¬ 𝑥 ∈ trCl(𝑥, 𝐴, 𝑅)))
17 biid 264 . . . . . . . 8 ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴 ∧ ∀𝑧 ∈ 𝐴 (𝑧𝑅𝑥 → [𝑧 / 𝑥] ¬ 𝑥 ∈ trCl(𝑥, 𝐴, 𝑅))) ↔ (𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴 ∧ ∀𝑧 ∈ 𝐴 (𝑧𝑅𝑥 → [𝑧 / 𝑥] ¬ 𝑥 ∈ trCl(𝑥, 𝐴, 𝑅))))
18 eqid 2760 . . . . . . . 8 ( pred(𝑥, 𝐴, 𝑅) ∪ ∪ 𝑧 ∈ pred (𝑥, 𝐴, 𝑅) trCl(𝑧, 𝐴, 𝑅)) = ( pred(𝑥, 𝐴, 𝑅) ∪ ∪ 𝑧 ∈ pred (𝑥, 𝐴, 𝑅) trCl(𝑧, 𝐴, 𝑅))
1914, 15, 16, 17, 18bnj1417 35671 . . . . . . 7 (𝑅 FrSe 𝐴 → ∀𝑥 ∈ 𝐴 ¬ 𝑥 ∈ trCl(𝑥, 𝐴, 𝑅))
20 disjsn 4671 . . . . . . . 8 (( trCl(𝑥, 𝐴, 𝑅) ∩ {𝑥}) = ∅ ↔ ¬ 𝑥 ∈ trCl(𝑥, 𝐴, 𝑅))
2120ralbii 3108 . . . . . . 7 (∀𝑥 ∈ 𝐴 ( trCl(𝑥, 𝐴, 𝑅) ∩ {𝑥}) = ∅ ↔ ∀𝑥 ∈ 𝐴 ¬ 𝑥 ∈ trCl(𝑥, 𝐴, 𝑅))
2219, 21sylibr 237 . . . . . 6 (𝑅 FrSe 𝐴 → ∀𝑥 ∈ 𝐴 ( trCl(𝑥, 𝐴, 𝑅) ∩ {𝑥}) = ∅)
2313, 22syl 18 . . . . 5 (𝜒 → ∀𝑥 ∈ 𝐴 ( trCl(𝑥, 𝐴, 𝑅) ∩ {𝑥}) = ∅)
24 bnj1421.5 . . . . . 6 𝐷 = {𝑥 ∈ 𝐴 ∣ ¬ ∃𝑓𝜏}
2524, 10bnj1212 35429 . . . . 5 (𝜒 → 𝑥 ∈ 𝐴)
2623, 25bnj1294 35447 . . . 4 (𝜒 → ( trCl(𝑥, 𝐴, 𝑅) ∩ {𝑥}) = ∅)
279, 26eqtrd 2795 . . 3 (𝜒 → (dom 𝑃 ∩ dom {⟨𝑥, (𝐺‘𝑍)⟩}) = ∅)
28 funun 6586 . . 3 (((Fun 𝑃 ∧ Fun {⟨𝑥, (𝐺‘𝑍)⟩}) ∧ (dom 𝑃 ∩ dom {⟨𝑥, (𝐺‘𝑍)⟩}) = ∅) → Fun (𝑃 ∪ {⟨𝑥, (𝐺‘𝑍)⟩}))
295, 27, 28syl2anc 596 . 2 (𝜒 → Fun (𝑃 ∪ {⟨𝑥, (𝐺‘𝑍)⟩}))
30 bnj1421.12 . . 3 𝑄 = (𝑃 ∪ {⟨𝑥, (𝐺‘𝑍)⟩})
3130funeqi 6560 . 2 (Fun 𝑄 ↔ Fun (𝑃 ∪ {⟨𝑥, (𝐺‘𝑍)⟩}))
3229, 31sylibr 237 1 (𝜒 → Fun 𝑄)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1569  ∃wex 1811   ∈ wcel 2144  {cab 2738   ≠ wne 2955  ∀wral 3076  ∃wrex 3086  {crab 3412  [wsbc 3738   ⊆ wss 3895   ∩ cin 4089   ∪ cun 4149  ∅c0 4278  {csn 4583  ⟨cop 4589  ∪ cuni 4866  ∪ ciun 4950   class class class wbr 5102  dom cdm 5650   ↾ cres 5652  Fun wfun 6532   Fn wfn 6533  ‘cfv 6538   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  df-bnj19 35328
This theorem is used by:  bnj1312  35688
  Copyright terms: Public domain W3C validator