Table of ContentsTable of Contents Mathbox for Jonathan Ben-Naim < Previous   Next >
Related theorems
Unicode version

Theorem bnj112 12457
Description: First-order logic and set theory.
Hypotheses
Ref Expression
bnj112.1 |- D = (om \ {(/)})
bnj112.2 |- (ta <-> A.m e. D (m _E n -> [m / n]th))
Assertion
Ref Expression
bnj112 |- (n = 1o -> ta)
Distinct variable group:   m,n

Proof of Theorem bnj112
StepHypRef Expression
1 ax-17 1317 . . . 4 |- (n = 1o -> A.m n = 1o)
2 breq2 3342 . . . . . 6 |- (n = 1o -> (m _E n <-> m _E 1o))
3 visset 2295 . . . . . . . 8 |- m e. _V
4 bnj105 12451 . . . . . . . 8 |- 1o e. _V
53, 4epelc 3584 . . . . . . 7 |- (m _E 1o <-> m e. 1o)
6 el1o 5191 . . . . . . 7 |- (m e. 1o <-> m = (/))
75, 6bitr2i 191 . . . . . 6 |- (m = (/) <-> m _E 1o)
82, 7syl6bbr 597 . . . . 5 |- (n = 1o -> (m _E n <-> m = (/)))
9 elndif 2732 . . . . . 6 |- (m e. {(/)} -> -. m e. (om \ {(/)}))
10 elsn 3058 . . . . . 6 |- (m e. {(/)} <-> m = (/))
11 bnj112.1 . . . . . . . . 9 |- D = (om \ {(/)})
1211eleq2i 1961 . . . . . . . 8 |- (m e. D <-> m e. (om \ {(/)}))
1312notbii 204 . . . . . . 7 |- (-. m e. D <-> -. m e. (om \ {(/)}))
1413bicomi 189 . . . . . 6 |- (-. m e. (om \ {(/)}) <-> -. m e. D)
159, 10, 143imtr3i 235 . . . . 5 |- (m = (/) -> -. m e. D)
168, 15syl6bi 231 . . . 4 |- (n = 1o -> (m _E n -> -. m e. D))
171, 1619.21ai 1345 . . 3 |- (n = 1o -> A.m(m _E n -> -. m e. D))
18 iman 256 . . . . . . 7 |- ((m _E n -> -. m e. D) <-> -. (m _E n /\ -. -. m e. D))
19 notnot 178 . . . . . . . . . 10 |- (m e. D <-> -. -. m e. D)
2019bicomi 189 . . . . . . . . 9 |- (-. -. m e. D <-> m e. D)
2120anbi2i 538 . . . . . . . 8 |- ((m _E n /\ -. -. m e. D) <-> (m _E n /\ m e. D))
2221notbii 204 . . . . . . 7 |- (-. (m _E n /\ -. -. m e. D) <-> -. (m _E n /\ m e. D))
23 ancom 482 . . . . . . . 8 |- ((m _E n /\ m e. D) <-> (m e. D /\ m _E n))
2423notbii 204 . . . . . . 7 |- (-. (m _E n /\ m e. D) <-> -. (m e. D /\ m _E n))
2518, 22, 243bitri 194 . . . . . 6 |- ((m _E n -> -. m e. D) <-> -. (m e. D /\ m _E n))
2625biimpi 168 . . . . 5 |- ((m _E n -> -. m e. D) -> -. (m e. D /\ m _E n))
2726pm2.21d 94 . . . 4 |- ((m _E n -> -. m e. D) -> ((m e. D /\ m _E n) -> [m / n]th))
2827alimi 1338 . . 3 |- (A.m(m _E n -> -. m e. D) -> A.m((m e. D /\ m _E n) -> [m / n]th))
2917, 28syl 12 . 2 |- (n = 1o -> A.m((m e. D /\ m _E n) -> [m / n]th))
30 bnj112.2 . . 3 |- (ta <-> A.m e. D (m _E n -> [m / n]th))
31 df-ral 2109 . . 3 |- (A.m e. D (m _E n -> [m / n]th) <-> A.m(m e. D -> (m _E n -> [m / n]th)))
32 impexp 374 . . . . 5 |- (((m e. D /\ m _E n) -> [m / n]th) <-> (m e. D -> (m _E n -> [m / n]th)))
3332bicomi 189 . . . 4 |- ((m e. D -> (m _E n -> [m / n]th)) <-> ((m e. D /\ m _E n) -> [m / n]th))
3433albii 1346 . . 3 |- (A.m(m e. D -> (m _E n -> [m / n]th)) <-> A.m((m e. D /\ m _E n) -> [m / n]th))
3530, 31, 343bitri 194 . 2 |- (ta <-> A.m((m e. D /\ m _E n) -> [m / n]th))
3629, 35sylibr 217 1 |- (n = 1o -> ta)
Colors of variables: wff set class
Syntax hints:  -. wn 2   -> wi 3   <-> wb 163   /\ wa 240  A.wal 1296   = wceq 1298   e. wcel 1300  [wsbc 1534  A.wral 2105   \ cdif 2590  (/)c0 2875  {csn 3044   class class class wbr 3338   _E cep 3581  omcom 3949  1oc1o 5172
This theorem is referenced by:  bnj116 12460
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 1304  ax-gen 1305  ax-8 1306  ax-9 1307  ax-10 1308  ax-11 1309  ax-12 1310  ax-14 1312  ax-17 1317  ax-4 1319  ax-5o 1321  ax-6o 1324  ax-9o 1481  ax-10o 1500  ax-16 1580  ax-11o 1588  ax-ext 1865  ax-sep 3438  ax-nul 3445  ax-pow 3481  ax-pr 3524
This theorem depends on definitions:  df-bi 164  df-or 241  df-an 242  df-ex 1327  df-sb 1536  df-eu 1775  df-mo 1776  df-clab 1872  df-cleq 1877  df-clel 1880  df-ne 2019  df-ral 2109  df-v 2294  df-dif 2597  df-un 2600  df-in 2603  df-ss 2605  df-nul 2876  df-pw 3035  df-sn 3049  df-pr 3050  df-op 3053  df-br 3339  df-opab 3396  df-eprel 3583  df-suc 3663  df-1o 5177
Copyright terms: Public domain