New Foundations Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  NFE Home  >  Th. List  >  nchoicelem3 GIF version

Theorem nchoicelem3 6291
 Description: Lemma for nchoice 6308. Compute the value of Spac when the argument is not exponentiable. Theorem 6.2 of [Specker] p. 973. (Contributed by SF, 13-Mar-2015.)
Assertion
Ref Expression
nchoicelem3 ((M NC ¬ (Mc 0c) NC ) → ( SpacM) = {M})

Proof of Theorem nchoicelem3
Dummy variables p x y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 spacval 6282 . . 3 (M NC → ( SpacM) = Clos1 ({M}, {x, y (x NC y NC y = (2cc x))}))
21adantr 451 . 2 ((M NC ¬ (Mc 0c) NC ) → ( SpacM) = Clos1 ({M}, {x, y (x NC y NC y = (2cc x))}))
3 elimasn 5019 . . . . . . . 8 (p ({x, y (x NC y NC y = (2cc x))} “ {M}) ↔ M, p {x, y (x NC y NC y = (2cc x))})
4 df-br 4640 . . . . . . . 8 (M{x, y (x NC y NC y = (2cc x))}pM, p {x, y (x NC y NC y = (2cc x))})
53, 4bitr4i 243 . . . . . . 7 (p ({x, y (x NC y NC y = (2cc x))} “ {M}) ↔ M{x, y (x NC y NC y = (2cc x))}p)
6 vex 2862 . . . . . . . . 9 p V
7 eleq1 2413 . . . . . . . . . . 11 (x = M → (x NCM NC ))
8 oveq2 5531 . . . . . . . . . . . 12 (x = M → (2cc x) = (2cc M))
98eqeq2d 2364 . . . . . . . . . . 11 (x = M → (y = (2cc x) ↔ y = (2cc M)))
107, 93anbi13d 1254 . . . . . . . . . 10 (x = M → ((x NC y NC y = (2cc x)) ↔ (M NC y NC y = (2cc M))))
11 eleq1 2413 . . . . . . . . . . 11 (y = p → (y NCp NC ))
12 eqeq1 2359 . . . . . . . . . . 11 (y = p → (y = (2cc M) ↔ p = (2cc M)))
1311, 123anbi23d 1255 . . . . . . . . . 10 (y = p → ((M NC y NC y = (2cc M)) ↔ (M NC p NC p = (2cc M))))
14 eqid 2353 . . . . . . . . . 10 {x, y (x NC y NC y = (2cc x))} = {x, y (x NC y NC y = (2cc x))}
1510, 13, 14brabg 4706 . . . . . . . . 9 ((M NC p V) → (M{x, y (x NC y NC y = (2cc x))}p ↔ (M NC p NC p = (2cc M))))
166, 15mpan2 652 . . . . . . . 8 (M NC → (M{x, y (x NC y NC y = (2cc x))}p ↔ (M NC p NC p = (2cc M))))
17 eleq1 2413 . . . . . . . . . . 11 (p = (2cc M) → (p NC ↔ (2cc M) NC ))
1817biimpac 472 . . . . . . . . . 10 ((p NC p = (2cc M)) → (2cc M) NC )
19 2nc 6168 . . . . . . . . . . 11 2c NC
20 ceclr 6187 . . . . . . . . . . . 12 ((2c NC M NC (2cc M) NC ) → ((2cc 0c) NC (Mc 0c) NC ))
2120simprd 449 . . . . . . . . . . 11 ((2c NC M NC (2cc M) NC ) → (Mc 0c) NC )
2219, 21mp3an1 1264 . . . . . . . . . 10 ((M NC (2cc M) NC ) → (Mc 0c) NC )
2318, 22sylan2 460 . . . . . . . . 9 ((M NC (p NC p = (2cc M))) → (Mc 0c) NC )
24233impb 1147 . . . . . . . 8 ((M NC p NC p = (2cc M)) → (Mc 0c) NC )
2516, 24syl6bi 219 . . . . . . 7 (M NC → (M{x, y (x NC y NC y = (2cc x))}p → (Mc 0c) NC ))
265, 25syl5bi 208 . . . . . 6 (M NC → (p ({x, y (x NC y NC y = (2cc x))} “ {M}) → (Mc 0c) NC ))
2726con3d 125 . . . . 5 (M NC → (¬ (Mc 0c) NC → ¬ p ({x, y (x NC y NC y = (2cc x))} “ {M})))
2827imp 418 . . . 4 ((M NC ¬ (Mc 0c) NC ) → ¬ p ({x, y (x NC y NC y = (2cc x))} “ {M}))
2928eq0rdv 3585 . . 3 ((M NC ¬ (Mc 0c) NC ) → ({x, y (x NC y NC y = (2cc x))} “ {M}) = )
30 snex 4111 . . . 4 {M} V
31 spacvallem1 6281 . . . 4 {x, y (x NC y NC y = (2cc x))} V
32 eqid 2353 . . . 4 Clos1 ({M}, {x, y (x NC y NC y = (2cc x))}) = Clos1 ({M}, {x, y (x NC y NC y = (2cc x))})
3330, 31, 32clos1nrel 5886 . . 3 (({x, y (x NC y NC y = (2cc x))} “ {M}) = Clos1 ({M}, {x, y (x NC y NC y = (2cc x))}) = {M})
3429, 33syl 15 . 2 ((M NC ¬ (Mc 0c) NC ) → Clos1 ({M}, {x, y (x NC y NC y = (2cc x))}) = {M})
352, 34eqtrd 2385 1 ((M NC ¬ (Mc 0c) NC ) → ( SpacM) = {M})
 Colors of variables: wff setvar class Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 176   ∧ wa 358   ∧ w3a 934   = wceq 1642   ∈ wcel 1710  Vcvv 2859  ∅c0 3550  {csn 3737  0cc0c 4374  ⟨cop 4561  {copab 4622   class class class wbr 4639   “ cima 4722   ‘cfv 4781  (class class class)co 5525   Clos1 cclos1 5872   NC cncs 6088  2cc2c 6094   ↑c cce 6096   Spac cspac 6273 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1546  ax-5 1557  ax-17 1616  ax-9 1654  ax-8 1675  ax-13 1712  ax-14 1714  ax-6 1729  ax-7 1734  ax-11 1746  ax-12 1925  ax-ext 2334  ax-nin 4078  ax-xp 4079  ax-cnv 4080  ax-1c 4081  ax-sset 4082  ax-si 4083  ax-ins2 4084  ax-ins3 4085  ax-typlower 4086  ax-sn 4087 This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3or 935  df-3an 936  df-nan 1288  df-tru 1319  df-ex 1542  df-nf 1545  df-sb 1649  df-eu 2208  df-mo 2209  df-clab 2340  df-cleq 2346  df-clel 2349  df-nfc 2478  df-ne 2518  df-ral 2619  df-rex 2620  df-reu 2621  df-rmo 2622  df-rab 2623  df-v 2861  df-sbc 3047  df-nin 3211  df-compl 3212  df-in 3213  df-un 3214  df-dif 3215  df-symdif 3216  df-ss 3259  df-pss 3261  df-nul 3551  df-if 3663  df-pw 3724  df-sn 3741  df-pr 3742  df-uni 3892  df-int 3927  df-opk 4058  df-1c 4136  df-pw1 4137  df-uni1 4138  df-xpk 4185  df-cnvk 4186  df-ins2k 4187  df-ins3k 4188  df-imak 4189  df-cok 4190  df-p6 4191  df-sik 4192  df-ssetk 4193  df-imagek 4194  df-idk 4195  df-iota 4339  df-0c 4377  df-addc 4378  df-nnc 4379  df-fin 4380  df-lefin 4440  df-ltfin 4441  df-ncfin 4442  df-tfin 4443  df-evenfin 4444  df-oddfin 4445  df-sfin 4446  df-spfin 4447  df-phi 4565  df-op 4566  df-proj1 4567  df-proj2 4568  df-opab 4623  df-br 4640  df-1st 4723  df-swap 4724  df-sset 4725  df-co 4726  df-ima 4727  df-si 4728  df-id 4767  df-xp 4784  df-cnv 4785  df-rn 4786  df-dm 4787  df-res 4788  df-fun 4789  df-fn 4790  df-f 4791  df-f1 4792  df-fo 4793  df-f1o 4794  df-fv 4795  df-2nd 4797  df-ov 5526  df-oprab 5528  df-mpt 5652  df-mpt2 5654  df-txp 5736  df-fix 5740  df-compose 5748  df-ins2 5750  df-ins3 5752  df-image 5754  df-ins4 5756  df-si3 5758  df-funs 5760  df-fns 5762  df-pw1fn 5766  df-fullfun 5768  df-clos1 5873  df-trans 5899  df-sym 5908  df-er 5909  df-ec 5947  df-qs 5951  df-map 6001  df-en 6029  df-ncs 6098  df-nc 6101  df-2c 6104  df-ce 6106  df-spac 6274 This theorem is referenced by:  nchoicelem9  6297  nchoicelem12  6300  nchoicelem15  6303  nchoicelem17  6305  nchoicelem19  6307
 Copyright terms: Public domain W3C validator