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

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

Proof of Theorem bnj1388
StepHypRef Expression
1 bnj1388.7 . . 3 (𝜒 ↔ (𝜓 ∧ 𝑥 ∈ 𝐷 ∧ ∀𝑦 ∈ 𝐷 ¬ 𝑦𝑅𝑥))
2 nfv 1951 . . . 4 Ⅎ𝑦𝜓
3 nfv 1951 . . . 4 Ⅎ𝑦 𝑥 ∈ 𝐷
4 nfra1 3290 . . . 4 Ⅎ𝑦∀𝑦 ∈ 𝐷 ¬ 𝑦𝑅𝑥
52, 3, 4nf3an 1938 . . 3 Ⅎ𝑦(𝜓 ∧ 𝑥 ∈ 𝐷 ∧ ∀𝑦 ∈ 𝐷 ¬ 𝑦𝑅𝑥)
61, 5nfxfr 1888 . 2 Ⅎ𝑦𝜒
7 bnj1152 35740 . . . . . 6 (𝑦 ∈ pred(𝑥, 𝐴, 𝑅) ↔ (𝑦 ∈ 𝐴 ∧ 𝑦𝑅𝑥))
87simplbi 502 . . . . 5 (𝑦 ∈ pred(𝑥, 𝐴, 𝑅) → 𝑦 ∈ 𝐴)
98adantl 487 . . . 4 ((𝜒 ∧ 𝑦 ∈ pred(𝑥, 𝐴, 𝑅)) → 𝑦 ∈ 𝐴)
107bilani 510 . . . . . . . 8 ((𝜒 ∧ 𝑦 ∈ pred(𝑥, 𝐴, 𝑅)) → (𝑦 ∈ 𝐴 ∧ 𝑦𝑅𝑥))
1110simprd 501 . . . . . . 7 ((𝜒 ∧ 𝑦 ∈ pred(𝑥, 𝐴, 𝑅)) → 𝑦𝑅𝑥)
121simp3bi 1166 . . . . . . . 8 (𝜒 → ∀𝑦 ∈ 𝐷 ¬ 𝑦𝑅𝑥)
1312adantr 486 . . . . . . 7 ((𝜒 ∧ 𝑦 ∈ pred(𝑥, 𝐴, 𝑅)) → ∀𝑦 ∈ 𝐷 ¬ 𝑦𝑅𝑥)
14 df-ral 3084 . . . . . . . . 9 (∀𝑦 ∈ 𝐷 ¬ 𝑦𝑅𝑥 ↔ ∀𝑦(𝑦 ∈ 𝐷 → ¬ 𝑦𝑅𝑥))
15 con2b 362 . . . . . . . . . 10 ((𝑦 ∈ 𝐷 → ¬ 𝑦𝑅𝑥) ↔ (𝑦𝑅𝑥 → ¬ 𝑦 ∈ 𝐷))
1615albii 1854 . . . . . . . . 9 (∀𝑦(𝑦 ∈ 𝐷 → ¬ 𝑦𝑅𝑥) ↔ ∀𝑦(𝑦𝑅𝑥 → ¬ 𝑦 ∈ 𝐷))
1714, 16bitri 278 . . . . . . . 8 (∀𝑦 ∈ 𝐷 ¬ 𝑦𝑅𝑥 ↔ ∀𝑦(𝑦𝑅𝑥 → ¬ 𝑦 ∈ 𝐷))
18 sp 2226 . . . . . . . . 9 (∀𝑦(𝑦𝑅𝑥 → ¬ 𝑦 ∈ 𝐷) → (𝑦𝑅𝑥 → ¬ 𝑦 ∈ 𝐷))
1918impcom 413 . . . . . . . 8 ((𝑦𝑅𝑥 ∧ ∀𝑦(𝑦𝑅𝑥 → ¬ 𝑦 ∈ 𝐷)) → ¬ 𝑦 ∈ 𝐷)
2017, 19sylan2b 606 . . . . . . 7 ((𝑦𝑅𝑥 ∧ ∀𝑦 ∈ 𝐷 ¬ 𝑦𝑅𝑥) → ¬ 𝑦 ∈ 𝐷)
2111, 13, 20syl2anc 596 . . . . . 6 ((𝜒 ∧ 𝑦 ∈ pred(𝑥, 𝐴, 𝑅)) → ¬ 𝑦 ∈ 𝐷)
22 bnj1388.5 . . . . . . . 8 𝐷 = {𝑥 ∈ 𝐴 ∣ ¬ ∃𝑓𝜏}
2322eleq2i 2859 . . . . . . 7 (𝑦 ∈ 𝐷 ↔ 𝑦 ∈ {𝑥 ∈ 𝐴 ∣ ¬ ∃𝑓𝜏})
24 nfcv 2929 . . . . . . . 8 Ⅎ𝑥𝑦
25 nfcv 2929 . . . . . . . 8 Ⅎ𝑥𝐴
26 bnj1388.8 . . . . . . . . . . 11 (𝜏′ ↔ [𝑦 / 𝑥]𝜏)
27 nfsbc1v 3761 . . . . . . . . . . 11 Ⅎ𝑥[𝑦 / 𝑥]𝜏
2826, 27nfxfr 1888 . . . . . . . . . 10 Ⅎ𝑥𝜏′
2928nfex 2361 . . . . . . . . 9 Ⅎ𝑥∃𝑓𝜏′
3029nfn 1892 . . . . . . . 8 Ⅎ𝑥 ¬ ∃𝑓𝜏′
31 sbceq1a 3752 . . . . . . . . . . 11 (𝑥 = 𝑦 → (𝜏 ↔ [𝑦 / 𝑥]𝜏))
3231, 26bitr4di 292 . . . . . . . . . 10 (𝑥 = 𝑦 → (𝜏 ↔ 𝜏′))
3332exbidv 1958 . . . . . . . . 9 (𝑥 = 𝑦 → (∃𝑓𝜏 ↔ ∃𝑓𝜏′))
3433notbid 321 . . . . . . . 8 (𝑥 = 𝑦 → (¬ ∃𝑓𝜏 ↔ ¬ ∃𝑓𝜏′))
3524, 25, 30, 34elrabf 3644 . . . . . . 7 (𝑦 ∈ {𝑥 ∈ 𝐴 ∣ ¬ ∃𝑓𝜏} ↔ (𝑦 ∈ 𝐴 ∧ ¬ ∃𝑓𝜏′))
3623, 35bitri 278 . . . . . 6 (𝑦 ∈ 𝐷 ↔ (𝑦 ∈ 𝐴 ∧ ¬ ∃𝑓𝜏′))
3721, 36sylnib 331 . . . . 5 ((𝜒 ∧ 𝑦 ∈ pred(𝑥, 𝐴, 𝑅)) → ¬ (𝑦 ∈ 𝐴 ∧ ¬ ∃𝑓𝜏′))
38 iman 407 . . . . 5 ((𝑦 ∈ 𝐴 → ∃𝑓𝜏′) ↔ ¬ (𝑦 ∈ 𝐴 ∧ ¬ ∃𝑓𝜏′))
3937, 38sylibr 237 . . . 4 ((𝜒 ∧ 𝑦 ∈ pred(𝑥, 𝐴, 𝑅)) → (𝑦 ∈ 𝐴 → ∃𝑓𝜏′))
409, 39mpd 16 . . 3 ((𝜒 ∧ 𝑦 ∈ pred(𝑥, 𝐴, 𝑅)) → ∃𝑓𝜏′)
4140ex 418 . 2 (𝜒 → (𝑦 ∈ pred(𝑥, 𝐴, 𝑅) → ∃𝑓𝜏′))
426, 41ralrimi 3264 1 (𝜒 → ∀𝑦 ∈ pred (𝑥, 𝐴, 𝑅)∃𝑓𝜏′)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1104  ∀wal 1570   = wceq 1572  ∃wex 1814   ∈ wcel 2150  {cab 2744   ≠ wne 2962  ∀wral 3083  ∃wrex 3093  {crab 3415  [wsbc 3741   ⊆ wss 3899   ∪ cun 4151  ∅c0 4280  {csn 4587  ⟨cop 4839   class class class wbr 5107  dom cdm 5657   ↾ cres 5659   Fn wfn 6560  ‘cfv 6565   predc-bnj14 35431   FrSe w-bnj15 35435   trClc-bnj18 35437
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-10 2183  ax-11 2200  ax-12 2219  ax-ext 2738
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1106  df-tru 1575  df-fal 1585  df-ex 1815  df-nf 1819  df-sb 2104  df-clab 2745  df-cleq 2758  df-clel 2842  df-nfc 2916  df-ral 3084  df-rab 3416  df-v 3455  df-sbc 3742  df-ss 3900  df-dif 4049  df-un 4153  df-nul 4281  df-if 4485  df-sn 4588  df-pr 4590  df-op 4840  df-br 5108  df-bnj14 35432
This theorem is used by:  bnj1398  35776  bnj1489  35798
  Copyright terms: Public domain W3C validator