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 35606
Description: Technical lemma for bnj60 35626. 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 6886 . . . . 5 (𝐺𝑍) ∈ V
42, 3funsn 6581 . . . 4 Fun {⟨𝑥, (𝐺𝑍)⟩}
51, 4jctir 530 . . 3 (𝜒 → (Fun 𝑃 ∧ Fun {⟨𝑥, (𝐺𝑍)⟩}))
6 bnj1421.15 . . . . 5 (𝜒 → dom 𝑃 = trCl(𝑥, 𝐴, 𝑅))
73dmsnop 6206 . . . . . 6 dom {⟨𝑥, (𝐺𝑍)⟩} = {𝑥}
87a1i 11 . . . . 5 (𝜒 → dom {⟨𝑥, (𝐺𝑍)⟩} = {𝑥})
96, 8ineq12d 4166 . . . 4 (𝜒 → (dom 𝑃 ∩ dom {⟨𝑥, (𝐺𝑍)⟩}) = ( trCl(𝑥, 𝐴, 𝑅) ∩ {𝑥}))
10 bnj1421.7 . . . . . . 7 (𝜒 ↔ (𝜓𝑥𝐷 ∧ ∀𝑦𝐷 ¬ 𝑦𝑅𝑥))
11 bnj1421.6 . . . . . . . 8 (𝜓 ↔ (𝑅 FrSe 𝐴𝐷 ≠ ∅))
1211simplbi 502 . . . . . . 7 (𝜓𝑅 FrSe 𝐴)
1310, 12bnj835 35324 . . . . . 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 35605 . . . . . . 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 35363 . . . . 5 (𝜒𝑥𝐴)
2623, 25bnj1294 35381 . . . 4 (𝜒 → ( trCl(𝑥, 𝐴, 𝑅) ∩ {𝑥}) = ∅)
279, 26eqtrd 2795 . . 3 (𝜒 → (dom 𝑃 ∩ dom {⟨𝑥, (𝐺𝑍)⟩}) = ∅)
28 funun 6574 . . 3 (((Fun 𝑃 ∧ Fun {⟨𝑥, (𝐺𝑍)⟩}) ∧ (dom 𝑃 ∩ dom {⟨𝑥, (𝐺𝑍)⟩}) = ∅) → Fun (𝑃 ∪ {⟨𝑥, (𝐺𝑍)⟩}))
295, 27, 28syl2anc 596 . 2 (𝜒 → Fun (𝑃 ∪ {⟨𝑥, (𝐺𝑍)⟩}))
30 bnj1421.12 . . 3 𝑄 = (𝑃 ∪ {⟨𝑥, (𝐺𝑍)⟩})
3130funeqi 6548 . 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 1570  wex 1812  wcel 2145  {cab 2738  wne 2955  wral 3076  wrex 3086  {crab 3412  [wsbc 3738  cun 3896  cin 3897  wss 3898  c0 4278  {csn 4583  cop 4589   cuni 4866   ciun 4950   class class class wbr 5102  dom cdm 5647  cres 5649  Fun wfun 6521   Fn wfn 6522  cfv 6527   predc-bnj14 35253   FrSe w-bnj15 35257   trClc-bnj18 35259
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 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7734  ax-reg 9564  ax-inf2 9620
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 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-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-pss 3918  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 5542  df-eprel 5547  df-po 5555  df-so 5556  df-fr 5600  df-we 5602  df-xp 5653  df-rel 5654  df-cnv 5655  df-co 5656  df-dm 5657  df-rn 5658  df-res 5659  df-ima 5660  df-ord 6354  df-on 6355  df-lim 6356  df-suc 6357  df-iota 6483  df-fun 6529  df-fn 6530  df-f 6531  df-f1 6532  df-fo 6533  df-f1o 6534  df-fv 6535  df-om 7861  df-1o 8454  df-bnj17 35252  df-bnj14 35254  df-bnj13 35256  df-bnj15 35258  df-bnj18 35260  df-bnj19 35262
This theorem is used by:  bnj1312  35622
  Copyright terms: Public domain W3C validator